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 Citation (Scopus)

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 2013

Fingerprint

Approximation Algorithms
Scheduling Problem
Vehicle Scheduling
Flow Shop Scheduling
Vehicle Routing Problem
Multiple Objectives
Accumulate
Time Constant
Polynomial time
Customers
NP-complete problem
Lower bound
Series
Approximation

Keywords

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

ASJC Scopus subject areas

  • Control and Optimization

Cite this

A constant-factor approximation algorithm for multi-vehicle collection for processing problem. / Yücel, E.; Salman, F. S.; Örmeci, E. L.; Gel, Esma.

In: Optimization Letters, Vol. 7, No. 7, 10.2013, p. 1627-1642.

Research output: Contribution to journalArticle

Yücel, E. ; Salman, F. S. ; Örmeci, E. L. ; Gel, Esma. / A constant-factor approximation algorithm for multi-vehicle collection for processing problem. In: Optimization Letters. 2013 ; Vol. 7, No. 7. pp. 1627-1642.
@article{c1367fee1fd642a28b47611dad8747df,
title = "A constant-factor approximation algorithm for multi-vehicle collection for processing problem",
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.",
keywords = "Approximation algorithm, Collection, Makespan, Vehicle routing and scheduling",
author = "E. Y{\"u}cel and Salman, {F. S.} and {\"O}rmeci, {E. L.} and Esma Gel",
year = "2013",
month = "10",
doi = "10.1007/s11590-012-0578-1",
language = "English (US)",
volume = "7",
pages = "1627--1642",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "7",

}

TY - JOUR

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

AU - Yücel, E.

AU - Salman, F. S.

AU - Örmeci, E. L.

AU - Gel, Esma

PY - 2013/10

Y1 - 2013/10

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - Collection

KW - Makespan

KW - Vehicle routing and scheduling

UR - http://www.scopus.com/inward/record.url?scp=84884669819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884669819&partnerID=8YFLogxK

U2 - 10.1007/s11590-012-0578-1

DO - 10.1007/s11590-012-0578-1

M3 - Article

AN - SCOPUS:84884669819

VL - 7

SP - 1627

EP - 1642

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 7

ER -