scholarly journals Vehicle Routing Problem Instances: Application to Multi-UAV Mission Planning

2010 ◽  
Author(s):  
Mariam Adbelhafiz ◽  
Ahmed Mostafa ◽  
Anouck Girard
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Mission Planning ◽  
Routing Problem ◽  
Problem Instances ◽  
Multi Uav

scholarly journals Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

2018 ◽  
Vol 20 (4) ◽  
pp. 2085-2108 ◽  
Author(s):  
Hiba Yahyaoui ◽  
Islem Kaabachi ◽  
Saoussen Krichen ◽  
Abdulkader Dekdouk
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Large Problem ◽  
Solution Quality ◽  
Routing Problem ◽  
Petrol Station ◽  
Capacity Limitations ◽  
Problem Instances

Abstract We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to minimize the total driving distance by the used trucks. The problem configuration is described through a prefixed set of trucks with several compartments and a set of customers with demands and prefixed delivery. Given such inputs, the minimization of the total traveled distance is subject to assignment and routing constraints that express the capacity limitations of each truck’s compartment in terms of the pathways’ restrictions. For the NP-hardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality. We compare the ability of the proposed AVNS with the exact solution using CPLEX and a set of benchmark problem instances is used to analyze the performance of the both proposed meta-heuristics.

scholarly journals A New Plant Intelligent Behaviour Optimisation Algorithm for Solving Vehicle Routing Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Godfrey Chagwiza
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Future Research ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Optimisation Algorithm ◽  
Input Parameters ◽  
Problem Instances

A new plant intelligent behaviour optimisation algorithm is developed. The algorithm is motivated by intelligent behaviour of plants and is implemented to solve benchmark vehicle routing problems of all sizes, and results were compared to those in literature. The results show that the new algorithm outperforms most of algorithms it was compared to for very large and large vehicle routing problem instances. This is attributed to the ability of the plant to use previously stored memory to respond to new problems. Future research may focus on improving input parameters so as to achieve better results.

scholarly journals An Enhanced ABC algorithm to Solve the Vehicle Routing Problem with Time Windows

2020 ◽  
Vol 14 (1) ◽  
pp. 46-52 ◽  
Author(s):  
Krittika Kantawong ◽  
Sakkayaphop Pravesjit
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Time Windows ◽  
Scatter Search ◽  
The Other ◽  
Routing Problem ◽  
Bee Colony ◽  
Problem Instances

This work proposes an enhanced artificial bee colony algorithm (ABC) to solve the vehicle routing problem with time windows (VRPTW). In this work, the fuzzy technique, scatter search method, and SD-based selection method are combined into the artificial bee colony algorithm. Instead of randomly producing the new solution, the scout randomly chooses the replacement solution from the abandoned solutions from the onlooker bee stage. Effective customer location networks are constructed in order to minimize the overall distance. The proposed algorithm is tested on the Solomon benchmark dataset where customers live in different geographical locations. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very encouraging. Compared to other algorithms, the proposed algorithm produces the best result for all testing problem sets. More significantly, the proposed algorithm obtains better quality than the other algorithms for 39 of the 56 problem instances in terms of vehicle numbers. The proposed algorithm obtains a better number of vehicles and shorter distances than the other algorithm for 20 of the 39 problem instances.

scholarly journals Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Rafael Grosso ◽  
Jesús Muñuzuri ◽  
Alejandro Escudero-Santana ◽  
Elena Barbadilla-Martín
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Time Windows ◽  
Mathematical Formulation ◽  
Access Time ◽  
Routing Problem ◽  
Urban Freight ◽  
Additional Costs ◽  
Problem Instances

The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

scholarly journals A machine learning-based branch and price algorithm for a sampled vehicle routing problem

OR Spectrum ◽  
2021 ◽  
Author(s):  
Nikolaus Furian ◽  
Michael O’Sullivan ◽  
Cameron Walker ◽  
Eranda Çela
Keyword(s):  
Machine Learning ◽  
Variable Selection ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimal Solution ◽  
Branch And Price ◽  
Routing Problem ◽  
Selection Policy ◽  
Decision Variables ◽  
Problem Instances

AbstractPlanning of operations, such as routing of vehicles, is often performed repetitively in rea-world settings, either by humans or algorithms solving mathematical problems. While humans build experience over multiple executions of such planning tasks and are able to recognize common patterns in different problem instances, classical optimization algorithms solve every instance independently. Machine learning (ML) can be seen as a computational counterpart to the human ability to recognize patterns based on experience. We consider variants of the classical Vehicle Routing Problem with Time Windows and Capacitated Vehicle Routing Problem, which are based on the assumption that problem instances follow specific common patterns. For this problem, we propose a ML-based branch and price framework which explicitly utilizes those patterns. In this context, the ML models are used in two ways: (a) to predict the value of binary decision variables in the optimal solution and (b) to predict branching scores for fractional variables based on full strong branching. The prediction of decision variables is then integrated in a node selection policy, while a predicted branching score is used within a variable selection policy. These ML-based approaches for node and variable selection are integrated in a reliability-based branching algorithm that assesses their quality and allows for replacing ML approaches by other (classical) better performing approaches at the level of specific variables in each specific instance. Computational results show that our algorithms outperform benchmark branching strategies. Further, we demonstrate that our approach is robust with respect to small changes in instance sizes.

scholarly journals Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Thanapat Leelertkij ◽  
Parthana Parthanadee ◽  
Jirachai Buddhakulsomsiri
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Retail Stores ◽  
Routing Problem ◽  
Hybrid Heuristics ◽  
New Variant ◽  
Problem Instances

This paper presents a new variant of vehicle routing problem with paired transshipment demands (VRPT) between retail stores (customers) in addition to the regular demand from depot to retail stores. The problem originates in a real distribution network of high-end retail department stores in Thailand. Transshipment demands arise for one-order-per-season expensive items, whose inventories at the depot may become shortage after the middle of a season, while they remain available at some retail stores. A transshipment demand is a request for items that need to be picked up from a specific store that has the items and delivered to the store that requests the items. The objective of solving the VRPT is to find delivery routes that can satisfy both regular demands and transshipment demands in the same routes without incurring too much additional transportation distance. A mixed integer linear programming model is formulated to represent the VRPT. Six small problem instances are used to test the model. A hybrid threshold accepting and neighborhood search heuristic is also developed to solve large problem instances of VRPT. The heuristic is further extended to include a forbidden list of transshipment demands that should not be included in the same routes. The purpose is to prevent incurring too much additional distance from satisfying transshipment demands. With the forbidden list, the problem becomes vehicle routing problem with optional transshipment demands (VRPOT). Computational testing shows promising results that indicate effectiveness of the proposed hybrid heuristics as well as the forbidden list.

scholarly journals Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms

2021 ◽  
Vol 12 (4) ◽  
pp. 441-456 ◽  
Author(s):  
Ümit Yıldırım ◽  
Yusuf Kuvvetli
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Group Problem ◽  
Invasive Weed ◽  
Data Set ◽  
Routing Problem ◽  
Metaheuristic Methods ◽  
Hybrid Solutions ◽  
Problem Instances

The vehicle routing problem is widespread in terms of optimization, which is known as being NP-Hard. In this study, the vehicle routing problem with capacity constraints is solved using cost- and time-efficient metaheuristic methods: an invasive weed optimization algorithm, genetic algorithm, savings algorithm, and hybridized variants. These algorithms are tested using known problem sets in the literature. Twenty-four instances evaluate the performance of algorithms from P and five instances from the CMT data set group. The invasive weed algorithm and its hybrid variant with savings and genetic algorithms are used to determine the best methodology regarding time and cost values. The proposed hybrid approach has found optimal P group problem instances with a 2% difference from the best-known solution on average. Similarly, the CMT group problem is solved with about a 10% difference from the best-known solution on average. That the proposed hybrid solutions have a standard deviation of less than 2% on average from BKS indicates that these approaches are consistent.

scholarly journals An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem

2013 ◽  
Vol 3 (2) ◽  
pp. 413-415 ◽  
Author(s):  
L. Caccetta ◽  
M. Alameen ◽  
M. Abdul-Niby
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Routing Problem ◽  
Cpu Time ◽  
Capacitated Vehicle Routing Problem ◽  
Domain Reduction ◽  
Problem Instances ◽  
Capacitated Vehicle

This paper proposes an effective hybrid approach that combines domain reduction with the Clarke and Wright algorithm to solve the capacitated vehicle routing problem. The hybrid approach is applied to solve 10 benchmark capacitated vehicle routing problem instances. The dimension of the instances was between 21 to 200 customers. The results show that domain reduction can improve the classical Clarke and Wright algorithm by about 18%. The hybrid approach improves the large instances significantly in comparison with the smaller size instances. This paper will not show the time taken to solve each instance, as the Clarke and Wright algorithm and the hybrid approach took almost the same CPU time.

Sign in / Sign up

Export Citation Format

Share Document