Solving Multi-objective Optimization Problems Via Selective Inheritance Meta-Reinforcement Learning
An increasing number of machine learning algorithms are being applied to multi-objective optimization problems (MOPs), yielding promising results. However, many of these algorithms suffer from inefficient and low-quality task sampling methods, which degrade the quality of the Pareto Front (PF) calculated by the meta-model after several iterations. Our proposed algorithm integrates meta-learning techniques into the deep reinforcement learning (DRL) framework. To generate a high-quality and stable training dataset, we incorporate the concept of optimal genetic inheritance into the training process of the meta-model. The process involves: (1) saving the training data in a specified data structure; (2) selecting high-performance data based on loss values and storing them in a structure indexed by iteration number; (3) updating the data structure with each iteration; and (4) generating the training dataset based on iteration counts. Our algorithm demonstrates higher stability and better performance in computational experiments, effectively addressing multi-objective traveling salesman problems (MOTSP) and multi-objective vehicle routing problems with time windows (MOVRPTW).
Authors
- Fangzhen Ge (ORCID: https://orcid.org/0000-0002-1821-0204)
- Huaiyu Liu (ORCID: https://orcid.org/0000-0002-5753-333X)
- Longfeng Shen (ORCID: https://orcid.org/0000-0003-1184-8552)
- Debao Chen (ORCID: https://orcid.org/0000-0002-0179-387X)
- Mingshi Wang (ORCID: https://orcid.org/0000-0002-0860-6715)
Institutions
- Huaibei Normal University (CN)
Publication Details
- Published
- 2024-12-06
- DOI
- https://doi.org/10.1109/icraic65937.2024.00108
- Primary Topic
- Advanced Multi-Objective Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- University Natural Science Research Project of Anhui Province