The minimum-cost travel time data-collection problem is analogous to a vehicle routing problem with pickup and delivery, subject to the constraints of time windows, because the problem involves making decisions regarding two aspects: vehicle routing and vehicle scheduling. The proposed bilevel programming model minimizes the total travel cost of collecting travel time data with probe vehicles. The upper-level model is designed to determine fleet size and feasible schedules, whereas the lower-level model attempts to route vehicles at the least cost. The model in the lower level consists of a total cost objective function and a set of practical constraints, such as number of probe vehicles, number of study roadway segments, and project duration. Travel time data collection on a highway network containing several corridors in New Jersey was applied to demonstrate the applicability and performance of the developed model.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Bilevel Programming Model for Minimum-Cost Travel Time Data Collection with Time Windows


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:
    Yu, Haifeng (Autor:in) / Chien, Steven I-Jy (Autor:in) / Ting, Ching-Jung (Autor:in)


    Erscheinungsdatum :

    01.01.2010




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Advanced Techniques for Travel Time Data Collection

    Turner, Shawn M. | Transportation Research Record | 1996


    Advanced techniques for travel time data collection

    Turner,S.M. / Texas A and M Univ.,US | Kraftfahrwesen | 1995


    Advanced Techniques for Travel Time Data Collection

    Turner, Shawn M. | Online Contents | 1996


    Advanced Techniques for Travel Time Data Collection

    Turner, Shawn | Transportation Research Record | 1996