View in EDS

Adaptive constrained multi-objective differential evolution algorithm for vehicle routing problem considering crowdsourcing delivery.

Saved in:
Bibliographic Details
Title: Adaptive constrained multi-objective differential evolution algorithm for vehicle routing problem considering crowdsourcing delivery.
Authors: Hou, Ying1 (AUTHOR), Shen, Yanjie1 (AUTHOR), Han, Honggui1 (AUTHOR), Wu, Yilin1 (AUTHOR), Huang, Yanting1 (AUTHOR)
Source: Applied Soft Computing. Jan2025, Vol. 169, pN.PAG-N.PAG. 1p.
Subject Terms: Vehicle routing problem, Multi-objective optimization, Constrained optimization, Routing algorithms, Crowdsourcing, Differential evolution
Abstract: With the increase of logistics orders, the crowdsourcing delivery with part-time drivers is an effective way to solve urban logistics distribution. The crowdsourcing distribution is the vehicle routing problem containing service time windows of customers and delivery time windows of part-time drivers. However, it is challenging to obtain optimal scheduling schemes for the vehicle routing problem considering crowdsourcing (VRP-C). To address this constrained optimization problem, an adaptive constrained multi-objective differential evolution (ACMODE) algorithm is designed in this paper to minimize the travel distance and the driver payment. First, a two-stage initialization method is designed to generate solutions with fewer constraint violations by dual time windows operation. Second, a neighborhood-oriented search strategy is developed to guide searching more feasible regions and avoiding the premature convergence of solutions. Third, a fast selection mechanism based on an improved non-dominated sorting approach is proposed to achieve the tradeoff on objectives and constraints, accelerating the process of optimization. Finally, several numerical simulation experiments explain that the proposed ACMODE algorithm can obtain feasible solutions of the constrained multi-objective optimization problem effectively, and has better performance than some state-of-art algorithms in solving VRP-C. • Designing a two-stage initialization method with logistic information to generate initialized solutions with less constrained violation. • Devising a neighborhood-oriented search strategy to guide searching more feasible regions and avoiding the premature convergence of solutions. • Designing a fast selection mechanism based on an improved non-dominated sorting approach to achieve the tradeoff on objectives and constraints. [ABSTRACT FROM AUTHOR]
Database: Supplemental Index
Description
Abstract:With the increase of logistics orders, the crowdsourcing delivery with part-time drivers is an effective way to solve urban logistics distribution. The crowdsourcing distribution is the vehicle routing problem containing service time windows of customers and delivery time windows of part-time drivers. However, it is challenging to obtain optimal scheduling schemes for the vehicle routing problem considering crowdsourcing (VRP-C). To address this constrained optimization problem, an adaptive constrained multi-objective differential evolution (ACMODE) algorithm is designed in this paper to minimize the travel distance and the driver payment. First, a two-stage initialization method is designed to generate solutions with fewer constraint violations by dual time windows operation. Second, a neighborhood-oriented search strategy is developed to guide searching more feasible regions and avoiding the premature convergence of solutions. Third, a fast selection mechanism based on an improved non-dominated sorting approach is proposed to achieve the tradeoff on objectives and constraints, accelerating the process of optimization. Finally, several numerical simulation experiments explain that the proposed ACMODE algorithm can obtain feasible solutions of the constrained multi-objective optimization problem effectively, and has better performance than some state-of-art algorithms in solving VRP-C. • Designing a two-stage initialization method with logistic information to generate initialized solutions with less constrained violation. • Devising a neighborhood-oriented search strategy to guide searching more feasible regions and avoiding the premature convergence of solutions. • Designing a fast selection mechanism based on an improved non-dominated sorting approach to achieve the tradeoff on objectives and constraints. [ABSTRACT FROM AUTHOR]
ISSN:15684946
DOI:10.1016/j.asoc.2024.112517