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

Shuguang Liu, Lei Lei and Sunju Park

Transportation Research Part E: Logistics and Transportation Review, 2008, vol. 44, issue 3, 350-360

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.

Keywords: Delivery; scheduling; Bin-packing; Split; delivery; Fixed; route (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554506000871
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:44:y:2008:i:3:p:350-360

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().