Search results for "Vehicle routing problem"
showing 8 items of 78 documents
Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems
2020
Vehicle Routing Problems (VRP) are computationally challenging, constrained optimization problems, which have central role in logistics management. Usually different solvers are being developed and applied for different kind of problems. However, if descriptive and general features could be extracted to describe such problems and their solution attempts, then one could apply data mining and machine learning methods in order to discover general knowledge on such problems. The aim then would be to improve understanding of the most important characteristics of VRPs from both efficient solution and utilization points of view. The purpose of this article is to address these challenges by proposi…
A hybrid evolution strategy for the open vehicle routing problem
2010
This paper presents a hybrid evolution strategy (ES) for solving the open vehicle routing problem (OVRP), which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of non-depot returning capacitated vehicles. The objective is to minimize the fleet size and the distance traveled. The proposed solution method manipulates a population of @m individuals using a (@m+@l)-ES; at each generation, a new intermediate population of @l offspring is produced via mutation, using arcs extracted from parent individuals. The selection and combination of arcs is dictated by a vector of strategy parameters. A multi-parent recombination …
Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows
2021
International audience; Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows. Recently, the vehicle routing problem with delivery options was introduced into the scientific literature. It extends the GVRPTW by capacities of shared locations and by specifying service-level constraints defined by the customers' preferences for delivery options. The vehicle routing problem with delivery options also generalizes the vehicle routing problem with home roaming delivery locations and the vehicle routing problem with multiple time…
Sustainable vehicle routing based on firefly algorithm and TOPSIS methodology
2019
Abstract In a sustainable management of logistics, transportation plays a crucial role. Traditionally, the main purpose was to solve the Vehicle Routing Problem minimizing the cost associated with the travelled distances. Nowadays, the economic profit cannot be the only driver for achieving sustainability and environmental issues have to be also considered. In this paper, to satisfy the intricate limits involved in real vehicle routing problem, the study has been structured considering different types of vehicles in terms of maximum capacity, velocity and emissions, asymmetric paths, vehicle-client constraints and delivery time windows. The firefly algorithm has been implemented to solve th…
On automatic algorithm configuration of vehicle routing problem solvers
2019
Many of the algorithms for solving vehicle routing problems expose parameters that strongly influence the quality of obtained solutions and the performance of the algorithm. Finding good values for these parameters is a tedious task that requires experimentation and experience. Therefore, methods that automate the process of algorithm configuration have received growing attention. In this paper, we present a comprehensive study to critically evaluate and compare the capabilities and suitability of seven state-of-the-art methods in configuring vehicle routing metaheuristics. The configuration target is the solution quality of eight metaheuristics solving two vehicle routing problem variants.…
Metaheuristics meet metamodels : a modeling language and a product line architecture for route optimization systems
2011
Feature Extractors for Describing Vehicle Routing Problem Instances
2016
The vehicle routing problem comes in varied forms. In addition to usual variants with diverse constraints and specialized objectives, the problem instances themselves – even from a single shared source - can be distinctly different. Heuristic, metaheuristic, and hybrid algorithms that are typically used to solve these problems are sensitive to this variation and can exhibit erratic performance when applied on new, previously unseen instances. To mitigate this, and to improve their applicability, algorithm developers often choose to expose parameters that allow customization of the algorithm behavior. Unfortunately, finding a good set of values for these parameters can be a tedious task that…
Computer aided scheduling and routing of vehicle-carrier fleet—a case study
2016
This paper presents a case study of development of an information system for a large enterprise from vehicle-transport industry. A novel optimization model and algorithms developed to solve scheduling and routing of vehicle-carrier fleet are presented and discussed. Carried out qualitative experiments confirmed the usability of developed user-guided search paradigm and high performance of autonomous algorithmic solution search methods.