An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem

References

• Achuthan N. R., Caccetta L., Pervan G. P. Models for vehicle routing problems. Proc. 10th ASOR Conf. (1990) 276–294Google Scholar
• Achuthan N. R., Caccetta L. Integer linear programming formulation for a vehicle routing problem. Eur. J. Oper. Res. (1991) 52:86–89Crossref, Google Scholar
• Achuthan N. R., Caccetta L., Hill S. P. A new subtour elimination constraint for the vehicle routing problem. Eur. J. Oper. Res. (1996) 91:573–586Crossref, Google Scholar
• Araque J. R., Kudva G., Morin T. L., Pekny J. F. A branch and cut algorithm for vehicle routing problems. Ann. Oper. Res. (1994) 50:37–59Crossref, Google Scholar
• Augerat P., Belengner J. M., Benavent E., Cornberan A., Naddef D., Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport de recherche (1995) (Grenoble, France). RR949-M. ARTEMIS-IMAGGoogle Scholar
• Bodin L. D., Golden B. L., Assad A. A., Ball M. O. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10:69–211Google Scholar
• Bondy J. A., Murty U. S. R.Graph Theory with Applications (1976) (American Elsevier, Amsterdam, The Netherlands) Crossref, Google Scholar
• Campos V., Corberan A., Mota E. Polyhedral results for a vehicle routing problem. Eur. J. Oper. Res. (1991) 52:75–85Crossref, Google Scholar
• Christofides N., Lawler E. Vehicle routing. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, NY) 431–448et alGoogle Scholar
• Christofides N., Eilon S. An algorithm for the vehicle dispatching problem. Oper. Res. Quart. (1969) 20:309–318Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi M. The vehicle routing problem. Combinatorial Optimization (1979) 315–338Google Scholar
• Christofides N., Mingozzi A., Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming (1981) 20:255–282Crossref, Google Scholar
• Cornuejols G., Harche F. Polyhedral study of the capacitated vehicle routing problem. Math. Programming (1993) 60:21–52Crossref, Google Scholar
• . CPLEX Optimization, Inc Using the CPLEX Callable Library and CPLEX Mixed Integer Library. (1993) (Incline Village, NV) Google Scholar
• Crowder H., Padberg M. Solving large-scale symmetric traveling salesman problems to optimality. Management Sci (1980) 26:495–509Link, Google Scholar
• Eilon S., Watson-Gandy C. D. T., Christofides N.Distribution Management: Mathematical Modelling and Practical Analysis (1971) (Griffin, ed. Hafner Publications, London, U.K) Google Scholar
• Fisher M. L. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. (1994) 42:626–642Link, Google Scholar
• Hadjiconstantinou E., Christofides C., Mingozzi A. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. (1995) 61:21–43Crossref, Google Scholar
• Land A. H., Powell S.FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete (1973) (John Wiley and Sons, New York) Google Scholar
• Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59:213–247Google Scholar
• Laporte G., Nobert Y. Comb inequalities for the vehicle routing problem. Methods of Oper. Res. (1984) 51:271–276Google Scholar
• Laporte G., Nobert Y. Exact algorithms for the vehicle routing problem. Ann. Discrete Math. (1987) 31:147–184Google Scholar
• Laporte G., Nobert Y., Desrochers M. Optimal routing under capacity and distance restrictions. Oper. Res. (1985) 33:1050–1073Link, Google Scholar
• Padberg M. W., Rinaldi G. A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Rev (1991) 33:60–100Crossref, Google Scholar
• Paessens H. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. (1988) 34:336–344Crossref, Google Scholar
• Reinelt G. A traveling salesman problem library. ORSA J. Comput. (1981) 3:376–384Link, Google Scholar
• Taillard E. Parallel iterative search methods for vehicle routing problems. Networks (1993) 23:661–674Crossref, Google Scholar