Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

The Locomotive Assignment Problem (LAP) is a class of planning and scheduling problems solved by assigning a fleet of locomotives to a network of trains. In the planning versions of the LAP, the type of consist (a group of linked locomotives) assigned to each train in a given schedule is determined. We introduce an optimization model (called consists selection) that precedes the planning LAP solution and determines the set of consist types. This selection leads to solutions that are characterized by potential savings in terms of overall fueling cost and are easier to handle in the routing phase. © 2015 Elsevier Ltd.


Publié dans:
Transportation Research Part E: Logistics and Transportation Review, 82, 217-237
Année
2015
Publisher:
Oxford, Elsevier
ISSN:
1366-5545
Mots-clefs:
Laboratoires:




 Notice créée le 2015-07-15, modifiée le 2018-09-13


Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)