Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Freight service design for an Italian railways company
AU - Campetella, Marco
AU - Lulli, Guglielmo
AU - Pietropaoli, Ugo
AU - Ricciardi, Nicoletta
PY - 2006/12/1
Y1 - 2006/12/1
N2 - In this paper, we present a mathematical model to design the service network, that is the set of origin-destination connections. The resulting model considers both full and empty freight car movements, and takes into account handling costs. More specifically, the model suggests the services to provide, as well as the number of trains and the number and type of cars traveling on each connection. Quality of service, which is measured as total travel time, is established by minimizing the waiting time of cars at intermediate stations. Our approach yields a multi-commodity network design problem with concave arc cost functions. To solve this problem, we implement a tabu search procedure which adopts "perturbing" mechanisms to force the algorithm to explore a larger portion of the feasible region. Computational results on realistic instances show a significant improvement over current practice.
AB - In this paper, we present a mathematical model to design the service network, that is the set of origin-destination connections. The resulting model considers both full and empty freight car movements, and takes into account handling costs. More specifically, the model suggests the services to provide, as well as the number of trains and the number and type of cars traveling on each connection. Quality of service, which is measured as total travel time, is established by minimizing the waiting time of cars at intermediate stations. Our approach yields a multi-commodity network design problem with concave arc cost functions. To solve this problem, we implement a tabu search procedure which adopts "perturbing" mechanisms to force the algorithm to explore a larger portion of the feasible region. Computational results on realistic instances show a significant improvement over current practice.
KW - Railways transportation
KW - Service network design
KW - Tabu search
M3 - Conference contribution/Paper
AN - SCOPUS:84883002909
SN - 9783939897019
VL - 5
BT - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006
T2 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006
Y2 - 14 September 2006 through 14 September 2006
ER -