Approximation Algorithms for a Balanced Capacity and Distance Constrained Vehicle Routing Problem

In the current paper we have investigated the capacitated distance constraint vehicle routing problem for the standard approximation algorithm. This problem consists of a number of different types of vehicles at the depot which differ at their capacity, cost and maximum distance bound. We have designed an approximation algorithm for this problem in the case that the tours are balanced.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Juraj Hromkovic,et al.  Algorithmics for Hard Problems , 2002, Texts in Theoretical Computer Science An EATCS Series.

[3]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[4]  Tetsuo Asano,et al.  A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree , 2001, J. Comb. Optim..

[5]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Stefan Näher,et al.  The Travelling Salesman Problem , 2011, Algorithms Unplugged.

[8]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[9]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[10]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  R. Ravi,et al.  Approximation algorithms for distance constrained vehicle routing problems , 2012, Networks.

[12]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[13]  Refael Hassin,et al.  Approximation algorithms for some vehicle routing problems , 2005, Discret. Appl. Math..

[14]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[15]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[16]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

[17]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[18]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[19]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[20]  Michel Gendreau,et al.  Metaheuristics in Vehicle Routing , 2012, International Conference on Operations Research and Enterprise Systems.

[21]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

[22]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[23]  Naoki Katoh,et al.  A Capacitated Vehicle Routing Problem on a Tree , 1998, ISAAC.

[24]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[25]  Alessandro Panconesi,et al.  Completeness in Approximation Classes , 1989, Inf. Comput..

[26]  Chung-Lun Li,et al.  On the Distance Constrained Vehicle Routing Problem , 1992, Oper. Res..