The effects of triangle inequality on the vehicle routing problem
Authors:
- Christopher L. FlemingCFChristopher L. Fleming
- Stanley E. GriffisSGStanley E. Griffis
- John E. BellJBJohn E. Bell
- 1 January 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 224 (1) , 1-7
Abstract
No abstract availableThis publication has 42 references indexed in Scilit:
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time WindowsComputers & Operations Research, 2011
- SWARM INTELLIGENCE: APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM TO LOGISTICS‐ORIENTED VEHICLE ROUTING PROBLEMSJournal of Business Logistics, 2010
- The Parameterized Approximability of TSP with DeadlinesTheory of Computing Systems, 2007
- Ant colony optimization: Introduction and recent trendsPhysics of Life Reviews, 2005
- Complexity and Reducibility of the Skip Delivery ProblemTransportation Science, 2005
- Classical Model Selection via Simulated AnnealingJournal of the Royal Statistical Society Series B: Statistical Methodology, 2003
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problemTheoretical Computer Science, 2002
- Performance guarantees for the TSP with a parameterized triangle inequalityInformation Processing Letters, 2000
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle InequalitiesSIAM Journal on Discrete Mathematics, 1995
- Approximation algorithms for multi-dimensional assignment problems with decomposable costsDiscrete Applied Mathematics, 1994