IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-031-66346-8_6.html
   My bibliography  Save this book chapter

Minimum Collaboration in Dial-a-Ride Problems with Additional Services

Author

Listed:
  • Jonathan Grimm

    (University of Hagen)

Abstract

The integration of supplementary services, a circumstance that has been researched in the previous chapter, may be hindered by the lack of cooperation of the dial-a-ride provider. In conclusion, there is no safety for the partner who requests the support that at least some services will be accepted. There remains some uncertainty for the requesting partner with regard to the decision-making process. To mitigate this uncertainty in the collaboration, a prize-collecting dial-a-ride problem with additional services is investigated, which safeguards the fundamental principles of the framework. On the one hand, the dial-a-ride provider is obliged to fulfill a minimum threshold. In conclusion, imposing this threshold ensures a certain commitment of the dial-a-ride provider to accept a set of supplementary services. Conversely, the health care provider is obliged to assign a rating to each request, which could also be understood as revenue from the perspective of the dial-a-ride provider. In summary, these two obligations introduce some more reliability into the planned collaboration. Any accepted request decreases the remaining budget for the acceptance of the other requests made accordingly. Consequently, the health care provider has to evaluate wisely. Furthermore, it should be noted that this evaluation process introduces additional complexity for the dial-a-ride provider in identifying a solution. The number of additional jobs may vary in order to exceed the minimum level of collaboration threshold. This chapter outlines related literature and a more formal problem statement. A program is proposed using insights obtained from previous studies. Afterward, a variable neighborhood search heuristic is presented due to the computational limits for the exact algorithms. A summary of the computational results for both exact and heuristic methods is presented before concluding with findings and suggestions for future research directions.

Suggested Citation

  • Jonathan Grimm, 2024. "Minimum Collaboration in Dial-a-Ride Problems with Additional Services," Lecture Notes in Economics and Mathematical Systems,, Springer.
  • Handle: RePEc:spr:lnechp:978-3-031-66346-8_6
    DOI: 10.1007/978-3-031-66346-8_6
    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:lnechp:978-3-031-66346-8_6. 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.