Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm

Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm

0.00 Avg rating0 Votes
Article ID: iaor20097324
Country: United Kingdom
Volume: 59
Issue: 12
Start Page Number: 1685
End Page Number: 1695
Publication Date: Dec 2008
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

The capacitated vehicle routing problem (CVRP) with a single depot is a classic routing problem with numerous real–world applications. This paper describes the design, modelling and computational aspects of ALGELECT (electrostatic algorithm), a new algorithm for the CVRP. After some general remarks about the origin of the algorithm and its parameters, a parameter tuning process is carried out in order to improve its efficiency. The algorithm is then explained in detail and its main characteristics are presented. Thus, ALGELECT develops good–quality solutions to the CVRP, in terms of the number of scheduled routes and the load ratio of the delivery vehicles. Finally, ALGELECT is used to find solutions for some Solomon's and Augerat's instances, which are then compared to solutions generated by other well–known methods.

Reviews

Required fields are marked *. Your email address will not be published.