Hybrid Approaches to Vehicle Routing Problem in Daily Newspaper Distribution Planning: A Real Case Study

2021 ◽  
pp. 489-499
Author(s):  
Gizem Deniz Cömert ◽  
Uğur Yıldız ◽  
Tuncay Özcan ◽  
Hatice Camgöz Akdağ
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Real Case ◽  
Daily Newspaper ◽  
Routing Problem ◽  
Distribution Planning ◽  
Hybrid Approaches ◽  
Newspaper Distribution

scholarly journals PENENTUAN RUTE KENDARAAN MENGGUNAKAN METODE CLARK AND WRIGHT SAVING HEURISTIC (STUDI KASUS : PT. SINAR SOSRO)

2017 ◽  
Vol 16 (2) ◽  
Author(s):  
Mariana Sianipar ◽  
David Fu’ani ◽  
Wahyudi Sutopo ◽  
Muhammad Hisjam
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Heuristic Method ◽  
Cost Savings ◽  
Real Case ◽  
Routing Problem ◽  
Shortest Route ◽  
Optimum Route ◽  
Open Vehicle Routing

<em>Distribution and transportation are very vital for the company business beverages that must distribute its products to many areas of the consumer, for example is a bottled tea company.  A good distribution plan and an optimum route would decrease cost and time for distributing the products.  In a real case study for a bottled tea in Surakarta area, the fluctuating demand of consumers cannot be ensured and these mismatches by a salesman that should be based on the distribution plan and the realization of visit (RRK) resulted in the absence schedule. Therefore, it is required an optimum route to help the salesman in doing RRK or distribution without ignoring predetermined targets. There is a settlement solution will be more orderly preparation of these are using a Clark and Wright Saving Heuristic method. The method is able to assist the performance of salesmen and cost savings in the delivery of Surakarta area. In this paper, we have presented a real cases vehicle routing based on Clark-Wright algorithm to solve the open vehicle routing problem (OVRP) of bottled tea distribution in Surakarta District. We have modified the Clark Wright algorithm with three procedures composed of Clark and Wright formula. The methods of swap, 2 OPT and 3-OPT were used to improve our best solution in shortest route and the cheapest cost of distribution.</em>

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.

scholarly journals A New Approach to the Bi-objective Green Vehicle Routing Problem: Optimization in Newspaper Distribution

Exacta ◽  
2021 ◽  
Author(s):  
Júlio César Ferreira ◽  
Maria Teresinha Arns Steiner
Keyword(s):  
Objective Function ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
New Approach ◽  
Three Stages ◽  
The Difference ◽  
Newspaper Distribution ◽  
Stage 1

The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and instances from the literature, was divided into three stages: Stage 1, data treatment; Stage 2, metaheuristic approaches (hybrid or non-hybrid), used comparatively, and, Stage 3, analysis of the results, with a comparison of the algorithms. An optimization of 19.9% was achieved for Objective Function 1 (OF1; minimization of CO2 emissions) and consequently the same percentage for the minimization of total distance, and 87.5% for Objective Function 2 (OF2; minimization of the difference in demand). Metaheuristic approaches hybrid achieved superior results for case study and instances.

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