Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6625 LNCS, Issue PART 2, 2011, Pages 501-510

  Rimmel, Arpad ^a   Teytaud, Fabien ^b   Cazenave, Tristan ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Nested Monte Carlo; Self Adaptation; Time Window; Traveling Salesman

Indexed keywords

EVOLUTIONARY ALGORITHMS; MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING;

EVOLUTION STRATEGIES; FITNESS FUNCTIONS; NESTED MONTE-CARLO; OPTIMIZATION ALGORITHMS; SELF ADAPTATION; TIME WINDOWS; TRAVELING SALESMAN; TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 79955818212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20520-0_51     Document Type: Conference Paper

References (16)

1. Baker, E.: An exact algorithm for the time-constrained traveling salesman problem. Operations Research 31(5), 938-945 (1983)
2. Beyer, H.-G.: The Theory of Evolution Strategies. Natural Computing Series. Springer, Heidelberg (2001)
3. Beyer, H.-G., Sendhoff, B.: Covariance matrix adaptation revisited - the CMSA evolution strategy. In: Rudolph, G., Jansen, T., Lucas, S.M., Poloni, C., Beume, N. (eds.) Proceedings of PPSN, pp. 123-132 (2008)
4. Cazenave, T.: Nested Monte-Carlo search. In: IJCAI, pp. 456-461 (2009)
5. Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145-164 (1981)
6. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.: An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43(2), 367-371 (1995)
7. Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing 14(4), 403-417 (2002)
8. Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 46(3), 330-335 (1998)
9. López-Ibáñez, M., Blum, C.: Beam-ACO for the travelling salesman problem with time windows. Computers & OR 37(9), 1570-1583 (2010)
10. Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science 32(1), 12-29 (1998)
11. Potvin, J., Bengio, S.: The vehicle routing problem with time windows part II: genetic search. INFORMS Journal on Computing 8(2), 165 (1996)
12. Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart (1973)
13. Savelsbergh, M.: Local search in routing problems with time windows. Annals of Operations Research 4(1), 285-305 (1985)
14. Schwefel, H.-P.: Adaptive Mechanismen in der biologischen Evolution und ihr Einfluss auf die Evolutionsgeschwindigkeit. Interner Bericht der Arbeitsgruppe Bionik und Evolutionstechnik am Institut für Mess- und Regelungstechnik Re 215/3, Technische Universität Berlin, Juli (1974)
15. Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254-265 (1987)
16. Teytaud, F.: A new selection ratio for large population sizes. In: Applications of Evolutionary Computation, pp. 452-460 (2010)