New mathematical models of the generalized vehicle routing problem and extensions
- 31 January 2012
- journal article
- Published by Elsevier BV in Applied Mathematical Modelling
- Vol. 36 (1), 97-107
- https://doi.org/10.1016/j.apm.2011.05.037
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- New Integer Programming Formulations of the Generalized Travelling Salesman ProblemAmerican Journal of Applied Sciences, 2007
- What you should know about the vehicle routing problemNaval Research Logistics (NRL), 2007
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPsTsinghua Science and Technology, 2007
- Some applications of the clustered travelling salesman problemJournal of the Operational Research Society, 2002
- An efficient transformation of the generalized vehicle routing problemEuropean Journal of Operational Research, 2000
- Routing problems: A bibliographyAnnals of Operations Research, 1995
- The symmetric generalized traveling salesman polytopeNetworks, 1995
- A branch-and-cut algorithm for vehicle routing problemsAnnals of Operations Research, 1994
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- An algorithm for the design of mailbox collection routes in urban areasTransportation Research Part B: Methodological, 1989