A development framework for rapid meta-heuristics hybridization

Proceedings - International Computer Software and Applications Conference

Volumn 1, Issue , 2004, Pages 362-367

  Lau, Hoong Chuin ^a   Wan, Wee Chong ^a   Lim, Min Kwang ^a   Halim, Steven ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); META-HEURISTICS; RAPID META-HEURISTICS HYDRIDIZATION; TABU SEARCH (TS);

COMBINATORIAL MATHEMATICS; COMPUTER SOFTWARE REUSABILITY; GENETIC ALGORITHMS; HEURISTIC METHODS; INTERFACES (COMPUTER); JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

SOFTWARE ENGINEERING;

EID: 18744396368     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Ahuja, R. K., Jha K. C., Orlin J. B. and Sharma D., Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem, MIT Sloan School of Management Working Paper, 2003.
2. Battiti, R. and Tecchiolli, G. 1994. The reactive tabu search. ORSA Journal on Computing, 6:2, 126-140.
3. Bent, R. and Van Hentenryck, P. 2001. A two stage hybrid local search for the vehicle routing problem with time windows, Technical Report, CS-01-06, Dept. of Computer Science, Brown University.
4. Blum, C. and Roli, A. 2003. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Survey, 35:3, 268-308.
5. Dorigo, M. and Di Caro, G. 1999. The Ant Colony Optimization Meta-Heuristic. Readings, New Ideas in Optimization: McGraw-Hill, 11-32.
6. Fink, A. and Voß, S. 2002. HotFrame: A Heuristic Optimization Framework. Readings, In Optimization Software Class Libraries: Kluwer, Boston, 81-154.
7. Di Gaspero, L. and Schaerf, A. 2001. EASYLOCAL++: an object-oriented framework for the flexible design of local search algorithms and metaheuristics. In Proceedings of the 4th Metaheuristics International Conference.
8. Glover, F. and Laguna, M. 1997. Tabu Search. Readings, Tabu Search: Kluwer Academic Publishers.
9. Harder, R. 2001. IBM OpenTS website: http://opents.iharder.net
10. Joslin, D. E. and Clements, D. P. 1999. Squeaky wheel optimization. In Proceedings of the 15th American Association for Artificial Intelligence.
11. Lau, H. C., Wan, W. C, and Jia, X. 2003. Generic Object-Oriented Tabu Search Framework. In Proceedings of the 5th Metaheuristics International Conference.
12. Lau, H. C, Lim, M. K, Wan, W. C, Wang, H and Wu, X. 2003. Solving Multi-Objective Multi-Constrained Optimization Problems using Hybrid Ants System and Tabu Search. In Proceedings of the 5th Metaheuristics International Conference.
13. Li, H. and Lim, A. 2001. A Metaheuristic for the Pickup and Delivery Problem with Time Windows. In Proceedings of International Conference on Tools with Artificial Intelligence.
14. Michel, L. and Van Hentenryck, P. 2001. Localizer++: An Open Library for Local Search, Technical Report, CS-01-03, Brown University
15. Parsopoulos, K. E. and Vrahatis, M. N. 2002. Particle Swarm Optimization Method for Constrained Optimization Problems. Readings, Intelligent Technologies - Theory and Applications: New Trends in Intelligent Technologies: IOS Press, 214-220.
16. Reinelt, G. 1991. TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376-384
17. Rochat, Y. and Taillard, E. 1995. Probabilistic Diversification And Intensification In Local Search For Vehicle Routing. Journal of Heuristics, 1, 147-167.
18. Stützte, T. and Dorigo, M. 1999. AGO Algorithms for the Traveling Salesman Problem. Readings, Evolutionary Algorithms in Engineering and Computer Science, Wiley.
19. Taillard, E. 1991. Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing, 17, 443-455.