The traffic congestion problem and logistics costs are becoming more and more serious. There is no doubt that carpooling may not only improve vehicle utilization rate but also reduce logistics costs. In multi-vehicle environment, how to distribute service requirements to a proper vehicle is to be solved firstly. In this paper, a heuristic clustering algorithm is introduced to solve grouping progress in deterministic carpooling problem. Based on characteristics of service requirements and vehicles, the conception matching degree and heuristic algorithm are proposed in order to distribute requirements into one specific vehicle. Simulation results show that the algorithm can improve the success ride rate greatly and reduce total vehicle costs.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Service Requirements Distribution Algorithms in Carpooling Problem



    Erschienen in:

    Applied Mechanics and Materials ; 409-410 ; 1296-1302


    Erscheinungsdatum :

    03.09.2013


    Format / Umfang :

    7 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Carpooling method and carpooling system based on trajectory analysis

    ZHU DAWEI / TANG YAN | Europäisches Patentamt | 2015

    Freier Zugriff

    Carpooling system

    YU GANG | Europäisches Patentamt | 2015

    Freier Zugriff


    Carpooling method and device

    ZENG QIUYAN / LEI TANGSHENG | Europäisches Patentamt | 2016

    Freier Zugriff

    Demographics of Carpooling

    Ferguson, Erik | Online Contents | 1995