In this paper, we introduce models for the optimization of the door-to-door freight transportation. The main thrust of these models stand in the allowance to forecast of freight amounts that will be transported daily considering capacity as well as time constraints (e.g. time availability of retailers and customers). We also have integrated real-world constraints to meet practical difficulties that may actually face transportation (e.g., fixed number of working hours of drivers, availability of vehicles). The transportation scheme is characterized by a consolidation center. We assumed, also, that freight transportation is mutualized. Thus, we have split the FDPTW (Pickup and Delivery Problem with Time Windows) into two problems: (i) is a Vehicle Routing Problem with Time Windows (VRPTW) with Pickup; (ii) is a VRPTW with Delivery. The proposed models are solved by LINGO. The output results are the optimal trucks in each model. Lastly, one of the elaborated models (VRPTW with delivery) is tested with Solomon's benchmark and for the other models we propose different numerical experiments to validate our contributions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Mono-objective and multi-objective models for the pickup and delivery problem with time windows


    Contributors:


    Publication date :

    2015-05-01


    Size :

    1478778 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence

    Krishnan Devaraj R. / Liu Tieming | DOAJ | 2019

    Free access


    Genetic Algorithm for a Pickup and Delivery Problem with Time Windows

    Jung, Soojung / Haghani, Ali | Transportation Research Record | 2000


    Profitable Pickup and Delivery Problem with Time Windows and Compatibility Constraints

    Cui, Shitong / Wu, Yuehui / Lin, Chang et al. | TIBKAT | 2021