JUCS - Journal of Universal Computer Science 14(15): 2512-2531, doi: 10.3217/jucs-014-15-2512
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
expand article infoAna C. Olivera‡, Mariano Frutos‡, Jessica A. Carballido‡, Nélida B. Brignole§
‡ Universidad Nacional del Sur, Bahía Blanca, Argentina§ Nacional del Sur, Bahía Blanca, Argentina

Corresponding author: Ana Olivera ( aco@cs.uns.edu.ar )

© Ana Olivera, Mariano Frutos, Jessica Carballido, Nélida Brignole.
This article is freely available under the J.UCS Open Content License.
Citation: Olivera AC, Frutos M, Carballido JA, Brignole NB (2008) Bus Network Optimization with a Time-Dependent Hybrid Algorithm. JUCS - Journal of Universal Computer Science 14(15): 2512-2531. https://doi.org/10.3217/jucs-014-15-2512
Open Access
Abstract
This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve the Bus-Network Scheduling Problem (BNSP). The GRASP is used as an initialization method to find the routes between bus stops. T he Genetic Algorithm is used to find the whole configuration of the bus network, together with a simulation tool that finds the values of the environmentally dependent dynamic variables. The new method was tested with an academic case of study, and the results clearly satisfy the requirements of both the transport user and the transport operator.
Keywords
hybrid genetic algorithms, Bus Network Scheduling Problem, optimization