Single-stage shunting minimizing weighted departure times

Florian Jaehn, Johannes Rieder and Andreas Wiehl

Omega, 2015, vol. 52, issue C, 133-141

Abstract: In a traditional rail-freight hump yard, a huge number of freight cars are perpetually shunted to form outbound trains. In order to transport each car to its destination, the inbound trains are decoupled and disassembled into individual cars, which are then moved to one of the several classification tracks where they are reassembled to form new outbound trains. Motivated by the situation at Munich shunting yard, we consider a traditional single-stage shunting problem, where freight cars form new, single-destination trains with an arbitrary freight car order. There might be multiple trains to one destination so that the assignment of freight cars to outbound trains is determined by the sequence of inbound trains to be processed. Each freight car has a priority value and the objective is to minimize the weighted sum of priority values of outbound trains multiplied by the time units that have elapsed until departure. First, we elaborate a MIP formulation and then we provide a lower bound and develop precedence relations. Furthermore, we present heuristic procedures as well as a branch and bound approach. The paper concludes with computational results comparing the proposed algorithms with CPLEX.

Keywords: Single-stage shunting; Scheduling; Weighted completion time (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048314001406
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:52:y:2015:i:c:p:133-141

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2014.11.001

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().