BUS NETWORK SCHEDULING PROBLEM: GRASP + EAS WITH PISA * SIMULATION
ANA C. OLIVERA; MARIANO FRUTOS; JESSICA A. CARBALLIDO; IGNACIO PONZONI; NÉLIDA B. BRIGNOLE
LECTURE NOTES IN COMPUTER SCIENCE
Lugar: Verlag Berlin Heidelberg; Año: 2009 vol. 5517 p. 1272 - 1279
In this work a memetic algorithm for the Bus Network Scheduling Problem (BNSP) is presented. The algorithm comprises two stages: the first one calculates the distance among all the pairs of bus stops, and the second one is a MOEA that uses a novel simulation procedure for the calculus of the fitness function. This simulation method was specially developed for the BNSP. The EA used for the second stage was selected between the IBEA, NSGA-II and SPEA2 by means of some PISA tools. As a result of this experimentation, the SPEA2 was preferred since it presents the more spread solution set.