scholarly journals A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem

2021 ◽  
Author(s):  
Vinícius R. Máximo ◽  
Mariá C.V. Nascimento
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Iterated Local Search ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints

Networks ◽  
2017 ◽  
Vol 69 (3) ◽  
pp. 304-316 ◽  
Author(s):  
Hanne Pollaris ◽  
Kris Braekers ◽  
An Caris ◽  
Gerrit K. Janssens ◽  
Sabine Limbourg
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Iterated Local Search ◽  
Routing Problem ◽  
Pallet Loading ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

scholarly journals Stochastic multi-depot capacitated vehicle routing problem with pickup and delivery: heuristic approaches

2021 ◽  
Author(s):  
Brenner H. O. Rios ◽  
Eduardo C. Xavier ◽  
Flávio K. Miyazawa ◽  
Pedro Amorim
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Iterated Local Search ◽  
Neighborhood Search ◽  
Pickup And Delivery ◽  
Data Set ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Expected Length ◽  
Capacitated Vehicle

We present a natural probabilistic variation of the multi-depot vehicle routing problem with pickup and delivery. We denote this variation by Stochastic multi-depot capacitated vehicle routing problem with pickup and delivery (SMCVRPPD). We present an algorithm to compute the expected length of an apriori route under general probabilistic assumptions. To solve the SMCVRPPD we propose an Iterated Local Search (ILS) and a Variable Neighborhood Search(VNS). We evaluate the performance of these heuristics on a data set adapted from TSPLIB instances. The results show that the ILS is effective to solve SMCVRPPD.

Sign in / Sign up

Export Citation Format

Share Document