In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transportation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encoding which is adopted as it is capable of equally and uniquely representing all possible basic solutions. The crossover and mutation was designed based on this encoding. We designed the criterion that chromosome always converted to a transportation tree. In the evolutionary process, the mixed strategy and roulette wheel selection is used. Numerical experiments show the effectiveness and efficiency of the proposed algorithm.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Spanning tree-based genetic algorithm for bicriteria transportation problem


    Contributors:
    Gen, M. (author) / Li, Yin-Zhen (author)


    Publication date :

    1998


    Size :

    4 Seiten, 11 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    The Bicriteria Delay Management Problem

    Schöbel, Anita | Springer Verlag | 2006



    Bicriteria Stop Location

    Schöbel, Anita | Springer Verlag | 2006


    To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation

    Ginkel, A. / Schobel, A. | British Library Online Contents | 2007


    Small Quantities of Cargo Transportation Route Selection Base on Minimum Spanning Tree Algorithm

    Yu, Hong Yan ;Ke, Jin Long ;Li, Meng Ting | Trans Tech Publications | 2014