Skip to main content
SpringerLink
Log in

Pre-selection Strategies for the Collaborative Vehicle Routing Problem with Time Windows

  • Conference paper
  • First Online:
Dynamics in Logistics

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

Abstract

In horizontal coalitions for auction-based exchange of transportation requests, (freight) carriers have to identify requests that are selected for offering to coalition partners. This paper contributes pre-selection strategies, where requests are selected based on their approximated potential to increase the carriers’ profit. In a computational study, the strategies’ ability to achieve savings is analyzed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Archetti C, Speranza MG, Vigo D (2012) Vehicle routing problems with profits. Technical report, Department of Economics and Management, University of Brescia, Italy

    Google Scholar 

  • Berger S, Bierwirth C (2010) Solutions to the request reassignment problem in collaborative carrier networks. Transp Res Part E: Logist Transp Rev 46:627–638

    Article  Google Scholar 

  • Chu C (2005) A heuristic algorithm for the truckload and less than truckload problem. Eur J Oper Res 165:657–667

    Article  MathSciNet  MATH  Google Scholar 

  • Cruijssen F, Cools M, Dullaert W (2007) Horizontal cooperation in logistics: opportunities and impediments. Transp Res Part E: Logist Transp Rev 43:129–142

    Article  Google Scholar 

  • Dai B, Chen H (2011) A multi-agent and auction-based framework and approach for carrier collaboration. Logist Res 3:101–120

    Article  Google Scholar 

  • Gansterer M, Hartl RF (2015) Request evaluation strategies for carriers in auction-based collaborations. OR Spectrum. doi:10.1007/s00291-015-0411-1

    MathSciNet  MATH  Google Scholar 

  • Krajewska MA, Kopfer H (2006) Collaborating freight forwarding enterprise. OR Spectrum 28:301–317

    Article  MATH  Google Scholar 

  • Krajewska MA, Kopfer H (2009) Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197:741–751

    Article  MATH  Google Scholar 

  • Pillac V, Gendreau M, Guret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1–11

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Schopka K, Kopfer H (2015a) Pre-selection strategies for dynamic collaborative transportation planning problems. Operations research proceedings 2014 to appear

    Google Scholar 

  • Schopka K, Kopfer H (2015b) Proxies for the auction-based request exchange of dynamic and collaborative transportation scenarios. Working paper, University of Bremen

    Google Scholar 

  • Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. Inf Syst E-Bus Manage 7:447–471

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The research was supported by the German Research Foundation (DFG) as part of the project “Kooperierende Rundreiseplanung bei rollierender Planung.”

Author information

Authors and Affiliations

  1. Chair of Logistics, University of Bremen, Bremen, Germany

    Kristian Schopka & Herbert Kopfer

Authors
  1. Kristian Schopka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Kopfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kristian Schopka .

Editor information

Editors and Affiliations

  1. und Logistik GmbH, BIBA - Bremer Institut fĂĽr Produktion und Logistik GmbH, Bremen, Germany

    Michael Freitag

  2. University of Bremen , Bremen, Germany

    Herbert Kotzab

  3. BIBA, BIBA-Bremer Institut fĂĽr Produktion und Logistik GmbH, Bremen, Germany

    JĂĽrgen Pannek

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Schopka, K., Kopfer, H. (2017). Pre-selection Strategies for the Collaborative Vehicle Routing Problem with Time Windows. In: Freitag, M., Kotzab, H., Pannek, J. (eds) Dynamics in Logistics. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-319-45117-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45117-6_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45116-9

  • Online ISBN: 978-3-319-45117-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation