Abstract
The helper-objective approach for solving the job-shop scheduling problem using multi-objective evolutionary algorithms is considered.
We implemented the approach from the Lochtefeld and Ciarallo paper using NSGA-II with the correct implementation of the non-dominated sorting procedure which is able to work with equal values of objectives. The experimental evaluation showed the significant improvement of solution quality.
We also report new best results for 16 out of 24 problem instances used in the considered paper.
We implemented the approach from the Lochtefeld and Ciarallo paper using NSGA-II with the correct implementation of the non-dominated sorting procedure which is able to work with equal values of objectives. The experimental evaluation showed the significant improvement of solution quality.
We also report new best results for 16 out of 24 problem instances used in the considered paper.
Original language | English |
---|---|
Title of host publication | GECCO Comp '14 |
Subtitle of host publication | Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation |
Publisher | Association for Computing Machinery |
Pages | 1445-1446 |
Number of pages | 2 |
ISBN (Print) | 978-1-4503-2881-4 |
DOIs | |
Publication status | Published - 12 Jul 2014 |
Externally published | Yes |
Event | GECCO 2014: The Genetic and Evolutionary Computation Conference - Vancouver, Canada Duration: 12 Jul 2014 → 16 Jul 2014 |
Conference
Conference | GECCO 2014: The Genetic and Evolutionary Computation Conference |
---|---|
Country/Territory | Canada |
City | Vancouver |
Period | 12 Jul 2014 → 16 Jul 2014 |
Keywords
- auxiliary objectives
- helper-objectives
- job-shop
- nsga-ii