A case study of heterogeneous fleet vehicle routing problem: Touristic distribution application in Alanya

Abstract

In this study, Fleet Size and Mix Vehicle Routing Problem is considered in order to optimize the distribution of the tourists who have traveled between the airport and the hotels in the shortest distance by using the minimum cost. The initial solution space for the related methods are formed as a combination of Savings algorithm, Sweep algorithm and random permutation alignment. Then, two well-known solution methods named as Standard Genetic Algorithms and random search algorithms are used for changing the initial solutions. Computational power of the machine and heuristic algorithms are used instead of human experience and human intuition in order to solve the distribution problem of tourists coming to hotels in Alanya region from Antalya airport. For this case study, daily data of tourist distributions performed by an agency operating in Alanya region are considered. These distributions are then modeled as Vehicle Routing Problem to calculate the solutions for various applications. From the comparisons with the decision of a human expert, it is seen that the proposed methods produce better solutions with respect to human experience and insight. Random search method produces a solution more favorable in terms of time. As a conclusion, it is seen that, owing to the distribution plans offered by the obtained solutions, the agencies may reduce the costs by achieving savings up to 35%.

A rich vehicle routing problem arising in the replenishment of automated teller machines

“…Constraints (3) and (4) ensure that each customer is visited exactly once. Constraints (5) impose that a vehicle cannot start route r + 1 before finish route r. Constraints (6) and 7define the flows. Constraints (8) ensure that the total travel time cannot exceed the maximum allowed working duration.…”

“…Karaoglan et al [5] studied aircraft routing and scheduling for cargo transportation in an airline company in Turkey. Karagul and Gungor [6] studied the mixed fleet VRP to optimize the distribution of the tourists who have traveled between the airport and the hotels in Turkey. The authors developed a Savings algorithm, a Sweep algorithm and a random permutation alignment.…”

Solution of green simultaneous pickup and delivery vehicle routing problem with time window using metaheuristic methods

“…Bu fonksiyon sayesinde malzeme ve ürünler ilk çıkış noktasından ihtiyaç duyulduğu nihai tüketim noktasına taşınırlar [8]. Üretim ve dağıtımdaki ürünlerin ağırlık ve hacim olarak büyümesi lojistik operasyonlarına ilişkin alanlarda optimizasyon çalışmalarını çok daha önemli hale getirmiştir [9]. Müşteri siparişlerinin gönderilebilmesi için en iyi rotalar kümesini elde etmeyi amaçlayan Araç Rotalama Problemleri (ARP) [10], lojistikte en çok çalışılan optimizasyon problemlerinden birisidir.…”

Comparison of Different Clustering Algorithms via Genetic Algorithm for VRPTW

“…It aims to increase the probability of getting the best solution of an optimization problem and to decrease the time of searching. In the literature of the VRP and VRPTW, there are plenty of studies that applied GA incorporated with other heuristics [1][2][3][4][5][6][7].…”