A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows

2021 ◽  
Vol 13 (1/2) ◽  
pp. 185
Author(s):  
Jose Bernal ◽  
John Willmer Escobar ◽  
Rodrigo Linfati
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Real Case ◽  
Routing Problem ◽  
Heterogeneous Fleet

scholarly journals A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

2017 ◽  
Vol 10 (4) ◽  
pp. 646 ◽  
Author(s):  
Jose Bernal ◽  
John Willmer Escobar ◽  
Rodrigo Linfati
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Computational Experiments ◽  
Real Case ◽  
Second Phase ◽  
Routing Problem ◽  
Heterogeneous Fleet

Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes.Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement.Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes.Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

Vehicle Routing Problem with Multi Depot, Heterogeneous Fleet, and Multi Period: A Real Case Study

2021 ◽  
pp. 826-836
Author(s):  
Barış Karadeniz ◽  
Mehmet Serdar Erdogan ◽  
Yiğit Kazançoğlu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Real Case ◽  
Routing Problem ◽  
Heterogeneous Fleet

A bi-objective vehicle routing problem with time windows: A real case in Tenerife

2014 ◽  
Vol 17 ◽  
pp. 140-152 ◽  
Author(s):  
Belén Melián-Batista ◽  
Alondra De Santiago ◽  
Francisco AngelBello ◽  
Ada Alvarez
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Real Case ◽  
Routing Problem
Sign in / Sign up

Export Citation Format

Share Document