Abstract To get global solution in multi-depots vehicle transshipment scheduling problem (MDVTSP), MDVTSP models are established. Genetic algorithm and particle swarm hybrid optimization is established to solve MDVTSP. The optimization course is as follow: first set up chromosome vector to get goods’ transshipment point, and assign goods to vehicles. Second, establish tabu matrix for ant colony optimization (ACO) to get vehicle route. Then evaluate and filtrate vehicle scheduling results by optimization aim, circulate until meet terminate qualification. Illustration results show that Hybrid arithmetic is effective for multi-depots vehicle transshipment scheduling problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Study on Multi-depots Vehicle Transshipment Scheduling Problem and Its Genetic Algorithm and Ant Colony Algorithm Hybrid Optimization


    Contributors:
    Wang, Lei-zhen (author) / Wang, Ding-wei (author) / Wu, Si-lei (author) / Wang, Si-han (author) / Wang, Su-xin (author)


    Edition :

    1st ed. 2016


    Publication date :

    2016-01-01


    Size :

    8 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal location of transshipment depots

    Wiles, Peter G. | Online Contents | 2001




    Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm

    Thanapat Leelertkij / Parthana Parthanadee / Jirachai Buddhakulsomsiri | DOAJ | 2021

    Free access