Skip to main content

Vehicle Path Optimization with Time Window Based on Improved Ant Colony Algorithm

  • Conference paper
  • First Online:
Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1088))

Abstract

Ant colony optimization (ACO) is a new heuristic algorithm developed by simulating ant foraging on the basis of group cooperative learning. TSP and other combinatorial optimization problems have been successfully solved. Like other heuristic search algorithms, ant colony algorithm has the disadvantage of being easily limited to local optimum. Aiming at the vehicle routing problem based on time window, the upper and lower limits of pheromone trajectory intensity are determined by analyzing the ant colony algorithm, and the transmission probability and pheromone updating method are improved to improve the convergence speed and global search ability of the algorithm. Aiming at the vehicle routing problem with time windows in logistics distribution, an improved maximum and minimum ant colony algorithm is proposed to improve the optimization performance. The algorithm can be extended to such related path optimization problems and applied.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

References

  1. Wang Qizhen. 2010. Automatic control system regulation scheme of textile air conditioning. Science and Technology Information 22: 395–396. (in Chinese).

    Google Scholar 

  2. Liu Jinkun. 2003. Advanced PID control and MATLAB simulation, 2nd ed. Beijing: Electronics Industry Press (in Chinese).

    Google Scholar 

  3. Li Jianwei, and Ren Qingchang. 2008. Study on supply air temperature forecast and changing machine dew point for variable air volume system. Building Energy & Environment 27 (4): 29–32 (in Chinese).

    Google Scholar 

  4. Kefayat, M., A.L. Ara, and S.A.N. Niaki. 2015. A hybrid of ant colony optimization and artificial bee colony algorithm for probabilistic optimal placement and sizing of distributed energy resources. Energy Conversion and Management 92: 149–161.

    Article  Google Scholar 

  5. Abdulkader, M.M.S., Y. Gajpal, and T.Y. ElMekkawy. 2015. Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Applied Soft Computing 37: 196–203.

    Article  Google Scholar 

  6. Mahi, M., Ö.K. Baykan, and H. Kodaz. 2015. A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Applied Soft Computing 30: 484–490.

    Article  Google Scholar 

  7. Liu, M., F. Zhang, Y. Ma, et al. 2016. Evacuation path optimization based on quantum ant colony algorithm. Advanced Engineering Informatics 30 (3): 259–267.

    Article  Google Scholar 

  8. Wan, Y., M. Wang, Z. Ye, et al. 2016. A feature selection method based on modified binary coded ant colony optimization algorithm. Applied Soft Computing 49: 248–258.

    Article  Google Scholar 

  9. Saghatforoush, A., M. Monjezi, R.S. Faradonbeh, et al. 2016. Combination of neural network and ant colony optimization algorithms for prediction and optimization of flyrock and back-break induced by blasting. Engineering with Computers 32 (2): 255–266.

    Article  Google Scholar 

  10. Lalla-Ruiz, E., C. Expósito-Izquierdo, S. Taheripour, et al. 2016. An improved formulation for the multi-depot open vehicle routing problem. OR Spectrum 38 (1): 175–187.

    Article  MathSciNet  MATH  Google Scholar 

  11. Archetti, C., M. Savelsbergh, and M.G. Speranza. 2016. The vehicle routing problem with occasional drivers. European Journal of Operational Research 254 (2): 472–480.

    Article  MathSciNet  MATH  Google Scholar 

  12. Yao, B., B. Yu, P. Hu, et al. 2016. An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research 242 (2): 303–320.

    Article  MathSciNet  MATH  Google Scholar 

  13. Cattaruzza, D., N. Absi, D. Feillet, et al. 2017. Vehicle routing problems for city logistics. EURO Journal on Transportation and Logistics 6 (1): 51–79.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Natural Science Foundation of China (No. 61863013), Key R & D projects of Jiangxi science and Technology Department of China (No. 20161BBE50091), Science and Technology Foundation of Jiangxi Educational Committee of China (No. 150529), and East China Jiaotong University School Foundation Fund “Research on Urban Fire Monitoring System Based on IoT Collaboration Perception” (15RJ01).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, B., Li, T. (2020). Vehicle Path Optimization with Time Window Based on Improved Ant Colony Algorithm. In: Huang, C., Chan, YW., Yen, N. (eds) Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019). Advances in Intelligent Systems and Computing, vol 1088. Springer, Singapore. https://doi.org/10.1007/978-981-15-1468-5_22

Download citation

Publish with us

Policies and ethics