With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, the use of hybrid heuristic optimization can greatly improve the efficiency of the solution. The algorithm produces high-quality solutions for the capacity-constrained vehicle routing problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem



    Published in:

    Applied Mechanics and Materials ; 556-562 ; 4693-4696


    Publication date :

    2014-05-23


    Size :

    4 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    A Hybrid Gain-Ant Colony Algorithm for Green Vehicle Routing Problem

    Sangeetha, V. / KrishanKumar, R. / Ravichandran, K.S. et al. | IEEE | 2022


    Solving a Vehicle Routing Problem using Ant Colony Optimization Based Algorithm

    Tiwari, M. K. / Kumar, R. R. / Kumar, R. et al. | British Library Conference Proceedings | 2002



    An Improved Ant Colony Algorithm for the Time-Dependent Vehicle Routing Problem

    Liu Yongqiang, / Chang Qing, / Xiong Huagang, | IEEE | 2010