According to the layout characteristics of parking in the parking lot, the problem of converting the path choice of parking is raised to seek the optimal path and generate the optimal parking guiding line. This paper proposed the concept of node busy factor, and a mathematical model of the optimal path with constraints. The state transition rules of basic ant colony algorithm is improved as well as updating rules of pheromone. After that, the taboo strategy is introduced for further optimization. At last, the experimental results and Matlab simulation verify the effectiveness of the Algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Research on Optimization Problem of Routing about Parking Guidance Based on Improved Ant Colony Algorithm


    Beteiligte:
    Li, Juan (Autor:in) / Li, Zi (Autor:in) / Sun, Tao (Autor:in) / Jia, Meijuan (Autor:in) / Yu, Haitao (Autor:in)


    Erscheinungsdatum :

    01.10.2019


    Format / Umfang :

    431634 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch