Adapting Exact and Heuristic Procedures in Solving an NP-Hard Sequencing Problem

Andreas Wiehl ()
Additional contact information
Andreas Wiehl: University of Augsburg

A chapter in Operations Research Proceedings 2014, 2016, pp 613-619 from Springer

Abstract: Abstract The paper on handWiehl, Andreas focuses on the development of computerized solutions for a particular class within the area of shunting yard optimization. Our aim is to determine a humping sequence to shunt freight cars from inbound trains to outbound trains. The objective is to minimize the total weighted tardiness. We present a simple mixed integer problem formulation, two heuristic approaches and an implementation in CPLEX for the study. In addition, we compare the CPU and objective value of the proposed algorithms with the results of CPLEX optimizer in a computational study.

Keywords: Tabu Search; Tabu List; Total Weighted Tardiness; First Come First Serve; Freight Rail (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-319-28697-6_85

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_85

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().