New mathematical models of the generalized vehicle routing problem and extensions

Applied Mathematical Modelling

Volumn 36, Issue 1, 2012, Pages 97-107

  Pop, Petricâ C ^a   Kara, Imdat ^b   Marc, Andrei Horvat ^a  

^a TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

^b BASKENT UNIVERSITY   (Turkey)

Author keywords

Generalized traveling salesman problem; Generalized vehicle routing problem; Integer programming; Network design; Vehicle routing problem

Indexed keywords

CAPACITY RESTRICTION; GENERALIZED TRAVELING SALESMAN PROBLEM; GENERALIZED VEHICLE ROUTING PROBLEM; LOWER BOUNDS; NETWORK DESIGN; NEW MATHEMATICAL MODEL; NEW MODEL; ROUTING PROBLEMS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING; MATHEMATICAL MODELS; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

TRAVELING SALESMAN PROBLEM;

EID: 80051805369     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2011.05.037     Document Type: Article

References (21)

1. Ghiani G., Improta G. An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 2000, 122:11-17.
2. I. Kara, T. Bektaş, Integer linear programming formulation of the generalized vehicle routing problem, in: Proc. of the 5th EURO/INFORMS Joint International Meeting, 2003.
3. Laporte G., Osman I.H. Routing problems: a bibliography. Ann. Oper. Res. 1995, 61:227-262.
4. Laporte G. What you should know about the vehicle routing problem. Naval Res. Log. 2007, 54:811-819.
5. Network Routing. Handbooks in Operations Research and Management Science 1995, vol. 8. Elsevier, Amsterdam. M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.).
6. Laporte G., Nobert Y. Generalized traveling salesman through n sets of nodes: an integer programming approach. INFOR 1983, 21:61-75.
7. Noon C.E., Bean J.C. A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Oper. Res. 1991, 39:623-632.
8. Fischetti M., Salazar J.J., Toth P. The symmetric generalized traveling salesman polytope. Networks 1995, 26:113-123.
9. Fischetti M., Salazar J.J., Toth P. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 1997, 45:378-394.
10. Pop P.C. New integer programming formulations of the generalized traveling salesman problem. Am. J. Appl. Sci. 2007, 4(11):932-937.
11. P.C. Pop, C.M. Pintea, I. Zelina, D. Dumitrescu, Solving the generalized vehicle routing problem with an ACS-based algorithm, American Institute of Physics (AIP), Conference Proceedings: BICS 2008, vol. 1117, no. 1, 2009, pp. 157-162.
12. P.C. Pop, O. Matei, C. Pop Sitar, C. Chira, A genetic algorithm for solving the generalized vehicle routing problem, in: E.S. Corchado Rodriguez et al. (Ed.) Proc. of HAIS 2010, Part II, Lecture Notes in Artificial Intelligence, vol. 6077, pp. 119-126, 2010.
13. Laporte G., Chapleau S., Landry P.E., Mercure H. An algorithm for the design of mail box collection routes in urban areas. Transp. Res. B 1989, 23:271-280.
14. Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transp. Sci. 2005, 39:188-205.
15. R. Baldacci, E. Bartolini, G. Laporte, Some applications of the Generalized Vehicle Routing Problem, Le Cahiers du GERAD, G-2008-82, 2008.
16. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 1991, 10:27-36.
17. Kara I., Laporte G., Bektaş T. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 2004, 158:793-795.
18. Laporte G., Palekar U. Some applications of the clustered traveling salesman problem. J. Oper. Res. Soc. 2002, 53:972-976.
19. Ding C., Cheng Y., He M. Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Sci. Technol. 2007, 12(4):459-465.
20. Araque J.R., Kudva G., Morin T.L., Pekny J.F. A branch and cut algorithm for vehicle routing problem. Ann. Oper. Res. 1994, 50:37-59.
21. A. Hertz, G. Laporte, M. Mittaz, A tabu search heuristic for the capacitated arc routing problem, Working Paper 96-08, Department de Mathematiques, Ecole Polytechnique Federal de Lausanne, 1996.