MODRL/D-EL: Multiobjective Deep Reinforcement Learning with Evolutionary
Learning for Multiobjective Optimization
- URL: http://arxiv.org/abs/2107.07961v1
- Date: Fri, 16 Jul 2021 15:22:20 GMT
- Title: MODRL/D-EL: Multiobjective Deep Reinforcement Learning with Evolutionary
Learning for Multiobjective Optimization
- Authors: Yongxin Zhang, Jiahai Wang, Zizhen Zhang, Yalan Zhou
- Abstract summary: This paper proposes a multiobjective deep reinforcement learning with evolutionary learning algorithm for a typical complex problem called the multiobjective vehicle routing problem with time windows.
The experimental results on MO-VRPTW instances demonstrate the superiority of the proposed algorithm over other learning-based and iterative-based approaches.
- Score: 10.614594804236893
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Learning-based heuristics for solving combinatorial optimization problems has
recently attracted much academic attention. While most of the existing works
only consider the single objective problem with simple constraints, many
real-world problems have the multiobjective perspective and contain a rich set
of constraints. This paper proposes a multiobjective deep reinforcement
learning with evolutionary learning algorithm for a typical complex problem
called the multiobjective vehicle routing problem with time windows (MO-VRPTW).
In the proposed algorithm, the decomposition strategy is applied to generate
subproblems for a set of attention models. The comprehensive context
information is introduced to further enhance the attention models. The
evolutionary learning is also employed to fine-tune the parameters of the
models. The experimental results on MO-VRPTW instances demonstrate the
superiority of the proposed algorithm over other learning-based and
iterative-based approaches.
Related papers
- Coding for Intelligence from the Perspective of Category [66.14012258680992]
Coding targets compressing and reconstructing data, and intelligence.
Recent trends demonstrate the potential homogeneity of these two fields.
We propose a novel problem of Coding for Intelligence from the category theory view.
arXiv Detail & Related papers (2024-07-01T07:05:44Z) - Efficient Meta Neural Heuristic for Multi-Objective Combinatorial
Optimization [35.09656455088854]
We propose an efficient meta neural vector (EMNH) to solve multi-objective optimization problems.
EMNH is able to outperform the state-of-the-art neurals in terms of solution quality and learning efficiency.
arXiv Detail & Related papers (2023-10-22T08:59:02Z) - Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm.
We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
arXiv Detail & Related papers (2022-09-15T07:22:58Z) - Pareto Set Learning for Neural Multi-objective Combinatorial
Optimization [6.091096843566857]
Multiobjective optimization (MOCO) problems can be found in many real-world applications.
We develop a learning-based approach to approximate the whole Pareto set for a given MOCO problem without further search procedure.
Our proposed method significantly outperforms some other methods on the multiobjective traveling salesman problem, multiconditioned vehicle routing problem and multi knapsack problem in terms of solution quality, speed, and model efficiency.
arXiv Detail & Related papers (2022-03-29T09:26:22Z) - An Overview and Experimental Study of Learning-based Optimization
Algorithms for Vehicle Routing Problem [49.04543375851723]
Vehicle routing problem (VRP) is a typical discrete optimization problem.
Many studies consider learning-based optimization algorithms to solve VRP.
This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
arXiv Detail & Related papers (2021-07-15T02:13:03Z) - Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems.
Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC.
We provide a practical parametrization of the core optimization problem.
arXiv Detail & Related papers (2021-07-08T18:01:02Z) - Meta-Learning-based Deep Reinforcement Learning for Multiobjective
Optimization Problems [11.478548460936837]
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.
arXiv Detail & Related papers (2021-05-06T15:09:35Z) - Investigating Bi-Level Optimization for Learning and Vision from a
Unified Perspective: A Survey and Beyond [114.39616146985001]
In machine learning and computer vision fields, despite the different motivations and mechanisms, a lot of complex problems contain a series of closely related subproblms.
In this paper, we first uniformly express these complex learning and vision problems from the perspective of Bi-Level Optimization (BLO)
Then we construct a value-function-based single-level reformulation and establish a unified algorithmic framework to understand and formulate mainstream gradient-based BLO methodologies.
arXiv Detail & Related papers (2021-01-27T16:20:23Z) - Provable Multi-Objective Reinforcement Learning with Generative Models [98.19879408649848]
We study the problem of single policy MORL, which learns an optimal policy given the preference of objectives.
Existing methods require strong assumptions such as exact knowledge of the multi-objective decision process.
We propose a new algorithm called model-based envelop value (EVI) which generalizes the enveloped multi-objective $Q$-learning algorithm.
arXiv Detail & Related papers (2020-11-19T22:35:31Z) - MODRL/D-AM: Multiobjective Deep Reinforcement Learning Algorithm Using
Decomposition and Attention Model for Multiobjective Optimization [15.235261981563523]
This paper proposes a multiobjective deep reinforcement learning method to solve multiobjective optimization problem.
In our method, each subproblem is solved by an attention model, which can exploit the structure features as well as node features of input nodes.
arXiv Detail & Related papers (2020-02-13T12:59:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.