Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

Taner, Filip; Galić, Ante; Carić, Tonči

doi:10.7307/ptt.v24i4.443

Cited by 10 publications

(8 citation statements)

References 17 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The primary objective in solving VRPTW is to find the minimal number of vehicles that can accomplish the delivery tasks in a way that each route satisfies all time and capacity constraints and each customer is served only once. The secondary objective is to minimize the overall travelled distance or time [9].…”

Section: Standard Vrp Modelsmentioning

confidence: 99%

The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer

Galić¹,

Carić²,

Fosin³

2013

PROMET

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Standard Vrp Modelsmentioning

confidence: 99%

The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer

Galić¹,

Carić²,

Fosin³

2013

PROMET

Self Cite

View full text Add to dashboard Cite

show abstract

“…To improve the performance of the ACO algorithm, they introduced a neighborhood search and a TS algorithm to maintain the diversity of the ACO algorithm and explore new solutions. Taner et al [17] developed two metaheuristic algorithms to solve the VRPTW, the SA algorithm and an iterated local search (ILS). Sripriya et al [18] designed a hybrid genetic search with diversity control using a GA to solve the VRPTW, using the Pareto approach and two mutation operators to find the optimal solution set.…”

Section: Literature Reviewmentioning

confidence: 99%

A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico

et al. 2019

View full text Add to dashboard Cite

This paper investigates a real-world distribution problem arising in the vehicle production industry, particularly in a logistics company, in which cars and vans must be loaded on auto-carriers and then delivered to dealerships. A solution to the problem involves the loading and optimal routing, without violating the capacity and time window constraints for each auto-carrier. A two-phase heuristic algorithm was implemented to solve the problem. In the first phase the heuristic builds a route with an optimal insertion procedure, and in the second phase the determination of a feasible loading. The experimental results show that the purposed algorithm can be used to tackle the transportation problem in terms of minimizing total traveling distance, loading/unloading operations and transportation costs, facilitating a decision-making process for the logistics company.

show abstract

“…A vehicle can start servicing delivery point j after it finishes the delivery of the previous vertex (i), and traverses arc (i, j). This fact is reflected by constraint set (6), where M represents a large enough number. Constraint sets (7) and (8) together impose compartment and total capacities for the vehicles.…”

Section: Model Formulationmentioning

confidence: 99%

“…They developed a genetic algorithm solution for the problem using the Pareto ranking technique. Taner et al [6] considered time limitations as hard time windows, and illustrated through several benchmark problems and a case study that simulated annealing and iterated local search for solving various instances of VRPs can significantly reduce transportation costs. In a later study, Galić et al [7] presented and discussed the cost savings of a fast-moving consumer goods distributer through formulating and solving the problem as a rich VRP with hard time windows.…”

Section: Introductionmentioning

confidence: 99%

Route Optimization for the Distribution Network of a Confectionary Chain

İnanlı¹,

Ünsal

Eliiyi

2015

PROMET

View full text Add to dashboard Cite

This study considers the distribution network of a wellknown perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central dis- INTRODUCTIONProduction, handling and distribution of food and confectionary products demands a precise, climate-controlled environment, as well as facilities that will guarantee safe and reliable storage to protect the integrity of the goods. While the cost of transportation is considered as a major factor in the distribution of such perishable goods, the quality and timely delivery are also fundamental.The case study considered in this paper involves one of the largest confectionary franchise chains in Turkey, founded in 1938. The factory currently produces 60 thousand servings of cakes, 150 thousand servings of milk puddings, 20 thousand servings of syrupy desserts, 7 tons of ice cream, 300 kilograms of handmade chocolate and 5 tons of pastry products daily. In addition to this product range, the brand offers yogurt varieties and buttermilk. At the time of the study, the company has been distributing its products to 179 franchise stores (dealers) in 46 cities, as well as some big supermarket chains. With its 3,000 employees, the company has a factory site of 10,000 m² and a cold storage warehouse of 1,500 m² in Izmir, Turkey. Besides the main facilities in Izmir, there are two warehouses Ankara and Adana, and three cross-docking centres in Istanbul, Antalya and Bursa.Based on company management information, the transportation costs arising from distribution is a major cost component due to the centralized infrastructure. As the number of dealers grows, the total length of the distribution routes increases, which is currently around 350,000 km/month. Timely delivery, which is most crucial in perishable goods, is also affected as a result of this growth. Therefore, the main goal of this study is to minimize the total transportation cost of timely delivery for the defined distribution network.Currently, the company employs a third party logistics provider (3PL) for distribution, and pays on the basis of travelled distance. The distribution is completed in two hierarchical phases, on macro and micro levels. The macro-level distribution involves the direct shipment of the consolidated demand of a cluster of cities to the related warehouse/cross-docking centre from the main facilities of the company, using 12 high-capacity vehicles of 2 different types.

show abstract

Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

Abstract: This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algo-

Cited by 10 publications

References 17 publications

The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer

The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer

A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico

Route Optimization for the Distribution Network of a Confectionary Chain

Contact Info

Product

Resources

About