A rich heterogeneous fleet vehicle routing problem with flexible time windows: a case study of dairy supply chain

2018 ◽  
Vol 30 (3) ◽  
pp. 386
Author(s):  
Hadi Shirouyehzad ◽  
Javid Jouzdani ◽  
Mehdi Firouzi ◽  
Mohammad Mahdi Paydar
Keyword(s):  
Supply Chain ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
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.

Quantum Inspired Algorithm for a VRP with Heterogeneous Fleet Mixed Backhauls and Time Windows

2016 ◽  
Vol 7 (4) ◽  
pp. 18-38 ◽  
Author(s):  
Meryem Berghida ◽  
Abdelmadjid Boukra
Keyword(s):  
Population Size ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Variable Population ◽  
Variable Population Size

This paper presents a new Quantum Inspired Harmony Search algorithm with Variable Population Size QIHSVPS for a complex variant of vehicle routing problem (VRP), called HVRPMBTW (Vehicle Routing Problem with Heterogeneous fleet, Mixed Backhauls and Time Windows). This variant is characterized by a limited number of vehicles with various capacities and costs. The vehicles serve two types of customers: linehauls customers and backhauls customers. Each customer must be visited in a specific interval of time. The authors propose to use quantum principles to accelerate evolution process and variable population size to decrease the number of solution's evaluation, when the improvement is insignificant. This new approach was tested on benchmarks and produces satisfactory results compared to other approaches.

Sign in / Sign up

Export Citation Format

Share Document