Skip to main content
SpringerLink
Log in

Vehicle Routing Model and Algorithm Study for the Network of Container Transportation with Dumping Trailers Under Hard Time Window Constraint

  • Conference paper
  • First Online:
Green Intelligent Transportation Systems (GITSS 2016)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 419))

  • 2538 Accesses

Abstract

The network of container transportation with dumping trailers is a typical NP-hard problem and has strict requirement on time. Therefore, vehicle routing becomes the core problem of the network. In this paper, the vehicle routing optimization model is built for the network of container transportation with dumping trailers to analyze the vehicle routing optimization problem under hard time constraint. In addition, via simulated annealing algorithm, the model is solved and finally verified via sample calculation.

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

  1. Wang, Z.Z., and X.Y. Liu. 2013. Comprehensive cost-benefit analysis based on the performance of drop and pull transport. In 3rd International Conference on Civil Engineering and Transportation (ICCET 2013), Kunming.

    Google Scholar 

  2. Lenstra, J.K., and K. Rinnooy. 1981. Complexity of vehicle routing and scheduling problem. Networks 11: 221–227.

    Article  Google Scholar 

  3. Smilowtiz, K., A. Atamturk, and C. Daganzo. 2003. Deferred item and vehicle routing with in integrated networks. Transportation Research Part E 39 (3): 305–323.

    Article  Google Scholar 

  4. Golden, B.L., and A.A. Assad. 1986. Perspectives on vehicle routing exciting new developments. Operation Research 34 (5): 803–809.

    Article  Google Scholar 

  5. Braysy, O., and M. Gendreau. 2005. Vehicle routing problem with time windows, part 2: Metaheuristics. Transportation Science 39 (1): 119–139.

    Article  Google Scholar 

  6. Kallehauge, B. 2008. Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & Operations Research 35 (7): 2307–2330.

    Article  MathSciNet  MATH  Google Scholar 

  7. Kima, Byung-In, Seongbae Kimb, and Surya Sahoo. 2006. Waste collection vehicle routing problem with time windows. Computers & Operations Research 33: 3624–3642.

    Article  MATH  Google Scholar 

  8. Li, H., and A. Lim. 2001. A metaheuristic for the pickup and delivery problem with time windows. In 13th IEEE International Conference on Tools with Artificial Intelligence, 333–340. Los Alamitos, CA: IEEE Computer Society.

    Google Scholar 

  9. Hashimoto, H., T. Ybaralti, S. Imahori, et al. 2006. The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics 154: 2271–2290.

    Article  MathSciNet  MATH  Google Scholar 

  10. Solomon, M.M. 1986. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks 16: 161–174.

    Article  MathSciNet  MATH  Google Scholar 

  11. Lysgaard, J. 2006. Reach ability cuts for the vehicle routing problem with time windows. European Journal of Operational Research 175: 210–223.

    Article  MathSciNet  MATH  Google Scholar 

  12. Chuah, K.H., and J.C. Yngling. 2005. Routing for a just-in-time supply pickup and delivery system. Transportation Science 39 (3): 328–339.

    Article  Google Scholar 

  13. Azi, N., M. Gendreau, and J.Y. Potvin. 2007. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research 178: 755–766.

    Article  MathSciNet  MATH  Google Scholar 

  14. Caseau, Y., and F. Laburthe. 1999. Heuristics for large constrained vehicle routing problems. Heuristics 5: 281–303.

    Article  MATH  Google Scholar 

  15. Moghaddam, R.T., N. Safaei, and Y. Gholipour. 2006. A hybrid simulated annealing for capacitated vehicle routing problems with the dependent route length. Applied Mathematics and Computation 176: 445–454.

    Article  MathSciNet  MATH  Google Scholar 

  16. Malmborg, C.J. 1996. A genetic algorithm for service level based vehicle scheduling. European Journal of Operational Research 93 (1): 23–34.

    Article  MathSciNet  MATH  Google Scholar 

  17. Mazzro, S., and I. Loiseau. 2004. An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Mathematics 18: 81–86.

    Article  MathSciNet  Google Scholar 

  18. Montane, F.A.T., and R.D. Galvao. 2006. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operation Research 33 (3): 595–629.

    Article  MathSciNet  MATH  Google Scholar 

  19. Bektas, T., and G. Laporte. 2011. The pollution-routing problem. Transportation Research Part B: Methodological 45 (8): 1232–1250.

    Article  Google Scholar 

Download references

Acknowledgements

Research for this paper was funded by the National Natural Science Foundation of China (No. 41401120, 51009060 and 50909042) and Fundamental Research Funds for the Central Universities (Project No. 2014B00214). The authors thank every teacher of research institute, for their comments and suggestions.

Author information

Authors and Affiliations

  1. College of Harbour, Coastal and Offshore Engineering, Hohai University, Nanjing, 210098, China

    Liupeng Jiang, Yilin Yang, Yan Zhang, Xuejun Feng & Jie Ji

Authors
  1. Liupeng Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yilin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuejun Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jie Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liupeng Jiang .

Editor information

Editors and Affiliations

  1. Beijing Institute of Technology, Beijing, China

    Wuhong Wang

  2. Technical University of Munich, Munich, Germany

    Klaus Bengler

  3. Beijing Institute of Technology, Beijing, China

    Xiaobei Jiang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media Singapore

About this paper

Cite this paper

Jiang, L., Yang, Y., Zhang, Y., Feng, X., Ji, J. (2018). Vehicle Routing Model and Algorithm Study for the Network of Container Transportation with Dumping Trailers Under Hard Time Window Constraint. In: Wang, W., Bengler, K., Jiang, X. (eds) Green Intelligent Transportation Systems. GITSS 2016. Lecture Notes in Electrical Engineering, vol 419. Springer, Singapore. https://doi.org/10.1007/978-981-10-3551-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3551-7_46

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3550-0

  • Online ISBN: 978-981-10-3551-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation