Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/70214
DC Field | Value | |
---|---|---|
dc.title | Evaluation of evolutionary algorithms for multi-objective train schedule optimization | |
dc.contributor.author | Chang, C.S. | |
dc.contributor.author | Kwan, C.M. | |
dc.date.accessioned | 2014-06-19T03:09:33Z | |
dc.date.available | 2014-06-19T03:09:33Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Chang, C.S.,Kwan, C.M. (2004). Evaluation of evolutionary algorithms for multi-objective train schedule optimization. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 3339 : 803-815. ScholarBank@NUS Repository. | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/70214 | |
dc.description.abstract | Evolutionary computation techniques have been used widely to solve various optimization and learning problems. This paper describes the application of evolutionary computation techniques to a real world complex train schedule multiobjective problem. Three established algorithms (Genetic Algorithm GA, Particle Swarm Optimization PSO, and Differential Evolution DE) were proposed to solve the scheduling problem. Comparative studies were done on various performance indices. Simulation results are presented which demonstrates that DE is the best approach for this scheduling problem. © Springer-Verlag Berlin Heidelberg 2004. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.sourcetitle | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) | |
dc.description.volume | 3339 | |
dc.description.page | 803-815 | |
dc.description.coden | LNAIE | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.