Application Of Vehicle Routing Problem Research Articles

Vehicle Routing Optimization for Pandemic Containment: A Systematic Review on Applications and Solution Approaches

The global spread of the novel coronavirus (COVID-19) has accounted for many deaths. The effective containment of the current COVID-19 epidemic calls for a fast and sustainable delivery strategy to minimize the impact of this crisis. As such, this study aimed to conduct a comprehensive review of research on the vehicle routing problem (VRP) from a sustainable viewpoint during the pandemic and explore viable delivery solutions that may aid in the containment of the COVID-19 pandemic. Through a systematic review of the selected articles, four broad themes of pandemic containment measures from the delivery aspect were identified: efficient pharmaceutical delivery strategy, contactless distribution, sustainable waste transportation strategy, and isolated and quarantine vehicle scheduling. Following that, the methodology utilized to execute the containment measures were analyzed, research gaps were hightlighted, and possibilities for future studies were suggested. In summary, the goal of this research is to provide an overview of the literature on the application of VRPs in pandemic control and to assist academics and practitioners in learning more about the performance metrics, models, and solution techniques utilized in pandemic control delivery operations.

Application of Vehicle Routing Problem with Simultaneous Pickup and Delivery

Giderek artan küresel rekabet ortamında şirketler, tedarik zinciri süreçlerini en verimli ve etkin şekilde yönetmek için çeşitli yöntemlere başvurmaktadır. Bu konuda önemli yöntemlerden biri dağıtım ağlarının doğru tasarlanması yönündedir. Dağıtım ağı tasarımında önemli bileşenler tesislerin yer seçimi ve araçların rotalanmasıdır. Mümkünse, dağıtım maliyetini en aza indirmek amacıyla, yer seçimi ve rotalama problemindeki iki karar beraber dikkate alınmalıdır. Ancak, pratikte birçok sektörde yer seçimini etkileyen çok daha farklı ve ağırlığı fazla faktörler bulunabilmekle beraber, zamanla değişen ihtiyaçlar rotalama noktalarının değişmesine neden olabilmektedir. Ayrıca bu çalışmanın başlangıçta yapılmadığı durumlarda, yer değiştirme maliyeti çok daha yüksek olacağı için, çalışmalar sadece rotalama problemi olarak ele alınabilmektedir. Araç rotalama problemi, bir veya birkaç noktadan, belirli müşterilere ürün dağıtımı veya toplanması olarak tanımlanabilir. Bu problemlerde, araç kapasiteleri ve müşterilerin servis süresi gibi kısıtlar dikkate alınarak etkin kullanım hedeflenmektedir. Araç rotalama problemleri, birçok alanda gerçek hayatta karşılaşılan problemlerdir. Bu durum bu konuda çalışmalar yapılmasını ve verimli sonuçlar ortaya koyan algoritmalar sunulmasında fayda sağlamıştır. Bu çalışmada ise, karşılaşılan problemin çözüme ulaşması adına, model eş zamanlı topla-dağıt döngüsel araç rotalama problemi olarak kurgulanmıştır. Eş zamanlı topla-dağıt döngüsel araç rotalama problemi; müşterilerin dağıtım ve toplama taleplerinin, başlangıç ve bitiş noktaları aynı (işletme) olacak şekilde araçlar için belirli bir rota belirlenerek eş zamanlı olarak karşılandığı bir problemdir. Bu çalışma kapsamında, endüstriyel bıçak bileme fabrikası üzerinden 8 farklı şehirde 20 müşteriye lojistik hizmet oluşturulması üzerine rotalama problemi ele alınmıştır. Probleme konu olan şirket, mevcutta var olan yöntemde ürün lojistiği kargo firmaları ile sağlanmaktadır. Maliyetleri düşürmek adına şirketin kendi lojistik ağının kurulması üzere çalışma yapılmıştır. Bu çalışmada, minimum sayıda araç kullanımı ile toplam kat edilen mesafenin minimumda tutulması ile birlikte, kısıtlar göz önüne alınarak, minimum maliyet hedeflenmiştir. Problem çözümü için doğrusal programlama kullanılmış ve GAMS üzerinden çözüme ulaşılmıştır.

An application of the vehicle routing problem to biomass transportation

Pruning is a cultural operation linked to Mediterranean agricultural management and it offers through its wastes the chance to procure biofuels. Currently, these residues are disposed of by burning or shredding, not being exploited because of several technical difficulties in extraction, handling and transport as well as because of the lack of accurate data on the quantity and suitability of these residues. However, recent work has reported methods of supplying new biomass detection models and concentration locations. These make it possible to tackle reliable collection plans as a part of the decision support system in a biomass supply management information system. This paper addresses the biomass collection problem, as an application of the classical vehicle routing problem, where minimum cost routes have to be calculated for a fleet of several agricultural vehicles (chippers, trucks, tipper trailers and tractors). A hybrid approach based on genetic algorithms and local search methods is presented to solve a real case study. Results show a significant improvement in the operational efficiency obtained by applying such methods that come from the industrial engineering domain.

Preprocessing Techniques in SCVRP Model: Case of Rubbish Transportation Problem in Kecamatan Ilir Barat II Palembang South Sumatera Indonesia

Rubbish transportation activities in Palembang can be considered as one of the application of Vehicle Routing Problem (VRP). We call it Symmetric Capacitated Vehicle Routing Problem (SCVRP) since we allow two way direction routes. We focus on rubbish transportation of Kecamatan Ilir Barat II Palembang, one of the biggest districts in Palembang to be simplified using preprocessing techniques to achieve simpler SVCRP model. This technique can simplify the model through some stages such as strengthening the bounds of constraint, eliminating redundant variables or fixing the variables [1]. The results show that preprocessing techniques can create simpler SCVRP formulation and easily solve the problem with aid of optimization tool.

Preprocessing Techniques in SCVRP Model: Case of Rubbish Transportation Problem in Kecamatan Ilir Barat II Palembang South Sumatera Indonesia

Rubbish transportation activities in Palembang can be considered as one of the application of Vehicle Routing Problem (VRP). We call it Symmetric Capacitated Vehicle Routing Problem (SCVRP) since we allow two way direction routes. We focus on rubbish transportation of Kecamatan Ilir Barat II Palembang, one of the biggest districts in Palembang to be simplified using preprocessing techniques to achieve simpler SVCRP model. This technique can simplify the model through some stages such as strengthening the bounds of constraint, eliminating redundant variables or fixing the variables [1]. The results show that preprocessing techniques can create simpler SCVRP formulation and easily solve the problem with aid of optimization tool.

Vehicle Routing Problem Application in Tour Planning Multimedia System with Metaheuristic Designed

This work suggests an adaptive tour planning multimedia system designed to meet the tour routing needs of different tourists. Tour planning is an application of vehicle routing problem. Meanwhile, vehicle routing problem is a ‘traveling salesman problem’ (TSP) type problem. TSP is an example of a combinatorial optimization problem and is known as NP-hard. As studied by many researchers exact, heuristic (approximation) and meta-heuristic algorithms are usually applied for NP problems. A promising meta-heuristic algorithm is proposed to solve the tour routing problems which involves minimization of total traveling time, total travel expenses or the combined total traveling time and expenses. Moreover, a simple exchange local search heuristic is also applied to increase the exploitation (intensification) competence of the scheme. Restated, finding out the optimal planned tour routes using particle swarm optimization (PSO) and increasing performance by exchange heuristic scheme is suggested. Simulation results indicate the PSO with exchange heuristic designed provides a promising strategy, and is efficient for solving tour routing problems.