Home > Research > Publications & Outputs > Freight service design for an Italian railways ...
View graph of relations

Freight service design for an Italian railways company

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Freight service design for an Italian railways company. / Campetella, Marco; Lulli, Guglielmo; Pietropaoli, Ugo et al.
6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006. Vol. 5 2006.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Campetella, M, Lulli, G, Pietropaoli, U & Ricciardi, N 2006, Freight service design for an Italian railways company. in 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006. vol. 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006, Zurich, Switzerland, 14/09/06.

APA

Campetella, M., Lulli, G., Pietropaoli, U., & Ricciardi, N. (2006). Freight service design for an Italian railways company. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006 (Vol. 5)

Vancouver

Campetella M, Lulli G, Pietropaoli U, Ricciardi N. Freight service design for an Italian railways company. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006. Vol. 5. 2006

Author

Campetella, Marco ; Lulli, Guglielmo ; Pietropaoli, Ugo et al. / Freight service design for an Italian railways company. 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006. Vol. 5 2006.

Bibtex

@inproceedings{185464f565da4b398c6660a1ab40965b,
title = "Freight service design for an Italian railways company",
abstract = "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.",
keywords = "Railways transportation, Service network design, Tabu search",
author = "Marco Campetella and Guglielmo Lulli and Ugo Pietropaoli and Nicoletta Ricciardi",
year = "2006",
month = dec,
day = "1",
language = "English",
isbn = "9783939897019",
volume = "5",
booktitle = "6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006",
note = "6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2006 ; Conference date: 14-09-2006 Through 14-09-2006",

}

RIS

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 -