Local search guided by path relinking and heuristic bounds

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

Volumn 4403 LNCS, Issue , 2007, Pages 501-515

  Pasia, Joseph M ^a,c   Gandibleux, Xavier ^b   Doerner, Karl F ^c   Hartl, Richard F ^c  

^a Institute of Mathematics and Natural Sciences Research Institute   (Philippines)

^b UNIVERSITÉ DE NANTES   (France)

^c UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING;

ANT COLONY SYSTEM; FLOWSHOP PROBLEMS; HEURISTIC BOUNDS; PATH RELINKING;

PROBLEM SOLVING;

EID: 37249091234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70928-2_39     Document Type: Conference Paper

References (16)

1. Lenstra, J., Kan, A., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
2. Du, J., Leung, J.: Minimizing total tardiness on one machine is np-hard. Mathematics of operations research 15 (1990) 483-495
3. Glover, F.: Tabu search and adaptive memory programming advances, applications and challenges. In Barr, R., Helgason, R., Kennington, J., eds.: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers (1996) 1-75
4. Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population heuristic. In: Evolutionary Multi-criterion Optimization, EMO'2001. Volume 1993 of Lecture Notes in Computer Science., Zurich, Switzerland (2001) 429-442
5. Morita, H., Gandibleux, X., Katoh, N.: Experimental feedback on biobjective permutation scheduling problems solved with a population heuristic. Foundations of Computing and Decision Sciences 26(1) (2001) 23-50
6. Haubelt, C., Gamenik, J., Teich, J.: Initial population construction for convergence improvement of moeas. In Coello, C., Aguirre, A., Zitzler, E., eds.: Evolutionary Multi-criterion Optimization, EMO'2005. Volume 3410 of Lecture Notes in Computer Science. (2005) 191-205
7. Gandibleux, X., Morita, H., Katoh, H.: Evolutionary operators based on elite solutions for bi-objective combinatorial optimization. In Coello, C.C., Lamont, G., eds.: Applications of Multi-Objective Evolutionary Algorithms. Volume 1 of Advances in Natural Computation. World Scientific (2004) 555-579
8. Basseur, M., Seynhaeve, F., Talbi, E.: Path relinking in pareto multi-objective genetic algorithms. In Coello, C., Aguirre, A., Zitzler, E., eds.: Evolutionary Multicriterion Optimization, EMO'2005. Volume 3410 of Lecture Notes in Computer Science. (2005) 120-134
9. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization. McGraw-Hill, New York (1999) 11-32
10. Pasia, J., Hartl, R., Doerner, K.: Solving bi-objective flowshop problem using pareto-ant colony optimization. In Dorigo, M., et al., eds.: Proceedings of the 5th International Workshop, ANTS 2006. Volume 4150 of Lecture Notes in Computer Science., Brussels, Belgium (2006) 294-305
11. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
12. Talbi, E., Rahoual, M., Mabed, M., Dhaenens, C.: A hybrid evolutionary approach for multicriteria optimization problems: Application to the flowshop. In Zitzler, E., et al., eds.: Evolutionary Multi-criterion Optimization. Volume 1993 of Lecture Notes in Computer Science. (2001) 416-428
13. Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. Technical Report TIK-Report No. 214, Computer Engineering and Networks Laboratory, ETH Zurich, Gloriastrasse 35, ETH-Zentum, 8092 Zurich, Switzerland (2006)
14. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evolutionary Computation 3(4) (1999) 257-271
15. Hansen, M., Jaszkiewicz, A.: Evaluating the quality of approximations to the nondominated set. Technical Report Technical Report IMM-REP-1998-7, Technical University of Denmark (1998)
16. Basseur, M., Seynhaeve, F., Talbi, E.: Adaptive mechanisms for multi-objective evolutionary algorithms. In: IMACS multiconference, Computational Engineering in Systems Applications (CESA'03), Piscataway, IEEE Service Center (2003) S3-R-00-222.