Abstract Given a group of one or more schools, each with a specific arrival time window, and the bus routes serving these schools, the problem is to create an optimum set of combinations of routes to be served by a single bus, where optimality is defined in terms of fleet size and deadhead travel distance. We present the results of a computational study comparing ten heuristics, adapted from procedures which have appeared in the literature, on a set of 30 test problems derived from actual school data. This study is a follow on to that reported in Graham and Nuttle (1986).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Addendum to “a comparison of heuristics for a school bus scheduling problem”


    Contributors:

    Published in:

    Publication date :

    1986-08-12


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    A comparison of heuristics for a school bus scheduling problem

    Graham, Derek / Nuttle, Henry L.W. | Elsevier | 1985


    Electric Vehicle Charging Scheduling Problem: Heuristics and Metaheuristic Approaches

    Zaidi, Imene / Oulamara, Ammar / Idoumghar, Lhassane et al. | Springer Verlag | 2023


    Heuristics for single machine scheduling problem with family setup times

    Peng, Yunfang / Han, Yajuan / Xiao, Yuyan et al. | British Library Online Contents | 2017


    Two heuristics for task scheduling

    Darte, Alain | TIBKAT | 1991


    Addendum

    Online Contents | 2006