A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper we face the train loading problem (TLP) at seaport terminals by proposing a general purpose Lagrangian heuristic. The TLP consists of assigning import containers to the trains departing from the terminal, maximizing the utilization of trains, minimizing the distance travelled by containers from their locations in the storage area to the wagons, as well as the number of needed unproductive movements of containers (re-handles). We define a 0-1 LP formulation consisting of a networkdoi:10.1016/j.sbspro.2013.12.818 fatcat:h2uvag3uhjhrnibxfydjn6kupi