Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows
暂无分享,去创建一个
Andreas T. Ernst | Manuel López-Ibáñez | Christian Blum | Bernd Meyer | Dhananjay R. Thiruvady | C. Blum | B. Meyer | D. Thiruvady | Manuel López-Ibáñez
[1] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[2] P. Ow,et al. Filtered beam search in scheduling , 1988 .
[3] Chi-Bin Cheng,et al. A modified ant colony system for solving the travelling salesman problem with time windows , 2007, Math. Comput. Model..
[4] Manuel López-Ibáñez,et al. Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows , 2009, LION.
[5] Riccardo Poli,et al. New ideas in optimization , 1999 .
[6] Wheeler Ruml,et al. Incomplete Tree Search using Adaptive Probing , 2001, IJCAI.
[7] Barrett W. Thomas,et al. A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..
[8] Thomas Stützle,et al. Ant Colony Optimization Theory , 2004 .
[9] Jordan B. Pollack,et al. A Sampling-Based Heuristic for Tree Search Applied to Grammar Induction , 1998, AAAI/IAAI.
[10] Christian Blum,et al. Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..
[11] Luca Maria Gambardella,et al. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .
[12] Marco Dorigo,et al. The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[13] Thomas Stützle,et al. Ant Colony Optimization , 2009, EMO.
[14] Christian Blum,et al. Beam-ACO for Simple Assembly Line Balancing , 2008, INFORMS J. Comput..
[15] Samy Bengio,et al. The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..