IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i5p858-870.html
   My bibliography  Save this article

An analysis of generalised heuristics for vehicle routing and personnel rostering problems

Author

Listed:
  • Mustafa Misir

    (KU Leuven, Department of Computer Science, CODeS & iMinds-ITEC, Gent, Belgium)

  • Pieter Smet

    (KU Leuven, Department of Computer Science, CODeS & iMinds-ITEC, Gent, Belgium)

  • Greet Vanden Berghe

    (KU Leuven, Department of Computer Science, CODeS & iMinds-ITEC, Gent, Belgium)

Abstract

The present study investigates the performance of heuristics while solving problems with routing and rostering characteristics. The target problems include scheduling and routing home care, security and maintenance personnel. In analysing the behaviour of the heuristics and determining the requirements for solving the aforementioned problems, the winning hyper-heuristic from the first International Cross-domain Heuristic Search Challenge (CHeSC 2011) is employed. The completely new application of a hyper-heuristic as an analysis tool offers promising perspectives for supporting dedicated heuristic development. The experimental results reveal that different low-level heuristics perform better on different problems and that their performance varies during a search process. The following characteristics affect the performance of the heuristics: the planning horizon, the number of activities and lastly the number of resources. The body of this paper details both these characteristics and also discusses the required features for embedding in an algorithm to solve problems particularly with a vehicle routing component.

Suggested Citation

  • Mustafa Misir & Pieter Smet & Greet Vanden Berghe, 2015. "An analysis of generalised heuristics for vehicle routing and personnel rostering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 858-870, May.
  • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:5:p:858-870
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/pdf/jors201411a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/full/jors201411a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yadav, Niteesh & Tanksale, Ajinkya, 2022. "An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1100-1125.
    2. Pouria Khodabandeh & Vahid Kayvanfar & Majid Rafiee & Frank Werner, 2021. "A Bi-Objective Home Health Care Routing and Scheduling Model with Considering Nurse Downgrading Costs," IJERPH, MDPI, vol. 18(3), pages 1-24, January.
    3. Laura Malagodi & Ettore Lanzarone & Andrea Matta, 2021. "Home care vehicle routing problem with chargeable overtime and strict and soft preference matching," Health Care Management Science, Springer, vol. 24(1), pages 140-159, March.
    4. Li, Yanfeng & Xiang, Ting & Szeto, Wai Yuen, 2021. "Home health care routing and scheduling problem with the consideration of outpatient services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Drake, John H. & Kheiri, Ahmed & Özcan, Ender & Burke, Edmund K., 2020. "Recent advances in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 405-428.
    6. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    7. Ehsan Pourjavad & Eman Almehdawe, 2022. "Optimization of the technician routing and scheduling problem for a telecommunication industry," Annals of Operations Research, Springer, vol. 315(1), pages 371-395, August.
    8. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    9. Emir Hüseyin Özder & Evrencan Özcan & Tamer Eren, 2019. "Staff Task-Based Shift Scheduling Solution with an ANP and Goal Programming Method in a Natural Gas Combined Cycle Power Plant," Mathematics, MDPI, vol. 7(2), pages 1-26, February.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:66:y:2015:i:5:p:858-870. 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.palgrave-journals.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.