The Multiple Checkpoint Ordering Problem

Philipp Hungerländer () and Kerstin Maier ()
Additional contact information
Philipp Hungerländer: Alpen-Adria-Universität Klagenfurt
Kerstin Maier: Alpen-Adria-Universität Klagenfurt

A chapter in Operations Research Proceedings 2017, 2018, pp 171-177 from Springer

Abstract: Abstract The multiple Checkpoint Ordering Problem (mCOP) aims to find an optimal arrangement of n one-dimensional departments with given lengths such that the total weighted sum of their distances to m given checkpoints is minimized. In this paper we suggest an integer linear programming (ILP) approach and a dynamic programming (DP) algorithm, which is only exact for one checkpoint, for solving the mCOP. Our computational experiments show that there is no clear winner between the two methods. While the ILP approach is hardly influenced by increasing the number of checkpoints or the length of the departments, the performance of our DP algorithm deteriorates in both cases.

Keywords: Combinatorial optimization; Dynamic programming; Integer linear programming; Row layout problems (search for similar items in EconPapers)
Date: 2018
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-89920-6_24

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

DOI: 10.1007/978-3-319-89920-6_24

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 ().