Skip to main content

Customer Selection and Profit Maximization in Vehicle Routing Problems

  • Conference paper
Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

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

Access this chapter

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Butt SE and Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Computers & Operations Research 21: 101–111.

    Article  MATH  Google Scholar 

  • Butt SE and Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers & Operations Research 26: 427–441.

    Article  MATH  MathSciNet  Google Scholar 

  • Chao I, Golden B and Wasil E (1996) The team orienteering problem. European Journal of Operational Research 88: 464–474.

    Article  MATH  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12: 568–581.

    Article  Google Scholar 

  • Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operation Research Letters 10: 27–36.

    Article  MATH  MathSciNet  Google Scholar 

  • Feillet D, Dejax P and Gendreau M (2005) Traveling salesman problems with profits. Transportation Science 39:188 205.

    Google Scholar 

  • Gueguen C (1999) Méthodes de résolution exacte pour les problèmes de tournées de véhicules. Ph.D. thesis, Laboratoire Productique Logistique, Ecole Centrale Paris.

    Google Scholar 

  • Kara İ, Laporte G and Bekta T (2004) A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 158: 793–795.

    Article  MATH  MathSciNet  Google Scholar 

  • Tang H and Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Computers & Operations Research 32: 1379–1407.

    Article  Google Scholar 

  • Tarantilis CD, Ioannou G, Kiranoudis CT and Prastacos GP (2005) Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56: 588–596.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aksen, D., Aras, N. (2006). Customer Selection and Profit Maximization in Vehicle Routing Problems. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_6

Download citation

Publish with us

Policies and ethics