We consider scheduling a vehicle/mobile robot in intelligent material transportation systems with multiple trips, time windows and long planning horizon. We propose a novel approach for the scheduling problem which consists of two parts: a) a framework for splitting the long planning horizon problem into many problems with short planning horizons; b) a fast algorithm for scheduling with short planning horizons based on a flexible and effective two-index mixed integer programming (MIP) model. Numerical results show our algorithm can get optimal solutions in seconds/minutes for the short planning horizon problems for which existing three-index MIP model in literature needs hours or cannot obtain optimal solutions after six hours. For long planning horizon problems, our method is also fast and has good scalability, and can significantly reduce cost compared with the Genetic Algorithm in the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Vehicle Scheduling with Multiple Trips and Time Windows and Long Planning Horizon


    Contributors:
    Liu, Shudong (author) / Li, Xiaoli (author) / Xiang, Shili (author)


    Publication date :

    2018-12-01


    Size :

    254402 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multiple depot vehicle and crew scheduling with time windows for scheduled trips

    Kliewer, Natalia / Amberg, Bastian / Amberg, Boris | Springer Verlag | 2011



    Vehicle routing problems with multiple trips

    Cattaruzza, Diego / Absi, Nabil / Feillet, Dominique | Springer Verlag | 2018


    The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon

    Dell, R. F. / Batta, R. / Karwan, M. H. | British Library Online Contents | 1996