Multi-Objective Heterogeneous Green Vehicle Routing Problem with Customer Service Constraints

Green Vehicle Routing Problem (GVRP) is a hot topic in the field of combinatorial optimization. In this paper, Multi-Objective Heterogeneous Green Vehicle Routing Problem with Customer Service Constraints (MOHGVRP-CSC) is proposed for the first time, and an integer planning model is established with three objectives to minimize the total traveling costs of vehicles, Carbon Emission cost and Customer Satisfaction cost. Then, a Hybrid Variable Neighborhood Search (HVNS) with hierarchical clustering and Brain Storm Optimization (BSO) is proposed. At the initial stage of the algorithm, the initial solution is constructed by hierarchical clustering algorithm and greedy algorithm. In addition, BSO is introduced into the global search of VNS to obtain a wider range of neighborhood searches. At the same time, 2-opt method is adopted in the local search to further improve the solution quality. Finally, the effectiveness of the proposed algorithm is verified by a large number of experimental simulations.

Paper

Full text

PDF

Multi-Objective Heterogeneous Green Vehicle Routing Problem with Customer Service Constraints

Semantic Scholar · Environmental Science · 2023

Abstract

Green Vehicle Routing Problem (GVRP) is a hot topic in the field of combinatorial optimization. In this paper, Multi-Objective Heterogeneous Green Vehicle Routing Problem with Customer Service Constraints (MOHGVRP-CSC) is proposed for the first time, and an integer planning model is established with three objectives to minimize the total traveling costs of vehicles, Carbon Emission cost and Customer Satisfaction cost. Then, a Hybrid Variable Neighborhood Search (HVNS) with hierarchical clustering and Brain Storm Optimization (BSO) is proposed. At the initial stage of the algorithm, the initial solution is constructed by hierarchical clustering algorithm and greedy algorithm. In addition, BSO is introduced into the global search of VNS to obtain a wider range of neighborhood searches. At the same time, 2-opt method is adopted in the local search to further improve the solution quality. Finally, the effectiveness of the proposed algorithm is verified by a large number of experimental simulations.

Similar papers

© 2026 NYSGPT2525 LLC