Abstract
A single-objective optimization problem can be solved more efficiently by introducing some helper-objectives and running a multi-objective evolutionary algorithm. But what objectives should be used at each optimization stage? This paper describes a new method of adaptive helper-objectives selection in multi-objective evolutionary algorithms. The proposed method is applied to the Job-Shop scheduling problem and compared with the previously known approach, which was specially developed for the Job-Shop problem. A comparison with the previously proposed method of adaptive helper-objective selection based on reinforcement learning is performed as well.
Original language | English |
---|---|
Title of host publication | ICMLA '13 |
Subtitle of host publication | Proceedings of the 2013 12th International Conference on Machine Learning and Applications |
Pages | 374-377 |
Number of pages | 4 |
Volume | 2 |
ISBN (Electronic) | 978-0-7695-5144-9 |
DOIs | |
Publication status | Published - 04 Dec 2013 |
Externally published | Yes |
Event | 2013 12th International Conference on Machine Learning and Applications - Miami, United States of America Duration: 04 Dec 2013 → 07 Dec 2013 |
Conference
Conference | 2013 12th International Conference on Machine Learning and Applications |
---|---|
Country/Territory | United States of America |
City | Miami |
Period | 04 Dec 2013 → 07 Dec 2013 |
Keywords
- job-shop problem
- helper-objectives
- multi-objective optimization
- adaptive selection