Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows

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

Volumn 5482 LNCS, Issue , 2009, Pages 97-108

  López Ibáñez, Manuel ^a   Blum, Christian ^a   Thiruvady, Dhananjay ^b,c   Ernst, Andreas T ^c   Meyer, Bernd ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b MONASH UNIVERSITY   (Australia)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ACO ALGORITHMS; ANT-COLONY OPTIMIZATION; BEAM SEARCH; HYBRID METHOD; MAKESPAN; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; STATE-OF-THE-ART METHODS; STOCHASTIC SAMPLING; TIME WINDOWS; TRAVELLING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; WINDOWS;

PROBLEM SOLVING;

EID: 67650671003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01009-5_9     Document Type: Conference Paper

References (13)

1. Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS J. Comput. 19(1), 80-90 (2007)
2. Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research 4(1), 285-305 (1985)
3. Cheng, C.B., Mao, C.P.: A modified ant colony system for solving the travelling salesman problem with time windows. Mathematical and Computer Modelling 46, 1225-1235 (2007)
4. Gambardella, L., Taillard, E.D., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63-76. McGraw Hill, London (1999)
5. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
6. Blum, C.: Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comp. & Op. Res. 32, 1565-1591 (2005)
7. Blum, C.: Beam-ACO for simple assembly line balancing. INFORMS J. Comput. 20(4), 618-627 (2008)
8. Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 297-307 (1988)
9. López-Ibáñez, M., Blum, C.: Beam-ACO based on stochastic sampling: A case study on the TSP with time windows. In: Battiti, R., et al. (eds.) Proceedings of LION3. LNCS. Springer, Berlin (2009)
10. Juillé, H., Pollack, J.B.: A sampling-based heuristic for tree search applied to grammar induction. In: Proceedings of AAAI 1998, pp. 776-783. MIT press, Cambridge (1998)
11. Ruml,W.: Incomplete tree search using adaptive probing. In: Proceedings of IJCAI 2001, pp. 235-241. IEEE press, Los Alamitos (2001)
12. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE T. Syst. Man Cyb. - Part B 34(2), 1161-1172 (2004)
13. Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: Genetic search. INFORMS J. Comput. 8, 165-172 (1996) (Pubitemid 126681528)