IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_24.html
   My bibliography  Save this book chapter

The Multiple Checkpoint Ordering Problem

In: Operations Research Proceedings 2017

Author

Listed:
  • Philipp Hungerländer

    (Alpen-Adria-Universität Klagenfurt)

  • Kerstin Maier

    (Alpen-Adria-Universität Klagenfurt)

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.

Suggested Citation

  • Philipp Hungerländer & Kerstin Maier, 2018. "The Multiple Checkpoint Ordering Problem," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 171-177, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_24
    DOI: 10.1007/978-3-319-89920-6_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-89920-6_24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.