A transformation for the mixed general routing problem with turn penalties

Journal of the Operational Research Society

Volumn 59, Issue 4, 2008, Pages 540-547

  Soler, D ^a   Martinez E ^a   Mico J C ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Arc routing; Generalized travelling salesman problem; Mixed general routing problem; Transformation

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

ARC ROUTING; GENERALIZED TRAVELLING SALESMAN PROBLEM; MIXED GENERAL ROUTING PROBLEM;

VEHICLE ROUTING;

EID: 41149170627     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602385     Document Type: Conference Paper

References (19)

1. Albiach J, Sanchis JM and Soler D (2006). An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. Eur J Opl Res, doi: 10.1016/j.ejor.2006. 09.099.
2. Arkin EM, Bender MA, Demaine BD, Fekete SP, Mitchell JSB and Sethia S (2006). Optimal covering tours with turn costs. Siam J Comput 35: 531-566.
3. Bautista J and Pereira J (2004). Ant Algorithms for Urban Waste Collection Routing. Lecture Notes in Computer Science, Vol. 3172. Springer Berlin, pp 302-309.
4. Benavent E and Soler D (1999). The directed rural postman problem with turn penalties. Transp Sci 33: 408-418.
5. Biais M and Laporte G (2003). Exact solution of the generalized routing problem through graph transformations. J Opl Res Soc 54: 906-910.
6. Bodin L, Fagin G, Welebny R and Greenberg J (1989). The design of a computerized sanitation vehicle routing and scheduling for the town of Oyster Bay, New York. Comput Opl Res 16: 45-54.
7. Carpaneto G, Dell'Amico M and Toth P (1995). Exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans Math Softw 21: 394-409.
8. Chopra S and Rinaldi G (1996). The graphical asymmetric traveling salesman polyhedron: Symmetric inequalities. SIAM J Discrete Math 9: 602-624.
9. Clossey J, Laporte G and Soriano P (2001). Solving arc routing problems with turn penalties. J Opl Res Soc 52: 433-439.
10. Corberán A, Martí R, Martínez E and Soler D (2002). The rural postman problem on mixed graphs with turn penalties. Comput Opl Res 29: 887-903.
11. Corberán A, Romero A and Sanchis JM (2003). The mixed general routing polyhedron. Math Program Ser A 96: 103-137.
12. Corberán A, Mejía G and Sanchis JM (2005). New results on the mixed general routing problem. Opns Res 53:363-376.
13. CPLEX 8.0 (2002). http://www.ilog.com/products/cplex. ILOG S.A., France.
14. Fischetti M and Toth P (1997). A polyhedral approach to the asymmetric traveling salesman problem. Mngt Sci 43: 1520-1536.
15. Kwon SH, Kim HT and Kang MK (2005). Determination of the candidate arc set far the asymmetric traveling salesman problem. Comput Opl Res 32: 1045-1057.
16. Lacomme P, Prins C and Ramadane-Cherif W (2004). Competitive memetic algorithms for arc routing problems. Ann Opl Res 131: 159-185.
17. Lacomme P, Prins C and Ramadane-Cherif W (2005). Evolutionary algorithms for periodic arc routing problems. Eur J Opl Res 165: 535-553.
18. Noon CE and Bean JC (1993). An efficient transformation of the generalized traveling salesman problem. INFOR 31: 39-44.
19. Roy S and Rousseau JM (1989). The capacitated Canadian postman problem. INFOR 27: 58-73.