A constant-factor approximation algorithm for multi-vehicle collection for processing problem

E. Yücel, F. S. Salman, E. L. Örmeci, Esma Gel

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

We define the multiple-vehicle collection for processing problem (mCfPP) as a vehicle routing and scheduling problem in which items that accumulate at customer sites over time should be transferred by a series of tours to a processing facility. We show that this problem with the makespan objective (mCfPP(Cmax)) is NP-hard using an approximation preserving reduction from a two-stage, hybrid flowshop scheduling problem. We develop a polynomial-time, constant-factor approximation algorithm to solve mCfPP(Cmax). The problem with a single site is analyzed as a special case with two purposes. First, we identify the minimum number of vehicles required to achieve a lower bound on the makespan, and second, we characterize the optimal makespan when a single vehicle is utilized.

Original languageEnglish (US)
Pages (from-to)1627-1642
Number of pages16
JournalOptimization Letters
Volume7
Issue number7
DOIs
StatePublished - Oct 1 2013

    Fingerprint

Keywords

  • Approximation algorithm
  • Collection
  • Makespan
  • Vehicle routing and scheduling

ASJC Scopus subject areas

  • Control and Optimization

Cite this