scholarly journals A Branch-and-Bound-based solution method for solving vehicle routing problem with fuzzy stochastic demands

Sadhana ◽  
2021 ◽  
Vol 46 (4) ◽  
Author(s):  
V P Singh ◽  
Kirti Sharma ◽  
Debjani Chakraborty
Keyword(s):  
Vehicle Routing ◽  
Branch And Bound ◽  
Vehicle Routing Problem ◽  
Solution Method ◽  
Routing Problem ◽  
Stochastic Demands

Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands

2014 ◽  
Vol 50 ◽  
pp. 1-13 ◽  
Author(s):  
Lin Zhu ◽  
Louis-Martin Rousseau ◽  
Walter Rei ◽  
Bo Li
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands

Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

2014 ◽  
Vol 61 (2) ◽  
pp. 463-487 ◽  
Author(s):  
Prasanna Balaprakash ◽  
Mauro Birattari ◽  
Thomas Stützle ◽  
Marco Dorigo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Single Vehicle

Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

2004 ◽  
pp. 450-460 ◽  
Author(s):  
Leonora Bianchi ◽  
Mauro Birattari ◽  
Marco Chiarandini ◽  
Max Manfrin ◽  
Monaldo Mastrolilli ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands

scholarly journals A Heuristic Solution Method for Multi-Depot Vehicle Routing-Based Waste Collection Problems

2020 ◽  
Vol 10 (7) ◽  
pp. 2403
Author(s):  
Yanjun Shi ◽  
Lingling Lv ◽  
Fanyi Hu ◽  
Qiaomei Han
Keyword(s):  
Vehicle Routing ◽  
Waste Disposal ◽  
Vehicle Routing Problem ◽  
Solution Method ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Waste Collection ◽  
Heuristic Solution ◽  
Routing Problem ◽  
Combination Optimization

This paper addresses waste collection problems in which urban household and solid waste are brought from waste collection points to waste disposal plants. The collection of waste from the collection points herein is modeled as a multi-depot vehicle routing problem (MDVRP), aiming at minimizing the total transportation distance. In this study, we propose a heuristic solution method to address this problem. In this method, we firstly assign waste collection points to waste disposal plants according to the nearest distance, then each plant solves the single-vehicle routing problem (VRP) respectively, assigning customers to vehicles and planning the order in which customers are visited by vehicles. In the latter step, we propose the sector combination optimization (SCO) algorithm to generate multiple initial solutions, and then these initial solutions are improved using the merge-head and drop-tail (MHDT) strategy. After a certain number of iterations, the optimal solution in the last generation is reported. Computational experiments on benchmark instances showed that the initial solutions obtained by the sector combination optimization algorithm were more abundant and better than other iterative algorithms using only one solution for initialization, and the solutions with distance gap were obtained using the merge-head and drop-tail strategy in a lower CPU time compared to the Tabu search algorithm.

Sign in / Sign up

Export Citation Format

Share Document