scholarly journals FINDING A SOLUTION FOR A COMPLEX STREET ROUTING PROBLEM USING THE MIXED TRANSPORTATION MODE

Transport ◽  
2010 ◽  
Vol 25 (1) ◽  
pp. 29-35 ◽  
Author(s):  
Peter Matis
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Real Data ◽  
Travelling Salesman ◽  
Transportation Mode ◽  
Routing Problem ◽  
Number Of Customers ◽  
The City ◽  
Special Case

The Street Routing Problem (SRP) is a special case of the well-known Vehicle Routing Problem (VRP). The goal is to service a large number of customers in the city zone. New heuristics for solving a complex SRP is evaluated based on real data. This paper presents several approximations to the length of SRP using the mixed transportation mode and compares them with the published approximations used for VRP or Travelling Salesman Problems (TSP). The system was tested in five real world instances ranging from 12 000 to 29 000 customers.

scholarly journals New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Independent Set ◽  
Maximum Weight ◽  
Routing Problem ◽  
Independent Set Problem ◽  
Maximum Weight Independent Set ◽  
Large Size

AbstractWe present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.

scholarly journals Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

1970 ◽  
Vol 24 (4) ◽  
pp. 343-351 ◽  
Author(s):  
Filip Taner ◽  
Ante Galić ◽  
Tonči Carić
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Iterated Local Search ◽  
Metaheuristic Algorithms ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Constructive Heuristics ◽  
Initial Feasible Solution

This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.

scholarly journals POPMUSIC for a real-world large-scale vehicle routing problem with time windows

2009 ◽  
Vol 60 (7) ◽  
pp. 934-943 ◽  
Author(s):  
A Ostertag ◽  
K F Doerner ◽  
R F Hartl ◽  
E D Taillard ◽  
P Waelti
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Time Windows ◽  
Routing Problem

scholarly journals On the Selective Vehicle Routing Problem

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 771 ◽  
Author(s):  
Cosmin Sabo ◽  
Petrică C. Pop ◽  
Andrei Horvat-Marc
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Mixed Integer ◽  
The Novel ◽  
Routing Problem ◽  
Proposed Model ◽  
Benchmark Instances ◽  
Number Of Customers ◽  
Optimal Set

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection routes from a given depot to a number of customers divided into predefined, mutually exclusive, and exhaustive clusters, visiting exactly one customer from each cluster and fulfilling the capacity restrictions. This paper deals with a more generic version of the GVRP, introduced recently and called Selective Vehicle Routing Problem (SVRP). This problem generalizes the GVRP in the sense that the customers are divided into clusters, but they may belong to one or more clusters. The aim of this work is to describe a novel mixed integer programming based mathematical model of the SVRP. To validate the consistency of the novel mathematical model, a comparison between the proposed model and the existing models from literature is performed, on the existing benchmark instances for SVRP and on a set of additional benchmark instances used in the case of GVRP and adapted for SVRP. The proposed model showed better results against the existing models.

scholarly journals A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

2008 ◽  
Vol 2008 ◽  
pp. 1-16
Author(s):  
Selçuk K. İşleyen ◽  
Ö. Faruk Baykoç
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Iterated Local Search ◽  
Routing Problem ◽  
Solution Approach ◽  
Stochastic Demands ◽  
Expected Length ◽  
The Traveling Salesman Problem ◽  
Special Case

We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD) where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the “Traveling Salesman Problem” (TSP) and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS) algorithm in order to reach an effective solution.

A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

2014 ◽  
Vol 238 (1) ◽  
pp. 104-113 ◽  
Author(s):  
A.D. López-Sánchez ◽  
A.G. Hernández-Díaz ◽  
D. Vigo ◽  
R. Caballero ◽  
J. Molina
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Open Vehicle Routing Problem ◽  
Open Vehicle Routing

scholarly journals Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

2008 ◽  
Vol 2008 ◽  
pp. 1-17 ◽  
Author(s):  
Goran Martinovic ◽  
Ivan Aleksi ◽  
Alfonzo Baumgartner
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Space ◽  
Global Optimum ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Practical Applications ◽  
Delivery Service ◽  
Number Of Customers ◽  
Single Commodity

We present a novel variation of the vehicle routing problem (VRP). Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD). 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP) when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is hard in the strong sense. Iterative modified simulated annealing (IMSA) is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

scholarly journals Development Of A New Genetic Algorithm For Solving Capacitated Vehicle Routing Problem In Short Time

2019 ◽  
Vol 8 (11) ◽  
pp. 903-907
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Benchmark Instances ◽  
Full Capacity ◽  
Short Time ◽  
Number Of Customers ◽  
Capacitated Vehicle

In this paper a new genetic algorithm is developed for solving capacitated vehicle routing problem (CVRP) in situations where demand is unknown till the beginning of the trip. In these situations it is not possible normal metaheuristics due to time constraints. The new method proposed uses a new genetic algorithm based on modified sweep algorithm that produces a solution with the least number of vehicles, in a relatively short amount of time. The objective of having least number of vehicles is achieved by loading the vehicles nearly to their full capacity, by skipping some of the customers. The reduction in processing time is achieved by restricting the number of chromosomes to just one. This method is tested on 3 sets of standard benchmark instances (A, M, and G) found in the literature. The results are compared with the results from normal metaheuristic method which produces reasonably accurate results. The results indicate that whenever the number of customers and number of vehicles are large the new genetic algorithm provides a much better solution in terms of the CPU time without much increase in total distance traveled. If time permits the output from this method can be further improved by using normal established metaheuristics to get better solution

scholarly journals Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2750
Author(s):  
Sebastián Dávila ◽  
Miguel Alfaro ◽  
Guillermo Fuertes ◽  
Manuel Vargas ◽  
Mauricio Camargo
Keyword(s):  
Monte Carlo ◽  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Method ◽  
Superior Performance ◽  
Real Problem ◽  
Routing Problem ◽  
Chaotic Search ◽  
Number Of Customers

The research evaluates the vehicular routing problem for distributing refrigerated products. The mathematical model corresponds to the vehicle routing problem with hard time windows and a stochastic service time (VRPTW-ST) model applied in Santiago de Chile. For model optimization, we used tabu search, chaotic search and general algebraic modeling. The model’s objective function is to minimize the total distance traveled and the number of vehicles using stochastic waiting restrictions at the customers’ facilities. The experiments were implemented in ten scenarios by modifying the number of customers. Experiments were established with several customers that can be solved using the general algebraic modeling technique in order to validate the tabu search and the chaotic search methods. The study considered two algorithms modified with Monte Carlo (tabu search and chaotic search). Additionally, two modified algorithms, TSv2 and CSv2, were proposed to reduce execution time. These algorithms were modified by delaying the Monte Carlo procedure until the first set of sub-optimal routes were found. The results validate the metaheuristic chaotic search to solve the VRPTW-ST. The chaotic search method obtained a superior performance than the tabu search method when solving a real problem in a large city. Finally, the experiments demonstrated a direct relationship between the percentage of customers with stochastic waiting time and the model resolution time.

scholarly journals Aplikasi Model Optimasi untuk Meningkatkan Efisiensi Pengangkutan Sampah di Kota Cilegon

2015 ◽  
Vol 16 (1) ◽  
pp. 59-80
Author(s):  
Danang Triwibowo ◽  
Alin Halimatussadiah
Keyword(s):  
Developing Countries ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Budget Allocation ◽  
Capital Cost ◽  
Waste Collection ◽  
Routing Problem ◽  
The City

AbstractMost cities in developing countries face inefficiency problem of waste collection service run by government. The purpose of this study is to estimate the efficiency of waste collection service and the capital cost requirement in 2019 to cover 100% waste collection service in Cilegon City. The efficiency is calculated by comparing the current costs with the optimization costs by the model of vehicle routing problem. The result shows that the obtained inefficiency reaches 37,48% which largely comes from the labor component. To cover all of resident in Cilegon City, the city needs to increase their budget allocation as much as IDR 33,884 billion in 2019. Keywords: Inefficiency; Optimization; Waste Collection; Vehicle Routing Problem AbstrakSebagian besar kota di negara berkembang menghadapi permasalahan inefisiensi pengangkutan sampah yang dikelola pemerintah. Tujuan penelitian ini adalah mengestimasi inefisiensi pengangkutan sampah di Kota Cilegon. Inefisiensi dihitung dengan membandingkan biaya saat ini dengan biaya hasil optimasi rute dengan model vehicle routing problem. Penelitian ini juga mengestimasi kebutuhan biaya modal jika rasio pengangkutan sampah mencapai 100% pada tahun 2019. Hasil penelitian menunjukkan bahwa inefisiensi sebesar 37,48%, yaitu porsi komponen tenaga kerja sebesar 94,48 dari total inefisiensi. Terkait kebutuhan modal, diperlukan kenaikan anggaran Rp33,884 miliar untuk meningkatkan rasio pengangkutan sampah menjadi 100% pada tahun 2019.

Sign in / Sign up

Export Citation Format

Share Document