Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems

About

Deep reinforcement learning (DRL) has recently shown its success in tackling complex combinatorial optimization problems. When these problems are extended to multiobjective ones, it becomes difficult for the existing DRL approaches to flexibly and efficiently deal with multiple subproblems determined by weight decomposition of objectives. This paper proposes a concise meta-learning-based DRL approach. It first trains a meta-model by meta-learning. The meta-model is fine-tuned with a few update steps to derive submodels for the corresponding subproblems. The Pareto front is then built accordingly. Compared with other learning-based methods, our method can greatly shorten the training time of multiple submodels. Due to the rapid and excellent adaptability of the meta-model, more submodels can be derived so as to increase the quality and diversity of the found solutions. The computational experiments on multiobjective traveling salesman problems and multiobjective vehicle routing problem with time windows demonstrate the superiority of our method over most of learning-based and iteration-based approaches.

Zizhen Zhang, Zhiyuan Wu, Hang Zhang, Jiahai Wang• 2021

Related benchmarks

TaskDatasetResultRank
Multi-Objective Traveling Salesman ProblemBi-TSP-1 n=20
Hypervolume0.6271
15
Multi-Objective Traveling Salesman ProblemBi-TSP-1 n=50
Hypervolume (HV)0.6408
15
Bi-objective Traveling Salesman ProblemBi-TSP-1 n=150 (200 random instances)
HV0.6976
9
Bi-objective Traveling Salesman ProblemBi-TSP-1 n=200 (random instances)
Hypervolume (HV)0.7299
9
Multi-Objective Traveling Salesman ProblemKroAB100 generalization TSPLIB (test)
Hypervolume (HV)0.695
9
Multi-Objective Traveling Salesman ProblemKroAB150 generalization TSPLIB (test)
HV0.689
9
Multi-Objective Traveling Salesman ProblemKroAB200 generalization TSPLIB (test)
Hypervolume (HV)0.7261
9
Multi-Objective Traveling Salesman ProblemBi-TSP-1 n=100
HV0.7022
9
Multi-Objective Traveling Salesman ProblemTri-TSP-1 n=20
Hypervolume (HV)0.4712
9
Multi-Objective Traveling Salesman ProblemTri-TSP-1 (n=100)
Hypervolume0.4958
9
Showing 10 of 14 rows

Other info

Follow for update