Abstract A queue-dependent vehicle dispatching rule, with options to use special vehicles (rented, reserve, shared etc.) for relieving long waiting lines, is considered. The transportation system under consideration has one source terminal and a fleet of N regular vehicles. Passengers are assumed to arrive individually at the source terminal according to a Poisson process. An efficient recursive algorithm is derived to analyse the performance of the system. An average cost criterion is used to determine the firm's fleet size and dispatching strategy for a simpler system. This is a variant of a “Random vehicle dispatching with options” rule proposed by Zuckerman and Tapiero (1980).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Queue-dependent vehicle dispatching with options and optimal fleet size


    Contributors:

    Published in:

    Publication date :

    1981-04-27


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Random vehicle dispatching with options and optimal fleet size

    Zuckerman, Dror / Tapiero, Charles S. | Elsevier | 1979


    COORDINATED DISPATCHING OF AUTONOMOUS VEHICLE FLEET

    BRANDON JEFFREY / GERRESE ALEXANDER WILLEM / ZHANG YIFEI et al. | European Patent Office | 2022

    Free access

    Coordinated dispatching of autonomous vehicle fleet

    BRANDON JEFFREY / GERRESE ALEXANDER WILLEM / ZHANG YIFEI et al. | European Patent Office | 2023

    Free access

    Coordinated dispatching of autonomous vehicle fleet

    BRANDON JEFFREY / GERRESE ALEXANDER WILLEM / ZHANG YIFEI et al. | European Patent Office | 2024

    Free access

    COORDINATED DISPATCHING OF AUTONOMOUS VEHICLE FLEET

    BRANDON JEFFREY / GERRESE ALEXANDER WILLEM / ZHANG YIFEI et al. | European Patent Office | 2023

    Free access