Heuristics for the lexicographic max-ordering vehicle routing problem
In this paper, we propose fast heuristics for the vehicle routing problem (VRP) with lexicographic max-order objective. A fixed number of vehicles, which are based at a depot, are to serve customers with known demands. The lexicographic max-order objective is introduced by asking to minimize lexicographically the sorted route lengths. Based on a model for this problem, several approaches are studied and new heuristic solution procedures are discussed resulting in the development of a sequential insertion heuristic and a modified savings algorithm in several variants. Comparisons between the algorithms are performed on instances of the VRP library VRPLIB. Finally, based on the results from the computational experiments, conclusions about the applicability and efficiency of the presented algorithms are drawn. Copyright Physica-Verlag 2006
Volume (Year): 14 (2006)
Issue (Month): 3 (September)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10100|
|Order Information:||Web: http://link.springer.de/orders.htm|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
- W. W. Garvin & H. W. Crandall & J. B. John & R. A. Spellman, 1957. "Applications of Linear Programming in the Oil Industry," Management Science, INFORMS, vol. 3(4), pages 407-430, July.
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:14:y:2006:i:3:p:313-336. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.