The locomotive assignment problem: a survey on optimization models | Zendy

Piu F. | Zendy; Speranza M. G. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

The locomotive assignment problem: a survey on optimization models

Author(s) -

Piu F.,

Speranza M. G.

Publication year - 2014

Publication title -

international transactions in operational research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.032

H-Index - 52

eISSN - 1475-3995

pISSN - 0969-6016

DOI - 10.1111/itor.12062

Subject(s) - computer science , scheduling (production processes) , train , set (abstract data type) , mathematical optimization , context (archaeology) , operations research , assignment problem , class (philosophy) , optimization problem , engineering , mathematics , artificial intelligence , algorithm , paleontology , cartography , biology , programming language , geography

The objective of the locomotive assignment problem (LAP) is to assign a fleet of locomotives to a set of trains while satisfying a rich set of operational and budget constraints and optimizing one or more crucial objectives. This paper presents a survey on optimization models for this class of scheduling problems. Depending on the context of application, the kind of model used to solve the LAP varies; accordingly, this influences the solution methodology and algorithms used. In this paper, we review and also suggest a classification of the various models.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research