Adaptive Multi-Objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem

Abstract : Automatic algorithm configuration (AAC) is an increasingly critical factor in the design of efficient metaheuristics. AAC was previously successfully applied to multi-objective local search (MOLS) algorithms using offline tools. However, offline approaches are usually very expensive, draw general recommendations regarding algorithm design for a given set of instances, and does generally not allow per-instance adaptation. Online techniques for automatic algorithm control are usually applied to single-objective evolutionary algorithms. In this work we investigate the impact of including control mechanisms to MOLS algorithms on a classical bi-objective permutation flowshop scheduling problem (PFSP), and demonstrate how even simple control mechanisms can complement traditional offline configuration techniques.
Document type :
Conference papers
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01868401
Contributor : Aymeric Blot <>
Submitted on : Wednesday, September 5, 2018 - 2:14:07 PM
Last modification on : Saturday, March 23, 2019 - 1:26:11 AM
Long-term archiving on: Thursday, December 6, 2018 - 2:53:56 PM

File

lion_2018_preprint.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01868401, version 1

Collections

Citation

Aymeric Blot, Marie-Éléonore Kessaci, Laetitia Jourdan, Patrick de Causmaecker. Adaptive Multi-Objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem. Learning and Intelligent Optimization Conference (LION 12), Jun 2018, Kalamata, Greece. ⟨hal-01868401⟩

Share

Metrics

Record views

72

Files downloads

158