A variable neighborhood search algorithm for the capacitated vehicle routing problem

2017 ◽  
Vol 58 ◽  
pp. 231-238 ◽  
Author(s):  
Marwa Amous ◽  
Said Toumi ◽  
Bassem Jarboui ◽  
Mansour Eddaly
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Neighborhood Search Algorithm ◽  
Capacitated Vehicle

scholarly journals A Variable Neighborhood Search Algorithm with Constraint Relaxation for the Two-Echelon Vehicle Routing Problem with Simultaneous Delivery and Pickup Demands

2021 ◽  
Author(s):  
Ran Liu ◽  
Shan JIANG
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Computational Time ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Special Vehicle ◽  
Neighborhood Search Algorithm ◽  
Simultaneous Delivery

Abstract This paper considers a special vehicle routing problem, the two-echelon vehicle routing problem with simultaneous delivery and pickup demands (2E-VRPSDP). The 2E-VRPSDP differs from classic transportation and vehicle routing problems in two ways. First, freight delivery from the depot to the customers is managed by shipping the freight through intermediate satellites. Second, each customer in the 2E-VRPSDP may have simultaneous delivery and pickup demands. The 2E-VRPSDP is an extension of the two-echelon vehicle routing problem (2E-VRP) and the vehicle routing problem with simultaneous delivery and pickup (VRPSDP). A variable neighborhood search algorithm is designed to solve the 2E-VRPSDP in which both feasible and infeasible solutions can be explored. Numerical results show that the proposed algorithm is effective and that the algorithm can provide reasonable solutions within an acceptable computational time.

Sign in / Sign up

Export Citation Format

Share Document