Abstract
Iterative Flattening Search (IFS) [1] is an iterative improvement heuristic schema for makespan minimization in scheduling problems. Given an initial solution, IFS iteratively interleaves a relaxation-step, which randomly retracts some search decisions, and an incremental solving step (or flattening-step) to recompute a new solution. The process continues until a stop condition is met and the best solution found is returned. In two subsequent works the performance of the original IFS procedure has been improved through refinements of the basic search schema. [2] proposes a simple and effective extension of IFS, which iterates the relaxation step multiple times. The resulting algorithm found many new upper bounds for the reference benchmark of Multi Capacity Job Shop Scheduling (mcjssp) problems and produced solutions within 1% of the best upper bounds on average. Additional optimal solutions and improvements were obtained in [3]: this approach follows the IFS schema using different engines for the flattening and relaxation steps. In this paper we combine basic ‘component’ strategies to obtain hybrid variants (until now, no attempt has been made in this direction) and perform a detailed experimental evaluation of their performance. Specifically, we examine the utility of: (1) operating with different relaxation strategies; (2) using different searching strategies to built a new solution. We present a two-step experimental evaluation: (a) an extensive explorative evaluation with a spectrum of parameter combination; (b) a time-intensive evaluation of the best IFS combinations emerged from the previous. The experimental results shed light on weaknesses and strengths of the different variants improving the current understanding of this family of meta-heuristics.
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
Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: AAAI/IAAI. 17th National Conference on Artificial Intelligence, pp. 742–747 (2000)
Michel, L., Van Hentenryck, P.: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In: ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning & Scheduling, pp. 200–208 (2004)
Godard, D., Laborie, P., Nuitjen, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: ICAPS-2005. Proceedings of the 15th International Conference on Automated Planning & Scheduling, pp. 81–89 (2005)
Oddi, A., Cesta, A., Policella, N., Smith, S.: Iterative Improvement Strategies for Multi-Capacity Scheduling Problems. In: COPLAS 2007. Proceedings of CP/ICAPS Joint Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oddi, A., Cesta, A., Policella, N., Smith, S.F. (2008). Hybrid Variants for Iterative Flattening Search. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-68155-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68154-0
Online ISBN: 978-3-540-68155-7
eBook Packages: Computer ScienceComputer Science (R0)