The problem of taxi despatch from a pool of taxies, either waiting at the taxi stand or plying free in the city is addressed. Calls for taxies may emanate from different parts of the city. The taxi stand operator is aware about the status (i.e. waiting, busy, free) and position of all taxies associated with the taxi stand at any time. While despatching the taxi for a call, the operator should consider its vicinity with the calling point in order to reduce the service time. On the other hand, the operator should be fair to all the taxi drivers, and maintain proper distribution of opportunities to each one of them. Two rules; 'nearest vehicle first' and 'least utilized vehicle first' are normally used to meet the above objectives. However, both these objectives cannot be simultaneously met with any one rule. In this paper we propose a fuzzy combination of the two rules to fulfill both the objectives at the same time. The fuzzy combination approach has the potential to take many such contradicting parameters into simultaneous consideration. A simulation model is also presented to demonstrate the results of such fuzzy combination of rules.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Taxi despatch: a fuzzy rule approach


    Contributors:


    Publication date :

    1997-01-01


    Size :

    325118 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Computer Aided Despatch

    Wootton, L. / Logging Industry Research Organisation | British Library Conference Proceedings | 1994


    State railroad and despatch

    Risch, C. | Engineering Index Backfile | 1931


    SHIPPER: A day in despatch

    British Library Online Contents | 1996


    SHIPPER: A day in despatch

    Online Contents | 1996


    Computer assisted transportation management and despatch

    Grootenboer,M.M. / Intergraph Europe,NL | Automotive engineering | 1990