On the multi-product packing-delivery problem with a fixed route

Shuguang Liu, Lei Lei, Sunju Park

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3 log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.

Original languageEnglish
Pages (from-to)350-360
Number of pages11
JournalTransportation Research Part E: Logistics and Transportation Review
Volume44
Issue number3
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Trucks
Computational complexity
Polynomials
customer
performance
Optimality
Schedule
Split delivery
Performance improvement

All Science Journal Classification (ASJC) codes

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Cite this

@article{00d0d9799d294f68861297b431a70162,
title = "On the multi-product packing-delivery problem with a fixed route",
abstract = "We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3 log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.",
author = "Shuguang Liu and Lei Lei and Sunju Park",
year = "2008",
month = "1",
day = "1",
doi = "10.1016/j.tre.2006.10.009",
language = "English",
volume = "44",
pages = "350--360",
journal = "Transportation Research, Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",
number = "3",

}

On the multi-product packing-delivery problem with a fixed route. / Liu, Shuguang; Lei, Lei; Park, Sunju.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 44, No. 3, 01.01.2008, p. 350-360.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On the multi-product packing-delivery problem with a fixed route

AU - Liu, Shuguang

AU - Lei, Lei

AU - Park, Sunju

PY - 2008/1/1

Y1 - 2008/1/1

N2 - We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3 log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.

AB - We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3 log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.

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

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

U2 - 10.1016/j.tre.2006.10.009

DO - 10.1016/j.tre.2006.10.009

M3 - Article

VL - 44

SP - 350

EP - 360

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 3

ER -