A simple and effective hybrid genetic search for the job sequencing and tool switching problem

•A hybrid genetic algorithm with diversity management is proposed.•We introduce a secondary objective for breaking ties in local search.•Extensive experiments are conducted and confirm the method quality performance.•A new set of large sized instances is proposed to encourage future research. The jo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 127; S. 105153
Hauptverfasser: Mecler, Jordana, Subramanian, Anand, Vidal, Thibaut
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.03.2021
Pergamon Press Inc
Schlagworte:
Algorithms
Combinatorial optimization
Hybrid genetic search
Job sequencing
Job shops
Metaheuristics
Operations research
Searching
Switches
Switching
Tool switches
Hybrid genetic search
Tool switches
Job sequencing
Combinatorial optimization
Metaheuristics
ISSN:0305-0548, 1873-765X, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A hybrid genetic algorithm with diversity management is proposed.•We introduce a secondary objective for breaking ties in local search.•Extensive experiments are conducted and confirm the method quality performance.•A new set of large sized instances is proposed to encourage future research. The job Sequencing and tool Switching Problem (SSP) has been extensively studied in the field of operations research, due to its practical relevance and methodological interest. Given a machine that can load a limited amount of tools simultaneously and a number of jobs that require a subset of the available tools, the SSP seeks a job sequence that minimizes the number of tool switches in the machine. To solve this problem, we propose a simple and efficient hybrid genetic search based on a generic solution representation, a tailored decoding operator, efficient local searches and diversity management techniques. To guide the search, we introduce a secondary objective designed to break ties. These techniques allow to explore structurally different solutions and escape local optima. As shown in our computational experiments on classical benchmark instances, our algorithm significantly outperforms all previous approaches while remaining simple to apprehend and easy to implement. We finally report results on a new set of larger instances to stimulate future research and comparative analyses.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2020.105153