کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481770 | 1446119 | 2010 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm](/preview/png/481770.png)
The Multi-Compartment Vehicle Routing Problem involves clients with a demand for different products and vehicles with several compartments to co-transport these commodities. We present a local search procedure that explores well-known moves (2-opt, cross, exchange, relocate), and exploits the mechanisms of neighbour lists and marking to speed up the searches. We combine the procedure with the Guided Local Search meta-heuristic to improve solution quality. Extensive computational results are reported to uncover when co-distribution by vehicles with multiple compartments is better than separate distribution with un-partitioned trucks. Sensitivities in key problem parameters including, client density and location of the depot, vehicle capacity, client demand and number of commodities are investigated.
Journal: European Journal of Operational Research - Volume 206, Issue 1, 1 October 2010, Pages 93–103