Advertisement

An Adaptive Large Neighborhood Search for Routing and Scheduling Carsharing Service Requests

  • Magdalena P. LippenbergerEmail author
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

One possibility of coordinating service requests that arise for vehicles of a carsharing fleet is to optimize routes of shuttles that drop off and pick up service agents. This scenario is modeled as a variant of Vehicle Routing Problem (VRP), including aspects of the VRP with Time Windows, the Team Orienteering Problem and the Pick-Up and Delivery Problem. A metaheuristic, an Adaptive Large Neighborhood Search is adapted, tested by applying real-world data and evaluated regarding performance and run time. The results show that, despite high run times to improve the initial solution several times, a feasible solution is obtained quickly. Some very practicable routes are obtained when including the minimization of the latest arrival time in the hierarchical objective function. Then, all shuttles are occupied evenly and results reach a high number of served requests. The algorithm can support fleet managers to handle a complex problem within their daily business.

Keywords

Adaptive large neighborhood search Metaheuristic Pick-up and delivery problem Carsharing service requests 

References

  1. 1.
  2. 2.
    Li, Y., Chen, H., Prins., C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252(1), 27–38 (2016)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Technische Universität MünchenMunichGermany

Personalised recommendations