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 An algorithm for the maximum weight independent set problem on outerstring graphs

2017 ◽  
Vol 60 ◽  
pp. 19-25 ◽  
Author(s):  
J. Mark Keil ◽  
Joseph S.B. Mitchell ◽  
Dinabandhu Pradhan ◽  
Martin Vatshelle
Keyword(s):  
Independent Set ◽  
Maximum Weight ◽  
Independent Set Problem ◽  
Maximum Weight Independent Set

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

Use of GVRP as a Model of Two Specific Real World Problems and Its Bioinspired Solution

2016 ◽  
pp. 451-469
Author(s):  
Jorge Rodas ◽  
Daniel Azpeitia ◽  
Alberto Ochoa-Zezzatti ◽  
Raymundo Camarena ◽  
Tania Olivier
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Combinatorial Optimization Problem ◽  
Exact Methods ◽  
Routing Problem ◽  
Computing Technique ◽  
Product Delivery ◽  
Soft Computing Technique ◽  
Generalized Vehicle Routing Problem

The aim of this chapter is about the inclusion of real world scenarios, viewed as a Generalized Vehicle Routing Problem (GVRP) model problem, and treated by bio inspired algorithms in order to find optimum routing of product delivery. GVRP is the generalization of the classical Vehicle Routing Problem (VRP) that is well known NP-hard as generalized combinatorial optimization problem with a number of real world applications and a variety of different versions. Due to its complexity, large instances of VRP are hard to solve using exact methods. Thus a solution by a soft computing technique is desired. From a methodological standpoint, the chapter includes four bio inspired algorithms, ant colony optimization and firefly. From an application standpoint, several factors of the generalized vehicle routing are considered from a real world scenario.

scholarly journals Using Congestion Zones for Solving the Time Dependent Vehicle Routing Problem

2020 ◽  
Vol 32 (1) ◽  
pp. 25-38 ◽  
Author(s):  
Tonči Carić ◽  
Juraj Fosin
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Time Delays ◽  
Historical Data ◽  
Time Dependent ◽  
Routing Problem ◽  
Real World Problem ◽  
Independent Case ◽  
Real World Problems

This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by using historical data. The data are used to predict travel times during certain times of the day and derive zones of congestion that can be used by optimization algorithms. A combination of well-known algorithms was adapted to the time dependent setting and used to solve the real-world problems. The adapted algorithm outperforms the best-known results for TDVRP benchmarks. The proposed framework was applied to a real-world problem and results show a reduction in time delays in serving customers compared to the time independent case.

Sign in / Sign up

Export Citation Format

Share Document