An Improved Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime
Iterated local search (ILS) algorithm is a powerful metaheuristic for the permutation flowshop problem with total flowtime objective. ILS is based on a local search procedure and the procedure needs to be restarted from another solution when the procedure is trapped into a local optima. In the literature, the solution is often generated by slightly perturbing the best solution found so far. By doing so, the search space is relatively narrow and it is easy to lead the search stagnant. In order to improve this situation, a strategy is proposed in this paper to allow the restart solution be generated from a group of solutions, which are drawn from the local optima solutions found in the search process. An ILS algorithm named MRSILS is proposed. Its performance is evaluated on a set of benchmarks. Comparisons show that the MRSILS is significantly better than or comparable to several state-of-the-art metaheuristics.
KeywordsScheduling Permutation flowshop Total flowtime Metaheuristic Iterated local search
Unable to display preview. Download preview PDF.
- 15.Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall (2001)Google Scholar