This paper expands the typical Vehicle Routing Problem, and synthetically considers the situation of customs with soft time windows and a depot with several distributing vehicle types. After constructing a mathematical model for the problem, the paper emphasizes the procedure of TS algorithm for solving this problem. Finally, combined with Adaptive Memory procedure, the paper presents the pseudo-code description of TS algorithm. Some computational results are reported too.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Study on Model and Algorithm of the Heterogeneous Fleet Vehicle Routing Problem with Soft Time Windows


    Contributors:
    Du, Wen (author) / Yuan, Qingda (author) / Zhou, Zailing (author)

    Conference:

    International Conference on Traffic and Transportation Studies (ICTTS) 2002 ; 2002 ; Guilin, China



    Publication date :

    2002-07-10




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English