A note on “Multistage Methods for Freight Train Classification”

Briskorn, Dirk; Jaehn, Florian

doi:10.1002/net.21498

A note on “Multistage Methods for Freight Train Classification”

Publication date

2013-02-22

Document type

Forschungsartikel

Author

Briskorn, Dirk

Jaehn, Florian

Organisational unit

Universität Augsburg, Lehrstuhl für Sustainable Operations and Logistics

DOI

10.1002/net.21498

URI

https://openhsu.ub.hsu-hh.de/handle/10.24405/22322

Scopus ID

2-s2.0-84879881719

Publisher

Wiley

Series or journal

Networks

ISSN

0028-3045

Periodical volume

62

Periodical issue

1

First page

80

Last page

81

Peer-reviewed

✅

Part of the university bibliography

Nein

Language

English

Keyword

minimum feedback arc set problem on euler multigraphs

railway optimization

shunting yard

train classification

Abstract

The paper “Multistage Methods for Freight Train Classification” by Jacob et al. [Networks 57 (2011) 87–105] provides great insight into the theory and practice of sorting procedures at shunting yards. In Jacob et al. [Networks 57 (2011) 87–105] many relevant shunting situations (e.g., single or multiple inbound trains, single or multiple outbound trains, (un)restricted number of tracks, (un)restricted track capacity) are formally specified as optimization problems. Then, for almost all of them either an exact polynomial‐time algorithm or an NP‐hardness proof is provided. However, the case of multiple inbound trains, which is of high practical relevance, is left open. We close this gap by providing a proof of NP‐hardness. © 2013 Wiley Periodicals, Inc. NETWORKS, 2013

Version

Published version

Access right on openHSU

Metadata only access