Skip to main content
SpringerLink
Log in

Branch and Bound Algorithm for a Single Vehicle Routing Problem with Toll-by-Weight Scheme

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6098))

Abstract

Most of previous studies on vehicle routing problems assume that traversal cost of each edge is simply equivalent to a constant number. Unfortunately, the models of this kind can not be applied in China because toll per kilometer of Chinese expressways varies with vehicle’s weight. Motivated by rapidly increasing market of expressway transportation in China, we address a new and special vehicle routing problem that takes a single vehicle and its weight into account. To solve this problem practically, we provide a branch-and-bound algorithm with a well-designed lower bound. This algorithm can deal with any toll scheme in which toll per unit distance monotonically increases with weight. Computational results show that test instances with up to 42 vertices can be solved in reasonable computing time.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Toth, P., Vigo, D. (eds.): The vehicle routing problem. SIAM, Philadelphia (2002)

    MATH  Google Scholar 

  2. Gutin, G., Punnen, A. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  3. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (STOC 1994), Montreal, Quebec, Canada, pp. 163–171 (1994)

    Google Scholar 

  4. Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. Mathematical Programming 82(1-2), 111–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Arora, S., Karakostas, G.: Approximation schemes for minimum latency problems. SIAM Journal on Computing 32(5), 1317–1337 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Wu, B., Huang, Z., Zhan, F.: Exact algorithms for the minimum latency problem. Information Processing Letter 92(6), 303–309 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Archer, A., Levin, A., Williamson, D.: A faster, better approximation algorithm for the minimum latency problem. SIAM Journal on Computing 37(5), 1472–1498 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. García, A., Jodrá, P., Tejel, J.: A note on the traveling repairman problem. Networks 40(1), 27–31 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Salehipour, A., Sörensen, K., Goos, P., Bräysy, O.: An efficient grasp+vnd metaheuristic for the traveling repairman problem. Working papers, University of Antwerp, Faculty of Applied Economics (2008)

    Google Scholar 

  10. Minieka, E.: The delivery man problem on a tree network. Annals of Operations Research 18(1-4), 261–266 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Operations Research 41(6), 1055–1064 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Méndez-Díaz, I., Zabala, P., Lucena, A.: A new formulation for the traveling deliveryman problem. Discrete Applied Mathematics 156(17), 3223–3237 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bianco, L., Mingozzi, A., Ricciardelli, S.: The traveling salesman problem with cumulative costs. Networks 23(2), 81–91 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chen, X., Li, J., Fan, Y., Wu, Y., Ding, L.: Design and implementation of vehicle routing optimization system based on toll-by-weight. Manufacture Information Engineering of China 17, 69–72 (2007)

    Google Scholar 

  15. Shen, C., Qin, H., Lim, A.: A capacitated vehicle routing problem with toll-by-weight rule. In: Chien, B., Hong, T. (eds.) Opportunities and Challenges for Next-Generation Applied Intelligence. Studies in Computational Intelligence, vol. 214, pp. 311–316. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Hardy, G., Littlewood, J., Pólya, G.: Inequalities. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  17. Hall, P.: On representatives of subsets. Journal of London Mathematical Society 10, 26–30 (1935)

    Article  MATH  Google Scholar 

  18. Gross, J., Yellen, J. (eds.): Graph Theorey and Its Applications. Chapman and Hall/CRC (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong

    Zizhen Zhang, Hu Qin & Andrew Lim

  2. Department of Computer Science, School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, Guangdong, PR China

    Songshan Guo

Authors
  1. Zizhen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Songshan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Z., Qin, H., Lim, A., Guo, S. (2010). Branch and Bound Algorithm for a Single Vehicle Routing Problem with Toll-by-Weight Scheme. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13033-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13033-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13032-8

  • Online ISBN: 978-3-642-13033-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation