The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
Authors
Abstract:
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational constraints and minimizing the total operational cost. This problem is the special application of vehicle scheduling and it is modeled by using the vehicle routing problem with time windows (VRPTW) to optimal assignment of locomotives to assembled trains. Almost all of the prior models were deterministic and an important issue, widely ignored in prior research in locomotive optimization, is the presence of significant sources of uncertainty in transit times, travel times and changes to the train schedule. Therefore, in this paper unlike most of the work where all the times are deterministic, uncertainty in travel time is considered. Because travel times in reality fluctuate due to a variety of factors and its understanding and management in transportation networks is very important. The concepts of fuzzy sets and fuzzy control systems are considered to model the uncertainty in travel times. Besides, a genetic algorithm (GA) with various heuristics is proposed to tackle the proposed model and its performance is evaluated in different steps on various test problems generalized from a set of instances in the literature. The computational experiments on data sets illustrate the efficiency and effectiveness of the proposed approach.
similar resources
The Vehicle Routing Problem with Real-Time Travel Times
The paper considers a vehicle routing problem with time windows and real-time travel times. We assume the deployment of an information and communication system that is based on mobile technologies, which provides a real-time mobile connection between the dispatching centre and drivers, allows localising vehicles on road, and gives the online overview over traffic conditions. We explicitly incor...
full textA hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
full textThe Locomotive Routing Problem
Given a schedule of trains, the locomotive planning (or scheduling) problem (LPP) is to determine the minimum cost assignment of locomotive types to trains that satisfies a number of business and operational constraints. Once this is done, the railroad has to determine the sequence of trains to which each locomotive is assigned by unit number so that it can be fueled and serviced as necessary. ...
full textVehicle Routing Problem Vehicle Routing Problem
ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...
full textStochastic Vehicle Routing with Random Travel Times
We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can b...
full textMy Resources
Journal title
volume 5 issue 2
pages 119- 136
publication date 2017-10-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023