Efficient heuristics for Median Cycle Problems

Journal of the Operational Research Society

Volumn 55, Issue 2, 2004, Pages 179-186

  Renaud, J ^a   Boctor, F F ^a   Laporte, G ^b,c  

^a UNIVERSITÉ LAVAL   (Canada)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Evolutionary algorithm; Greedy add heuristic; Median Cycle Problem

Indexed keywords

COSTS; EVOLUTIONARY ALGORITHMS; HAMILTONIANS; HEURISTIC METHODS; LINEAR PROGRAMMING; TELECOMMUNICATION NETWORKS; TRAVELING SALESMAN PROBLEM;

COST REDUCTION; CYCLE REDUCTION; GREEDY ADD HEURISTIC; MEDIAN CYCLE PROBLEM;

PROBLEM SOLVING;

EID: 2342572410     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601672     Document Type: Conference Paper

References (20)

1. Moreno Pérez J, Moreno-Vega M and Rodríguez Martín I (2002). Variable neighbourhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 2004, to appear.
2. Labbé M, Laporte G, Rodríguez Martín I and Salazar González JJ (2001). The Ring star problem: polyhedral analysis and exact algorithm. Unpublished manuscript.
3. Labbé M, Laporte G, Rodríguez Martín I and Salazar González JJ (2001). The median cycle problem. Unpublished manuscript.
4. Gourdin E, Labbé M and Yaman H (2002). Telecommunication and location. In: Drezner Z and Harnacher H (eds). Facility Location: Applications and Theory, Springer, Berlin, pp 275-305.
5. Klincewicz J (1998). Hub location in backbone/tributary network design: a review. Location Sci 6: 307-335.
6. Labbé M and Laporte G (1986). Maximizing user convenience and postal service efficiency in post box location. Belgian J Opns Res Stat Comput Sci 26: 21-35.
7. Bauer P (1997). The circuit polytope: facets. Math Opns Res 22: 110-145.
8. Laporte G (1988). Location-routing problems. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp 163-197.
9. Volgenant T and Jonker R (1987). On some generalizations of the traveling salesman problem. J Opl Res Soc 38: 1073-1079.
10. Gendreau M, Laporte G and Semet F (1998). The selective traveling salesman problem. Networks 32: 263-273.
11. Fischetti M, Salazar González JJ and Toth P (1998). Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10: 133-148.
12. Balas E (1989). The prize collecting traveling salesman problem. Networks 19: 621-636.
13. Gendreau M, Laporte G and Semet F (1997). The covering tour problem. Opns Res 45: 568-576.
14. Labbé M, Laporte G and Rodríguez Martín I (1998). Path, tree and cycle location. In: Crainic T and Laporte G (eds). Fleet Management and Logistics. Kluwer, Boston, pp 187-204.
15. Feremans C, Labbé M and Laporte G (2003). Generalized network design problems. Eur J Opl Res, to appear.
16. Renaud J, Boctor F and Laporte G (1996). Fast composite heuristic for the symmetric traveling salesman problem. ORSA J Comput 3: 134-143.
17. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 20:498-516.
18. Helsgaum K (2000). Effective implementation of the Lin-Kerninghan traveling salesman heuristic. Eur J Opl Res 126: 106-130.
19. Bean J (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6: 154-160.
20. Reinelt G (1991). TSPLIB - a traveling salesman problem library. ORSA J Comput 3: 376-384.