AbstractWe 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(n3log(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.
On the multi-product packing-delivery problem with a fixed route
Transportation Research Part E: Logistics and Transportation Review ; 44 , 3 ; 350-360
2006-10-28
11 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
On the multi-product packing-delivery problem with a fixed route
Online Contents | 2008
|On the multi-product packing-delivery problem with a fixed route
Online Contents | 2008
|Delivery vehicles for en route food product preparation
Europäisches Patentamt | 2024
|EN ROUTE PRODUCT DELIVERY BY UNMANNED AERIAL VEHICLES
Europäisches Patentamt | 2019
|DELIVERY VEHICLES FOR EN ROUTE FOOD PRODUCT PREPARATION
Europäisches Patentamt | 2021
|