IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-08623-6_37.html
   My bibliography  Save this book chapter

Multi-start Heuristics for Unit-Capacity Orienteering Problems

In: Operations Research Proceedings 2021

Author

Listed:
  • Alexander Beckmann

    (Clausthal University of Technology)

  • Jürgen Zimmermann

    (Clausthal University of Technology)

Abstract

We address a planning problem for the underground transit of goods with containers in mining companies. A problem instance contains tasks and capacities for their fulfillment. Tasks are transports of containers from their current locations to given destinations and deliveries and pickups of empty containers and materials. Besides, we address combinations of those tasks with precedence constraints. Storage locations provide a stock of empty containers and materials and are destinations for pickup containers and materials. Heterogeneous workers and a fleet of heterogeneous vehicles are available for performing the tasks. Each task has an assigned profit and can have a due date, which grants additional profit on observance. The objective is to maximize the benefit of fulfilled tasks and met due dates. We developed two heuristic solution approaches, creating tours either sequentially or in parallel. Furthermore, these constructive algorithms are extended to multi-start versions using randomization of vehicle and worker selections, container-type selection, and insertion criteria.

Suggested Citation

  • Alexander Beckmann & Jürgen Zimmermann, 2022. "Multi-start Heuristics for Unit-Capacity Orienteering Problems," Lecture Notes in Operations Research, in: Norbert Trautmann & Mario Gnägi (ed.), Operations Research Proceedings 2021, pages 247-253, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-08623-6_37
    DOI: 10.1007/978-3-031-08623-6_37
    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:lnopch:978-3-031-08623-6_37. 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.