Abstract
In this paper we present three path relinking approaches for solving a bi-objective permutation flowshop problem. The path relinking phase is initialized by optimizing the two objectives using Ant Colony System. The initiating and guiding solutions of path relinking are randomly selected and some of the solutions along the path are intensified using local search. The three approaches differ in their strategy of defining the heuristic bounds for the local search, i.e., each approach allows its solutions to undergo local search under different conditions. These conditions are based on local nadir points. Several test instances are used to investigate the performances of the different approaches. Computational results show that the decision which allows solutions to undergo local search has an influence in the performance of path relinking. We also demonstrate that path relinking generates competitive results compared to the best known solutions of the test instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lenstra, J.K., Kan, A.H.G.R., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)
Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is np-hard. Mathematics of operations research 15, 483–495 (1990)
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, pp. 1–75. Kluwer Academic Publishers, Dordrecht (1996)
Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population heuristic. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 429–442. Springer, Heidelberg (2001)
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), 23–50 (2001)
Haubelt, C., Gamenik, J., Teich, J.: Initial population construction for convergence improvement of moeas. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 191–205. Springer, Heidelberg (2005)
Gandibleux, X., Morita, H., Katoh, H.: Evolutionary operators based on elite solutions for bi-objective combinatorial optimization. In: Coello Coello, C., Lamont, G. (eds.) Applications of Multi-Objective Evolutionary Algorithms. Advances in Natural Computation, vol. 1, pp. 555–579. World Scientific, New Jersey (2004)
Basseur, M., Seynhaeve, F., Talbi, E.: Path relinking in pareto multi-objective genetic algorithms. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 120–134. Springer, Heidelberg (2005)
Dorigo, M., Di Caro, G: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, New York (1999)
Pasia, J., Hartl, R., Doerner, K.: Solving bi-objective flowshop problem using pareto-ant colony optimization. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 294–305. Springer, Heidelberg (2006)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Talbi, E., Rahoual, M., Mabed, M., Dhaenens, C.: A hybrid evolutionary approach for multicriteria optimization problems: Application to the flowshop. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 416–428. Springer, Heidelberg (2001)
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)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evolutionary Computation 3(4), 257–271 (1999)
Hansen, M., Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. Technical Report Technical Report IMM-REP-1998-7, Technical University of Denmark (1998)
Basseur, M., Seynhaeve, F., Talbi, E.G.: Adaptive mechanisms for multi-objective evolutionary algorithms (S3-R-00-222). In: IMACS multiconference, Computational Engineering in Systems Applications (CESA’03), Piscataway, IEEE Computer Society Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Pasia, J.M., Gandibleux, X., Doerner, K.F., Hartl, R.F. (2007). Local Search Guided by Path Relinking and Heuristic Bounds. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70927-5
Online ISBN: 978-3-540-70928-2
eBook Packages: Computer ScienceComputer Science (R0)