文章基本信息

标题：A General Purpose Lagrangian Heuristic Applied to the Train Loading Problem
本地全文：下载
作者：Davide Anghinolfi ; Davide Anghinolfi ; Massimo Paolucci 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2014
卷号：108
页码：37-46
DOI：10.1016/j.sbspro.2013.12.818
语种：English
出版社：Elsevier
摘要：AbstractIn 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 network flow model complicated by additional constraints. We design a Lagrangian heuristic, which exploits a mixed integer programming (MIP) heuristic to find a first feasible solution in an acceptable time and then to improve it. We show the effectiveness of this approach by comparing the obtained results with the ones provided by a state-of-the-art MIP solver.
关键词：MIP heuristic;Train Loading Problem