Search results for " Routing"
showing 9 items of 229 documents
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.…
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
2018
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…
Analysis of the Effects of Reservoir Operating Scenarios on Downstream Flood Damage Risk Using an Integrated Monte Carlo Modelling Approach
2023
The aim of this study is to analyse the effects of reservoir operating scenarios, for flood damage evaluation downstream of a dam, using a Monte Carlo bivariate modelling chain. The proposed methodology involves a stochastic procedure to calculate flood hydrographs and the evaluation of the consequent flood inundation area by applying a 2D hydraulic model. These results are used to estimate the inundation risk and, as consequence, the relative damage evaluation under different water level conditions in an upstream reservoir. The modelling chain can be summarized as follows: single synthetic stochastic rainfall event generation by using a Monte Carlo procedure through a bivariate copulas ana…
Metaheuristics meet metamodels : a modeling language and a product line architecture for route optimization systems
2011
Two-phase routing in three-dimensional blocked optical tori
2014
The contribution of this paper is an all-optical 3D network architecture. We describe scheduled, two-phase routing for it. The three-dimensional blocked optical torus BOT of block size b consists of b2 × b2 × b2 nodes for the first phase routing. Processors are evenly deployed at the underlying torus so that every bth node consists of a processor. Additionally, a BOT consists of b3 blocks of b × b × b subnetworks for the second phase routing. Routing of each packet is done in two phases. Firstly, packets are routed from source processor to an intermediate target node at the target block. Secondly, packets are routed from the intermediate targets at the target block to the target processor (…
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.
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
2006
Abstract This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them. For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.