This article deals with the intermodal transportation problem for the commodities delivery between different locations. The time – dependent shortest path planning, in which the travel time along each arc is a known function of the departure time along the arc, is a very important problem and arises in many practical application such as a routing system of a container used in the time – dependent intermodal transportation. Given a fixed timetable of the bi – intermodal transportation network (using trucks and trains ), this article proposes a genetic algorithm – based method to route a container from a source to destination such that the total transportation time between these nodes to be minimum.


    Access

    Download


    Export, share and cite



    Title :

    Container routing in multimodal and time – dependent network using genetic algorithms


    Contributors:


    Publication date :

    2011



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    School bus routing using genetic algorithms

    Thangiah, Sam R. / Nygard, Kendall E. | SPIE | 1992


    Optimization Model for Intermodal Routing Problem of International Container Cargos in Korea Using Genetic Algorithms

    National Research Council (U.S.) | British Library Conference Proceedings | 2005



    SOLUTION TO VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHMS

    Murthy, Vishnu / Arun Kumar, Manda V / Jaswanth, Kongara et al. | BASE | 2014

    Free access

    Genetic Algorithm for the Time-Dependent Vehicle Routing Problem

    Jung, S. / Haghani, A. / National Research Council | British Library Conference Proceedings | 2001