2018 | OriginalPaper | Chapter
The Multiple Checkpoint Ordering Problem
Authors : Philipp Hungerländer, Kerstin Maier
Published in: Operations Research Proceedings 2017
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
(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.