Abstract

Vehicle Routing Problem (VRP) is a famous combinatorial optimization problem and it has been extended to a multi-objective optimization perspective. This paper targets solving VRP with stochastic demand (VRPSD) under the constraints of available time window and vehicle capacity. The objective of the problem is to simultaneously minimize total travelling distance and total drivers' remuneration. This paper proposes a decomposition-based multi-objective evolutionary algorithm to tackle VRPSD. The proposed algorithm utilizes multi-mode mutation combined with decomposition-based selection method to enhance optimization performance of the algorithm. The simulation results show that the proposed MOEA has better performance than domination-based MOEA in terms of diversity maintenance.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.