On the benefits of co-collection: experiments with a multi compartment vehicle routing algorithm

Muyldermans, Luc and Pang, Gu (2010) On the benefits of co-collection: experiments with a multi compartment vehicle routing algorithm. European Journal of Operational Research, 206 (1). pp. 93-103. ISSN 0377-2217

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Routing, multi-compartment routing, meta-heuristics, guided local search, co-collection, separate collection
Subjects:	G200 Operational Research
Department:	Faculties > Business and Law > Newcastle Business School
Depositing User:	EPrint Services
Date Deposited:	03 Feb 2010 15:49
Last Modified:	19 Nov 2019 09:52
URI:	http://nrl.northumbria.ac.uk/id/eprint/1164

Downloads