An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows
•A multi-objective optimization model for DVRPTW is proposed.•A new DMOEA using ensemble learning is proposed.•A population-based prediction strategy is used to guarantee feasible solutions.•Compared with four other algorithms, EL-DMOEA is effective and promising. The Vehicle Routing Problem (VRP) i...
Saved in:
| Published in: | Computers & industrial engineering Vol. 154; p. 107131 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.04.2021
|
| Subjects: | |
| ISSN: | 0360-8352, 1879-0550 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | •A multi-objective optimization model for DVRPTW is proposed.•A new DMOEA using ensemble learning is proposed.•A population-based prediction strategy is used to guarantee feasible solutions.•Compared with four other algorithms, EL-DMOEA is effective and promising.
The Vehicle Routing Problem (VRP) is a typical combinatorial optimization problem and has been studied for many years. However, there are few researches on the Dynamic Vehicle Routing Problem with Time Window (DVRPTW), which is an extension of VRP and more challenging with changing environmental factors, such as stochastic customer requests. Once changes happen, the routes should be adjusted for the new environments. In this paper, we construct a multi-objective optimization model for the DVRPTW and propose a new algorithm named as EL-DMOEA, where an ensemble learning method is investigated to improve the performance of the algorithm. In EL-DMOEA, to enhance the population’s diversity and accelerate the convergence, three different strategies, i.e., population-based prediction strategy, immigrant strategy and random strategy, are employed in the training process of three kinds of basic models respectively. The experimental results on the test benchmarks reveal that the proposed algorithm is effective to make promising routing plans. |
|---|---|
| ISSN: | 0360-8352 1879-0550 |
| DOI: | 10.1016/j.cie.2021.107131 |