Long-term car pooling is defined as the sharing of a private vehicle by more than one user who need to reach a destination following a semicommon route between the individuals' points of origin and destination in a specific period. In this paper, we employ a network flow technique to systematically develop a long-term many-to-many car pooling model. The model is formulated as a special integer multiple-commodity network flow problem. A Lagrangian relaxation-based algorithm is also developed to solve the model. The performance of the heuristic algorithm is evaluated by carrying out a case study using real data and suitable assumptions. The test results confirm the usefulness of the model and the heuristic algorithm and that they could be useful in practice.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem


    Contributors:


    Publication date :

    2011-12-01


    Size :

    449691 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Free access


    A Multi-agent Based Self-adaptive Genetic Algorithm for the Long-term Car Pooling Problem

    Guo, Y. / Goncalves, G. / Hsu, T. | British Library Online Contents | 2013


    A car pooling system using heuristic costs

    Hansen, R.C. / Kahne, S.J. / Houska, R.V. | Elsevier | 1974