A ring-based diversification scheme for routing problems
by Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 1/2, 2009

Abstract: The split delivery vehicle routing problem (SDVRP) relaxes the classical vehicle routing problem (VRP) by allowing multiple vehicles to supply the demand of individual customers thereby potentially reducing costs. This article provides an up-to-date review of the SDVRP literature and presents a new solution diversification scheme based on concentric rings centred at the depot that partitions the original problem. The resulting subproblems are then solved using a constructive approach. Different ring settings produce varied partitions and thus different solutions to the original problem are obtained and improved via a variable neighbourhood descent. Computational results on available test problems demonstrate the effectiveness of the proposed algorithm and present new best solutions to some of the tested problems.

Online publication date: Sat, 31-Jan-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com