Skip to main content
Springer Nature Link
Log in

Fleet Management for Pickup and Delivery Problems with Multiple Locations and Preferences

  • Conference paper
  • First Online:
Dynamics in Logistics (LDIC 2018)

Part of the book series: Lecture Notes in Logistics ((LNLO))

Included in the following conference series:

  • 3265 Accesses

Abstract

To provide more routing flexibility and improve service in delivery processes, we extend the Pickup and Delivery Problem with multiple time-location combinations for service. Furthermore, we introduce preference possibilities for each option, and aim for finding solutions that balance minimizing total travel costs and customer or operator dissatisfaction. We compare an Adaptive Large Neighborhood Search metaheuristic with solving the problem exactly. Simulation experiments indicate that a multiple-location scenario is highly beneficial compared to the corresponding single-location scenario and that the metaheuristic always finds the optimum if this could be computed by the exact solver.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    For ILP modeling purposes, this load quantity is related to all possible pickup nodes of the request and the negative load is related to all its delivery nodes.

References

  • Baldacci, R., Bartolini, E., Laporte, G.: Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61, 1072–1077 (2010)

    Article  MATH  Google Scholar 

  • Bektaş, T., Erdoğan, G., Ropke, S.: Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transp. Sci. 45, 299–316 (2011)

    Article  Google Scholar 

  • Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

  • Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R., Ghoseiri, K.: A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application. Appl. Soft Comput. 14, 504–527 (2014)

    Article  Google Scholar 

  • Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122, 11–17 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  • Golden, B.: Recent developments in vehicle routing. In: Proceedings of the Bicentennial Conference on Mathematical Programming, pp. 233–240 (1978)

    Google Scholar 

  • Lin, C., Choy, K.L., Ho, G.T., Lam, H., Pang, G.K., Chin, K.: A decision support system for optimizing dynamic courier routing operations. Expert Syst. Appl. 41, 6917–6933 (2014)

    Article  Google Scholar 

  • Moccia, L., Cordeau, J.-F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63, 232–244 (2012)

    Article  Google Scholar 

  • Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jiménez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115–129 (2015)

    Article  Google Scholar 

  • Ozbaygin, G., Karasan, O.E., Savelsbergh, M., Yaman, H.: A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transp. Res. Part B 100, 115–137 (2017)

    Article  Google Scholar 

  • Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23, 229–235 (1996)

    Article  MATH  Google Scholar 

  • Reyes, D., Savelsbergh, M., Toriello, A.: Vehicle routing with roaming delivery locations. Transp. Res. Part C 80, 71–91 (2017)

    Article  Google Scholar 

  • Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)

    Article  Google Scholar 

  • Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60, 611–624 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research is supported by the project “Dynamic Fleet Management (P14-18 project 3)” (project 14894) of the Netherlands Organisation for Scientific Research (NWO), domain Applied and Engineering Sciences (TTW).

Author information

Authors and Affiliations

  1. Department of Maritime and Transport Technology, Delft University of Technology, Delft, The Netherlands

    Johan Los & Rudy R. Negenborn

  2. Department of Software Technology, Delft University of Technology, Delft, The Netherlands

    Matthijs T. J. Spaan

Authors
  1. Johan Los
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthijs T. J. Spaan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rudy R. Negenborn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johan Los .

Editor information

Editors and Affiliations

  1. Fachbereich 4 - Produktionstechnik, Universität Bremen, Bremen, Germany

    Michael Freitag

  2. Fachbereich 7 - Wirtschaftswissenschaft, Universität Bremen, Bremen, Bremen, Germany

    Herbert Kotzab

  3. Fachbereich 4 - Produktionstechnik, Universität Bremen, Bremen, Germany

    Jürgen Pannek

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Los, J., Spaan, M.T.J., Negenborn, R.R. (2018). Fleet Management for Pickup and Delivery Problems with Multiple Locations and Preferences. In: Freitag, M., Kotzab, H., Pannek, J. (eds) Dynamics in Logistics. LDIC 2018. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-319-74225-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74225-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74224-3

  • Online ISBN: 978-3-319-74225-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics