BUS NETWORK OPTIMIZATION THROUGH TIME-DEPENDENT HYBRID ALGORITHM

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

Rio de Janeiro

Conferencia; VII International Conference on Intelligent Systems Design and Applications; 2007

State University of Rio de Janeiro, Pontifical Catholic University of Rio de Janeiro, Federal University of Rio de Janeiro

This paper focuses on a new hybrid technique that combines a genetic algorithm with simulation to solve the bus-network scheduling problem (BNSP). The BNSP has several factors that complicate both the problem formulation and the selection of efficient algorithms for its resolution. This problem is challenging because not only the BNSP is NP-Complete, but also the existing methods fail to contemplate environment dependent dynamic variables. The hybrid algorithm proposed in this article comprises two stages: a modified GRASP (Greedy Randomized Adaptive Search Procedures) as an initialization method, and the genetic algorithm with simulation to find the values of the environment dependent dynamic variables. The final goal consisted in designing a meta-heuristic technique that yields an adequate scheduling to solve this general problem. The BNSP, chosen as case study, satisfies both the demand and the offer of transport. The method was applied to a solution of experimental examples with good results.