GRASP + SPEA2 * SIMULATION = ALLOCATION AND SCHEDULING OF BUS-NETWORKS IN URBAN AREAS

ANA C. OLIVERA; MARIANO FRUTOS; JESSICA A. CARBALLIDO; NÉLIDA B. BRIGNOLE

Buenos Aires

Conferencia; XXIV Conference on System Modelling and Optimization; 2009

Universidad de Buenos Aires

The Bus Network Scheduling Problem (BNSP) deals with the task of finding a bus network that fulfills several objectives. In a precise definition for a bus network it is necessary to consider several entities: the user, who is a passenger of the buses, the authorities that impose the system regulations, and the operator of the lines. These entities usually have different expectations for the bus network, which are generally confronted. This task involves the determination of many aspects: routes, frequencies, time schedules, fleet size and number of employees. The whole process can be decomposed in several activities. The design of a route for the determination of the number of lines and paths, and the decision of which line frequencies comprise the most important ones, since their results are directly used to perform the other activities. The initial crucial activity is to find the route’s design as an arrangement of lines and routes. The second one is to define the frequencies that vary according to the period of the day (midday, midnight, rush hour, etc) and the synchronicity of transfers, fleet size, resources and employees, which should be assigned for each line. Together with these requirements, the BNSP also involves many objectives, such as the maximization of the quality of the service and the maximization of the benefit for the transport operator.