.png){kind=icon}
.png){kind=icon}
Return
Decomposition-based multi-objective evolutionary algorithm for vehicle routing problem with stochastic demands
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1830-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Vehicle routing problem with stochastic demands (VRPSD) is a famous and challenging optimization problem which is similar to many real world problems. To resemble the real world scenario, total traveling distance, total driver remuneration, the number of vehicles used and the difference between driver remuneration are considered and formulated in the multi-objective optimization perspective. This paper aims to solve multi-objective VRPSD under the constraints of available time window and vehicle capacity using decomposition-based multi-objective evolutionary algorithm (MOEA/D) with diversity-loss-based selection method incorporates with local search and multi-mode mutation heuristics. We have also compared the optimization performance of the decomposition-based approach with the domination-based approach to study the difference between these two well-known evolutionary multi-objective algorithm frameworks. The simulation results have showed that the decomposition-based approach with diversity-loss-based selection method is able to maintain diverse output solutions.
Keywords:
Vehicle routing problem
Multi-objective optimization
Evolutionary algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.