On the Neutrality of Flowshop Scheduling Fitness Landscapes

Marmion, Marie-Eleonore; Dhaenens, Clarisse; Jourdan, Laëtitia; Liefooghe, Arnaud; Vérel, Sebástien

doi:10.1007/978-3-642-25566-3_18

Cited by 27 publications

(26 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When this number is high, the landscape can be thought of as composed of several sub-graphs of configurations with the same fitness value. This is the case for the fitness landscape of PFSP [14].…”

Section: Local Optima Networkmentioning

confidence: 92%

Local Optima Networks of the Permutation Flow-Shop Problem

Daolio

Vérel

Ochoa

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This article extracts and analyzes local optima networks for the permutation flow-shop problem. Two widely used move operators for permutation representations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima network features and the performance of an iterated local search heuristic. Our analysis reveals that network features can explain and predict problem difficulty. The evidence confirms the superiority of the insertion operator for this problem.

show abstract

Section: Local Optima Networkmentioning

confidence: 92%

Local Optima Networks of the Permutation Flow-Shop Problem

Daolio

Vérel

Ochoa

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, Watson et al (2005) study the search space topology linked to taboo search algorithms for the job shop problem. Marmion et al (2011b) study the concept of neutrality of the flowshop fitness landscape. This is the property that the flowshop has when different permutations result in the same makespan value.…”

Section: Flowshop Scheduling Problem and The Hardness Of The Instancesmentioning

confidence: 99%

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada

Ruíz

Framiñán

2015

European Journal of Operational Research

155

View full text Add to dashboard Cite

In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the work is to generate a benchmark which satisfies the desired characteristics of any benchmark: comprehensive, amenable for statistical analysis and discriminant when several algorithms are compared. An exhaustive experimental procedure is carried out in order to select the hard instances, generating thousands of instances and selecting the hardest ones from the point of view of a gap computed as the difference between very good upper and lower bounds for each instance. Extensive generation and computational experiments, which have taken almost six years of combined CPU time, demonstrate that the proposed benchmark is harder and with more discriminant power than the most common benchmark from the literature. Moreover, a website is developed for researchers in order to share sets of instances, best known solutions and lower bounds, etc. for any combinatorial optimisation problem.

show abstract

“…Global optima are defined as being the absolute maxima (or minima) in the whole of S. Other features of a landscape such as basins, barriers, or neutrality can be defined likewise (Stadler, 2002). Neutrality is a particularly important notion in real-world problems such as flow-shop scheduling problem (Marmion et al, 2011b), minimum linear arrangement (Rodriguez-Tello et al, 2008), etc.…”

Section: Definitionmentioning

confidence: 99%

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

et al. 2013

View full text Add to dashboard Cite

Abstract:This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A substantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented. Based on a fine-grained decomposition, a conceptual model is proposed and is validated by regarding a number of state-of-the-art methodologies as simple variants of the same structure. This model is then incorporated into the ParadisEO-MO software framework. This framework has proven its efficiency and high flexibility by enabling the resolution of many academic and real-world optimization problems from science and industry.

show abstract

On the Neutrality of Flowshop Scheduling Fitness Landscapes

Cited by 27 publications

References 16 publications

Local Optima Networks of the Permutation Flow-Shop Problem

Local Optima Networks of the Permutation Flow-Shop Problem

New hard benchmark for flowshop scheduling problems minimising makespan

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Contact Info

Product

Resources

About