Bus Network Scheduling Problem: GRASP + EAs with PISA * Simulation
详细信息 查看全文
- 作者：Ana C. Olivera ; Mariano Frutos ; Jessica A. Carballido ; Ignacio Ponzoni ; N¨¦lida B. Brignole
- 关键词：Memetic Evolutionary Algorithms ; Bus ; Network Scheduling Problem ; Optimization ; PISA
- 刊名：Lecture Notes in Computer Science
- 出版年：2009
- 出版时间：2009
- 年：2009
- 卷：5517
- 期：1
- 页码：1272-1279
- 全文大小：262.3 KB
文摘
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.