The effects of triangle inequality on the vehicle routing problem
AbstractRouting problems often utilize experimental networks to represent real world scenarios. However most ignore the inclusion of triangle inequality violations, a phenomenon resulting from delays or rounding errors within a network. This work evaluates the effect of both frequency – the number of violations – and severity – the degree of intensity of a violation – of triangle inequality and evaluates both solution quality and solution time based on Simulated Annealing, Ant Colony Optimization and Savings Algorithm methods. Findings indicate that while both frequency and severity degrade solution quality, increased levels of frequency and severity together result in significant adverse affects to solution quality. Solution time, however, is not impacted by the presence of triangle inequality violations within the network. This information should encourage practitioners to identify delays and maintain the presence of triangle inequality violations in a network to ensure accuracy of solution quality.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 224 (2013)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Routing; Traffic; Logistics;
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.:
- Kok, A.L. & Hans, E.W. & Schutten, J.M.J., 2011. "Optimizing departure times in vehicle routes," European Journal of Operational Research, Elsevier, vol. 210(3), pages 579-587, May.
- Donati, Alberto V. & Montemanni, Roberto & Casagrande, Norman & Rizzoli, Andrea E. & Gambardella, Luca M., 2008. "Time dependent vehicle routing problem with a multi ant colony system," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1174-1191, March.
- S. P. Brooks & N. Friel & R. King, 2003. "Classical model selection via simulated annealing," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 65(2), pages 503-520.
- Jeromin, Bernd & Korner, Frank, 1989. "Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 38(1), pages 70-75, January.
- Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
- Schilling, D. A. & Rosing, K. E. & ReVelle, C. S., 2000. "Network distance characteristics that affect computational effort in p-median location problems," European Journal of Operational Research, Elsevier, vol. 127(3), pages 525-536, December.
- Mari'n, Alfredo & Canovas, Lazaro & Landete, Mercedes, 2006. "New formulations for the uncapacitated multiple allocation hub location problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 274-292, July.
- Chris Groër & Bruce Golden & Edward Wasil, 2009. "The Consistent Vehicle Routing Problem," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 630-643, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.