Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/9562
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | JANSSENS, Gerrit K. | - |
dc.contributor.author | Pangilinan, J.M. | - |
dc.date.accessioned | 2009-04-30T10:37:36Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Proceedings of the International Conference on Information Technologies (InfoTech-2008), p.115-124 | - |
dc.identifier.isbn | 978-954-9518-56-6 | - |
dc.identifier.uri | http://hdl.handle.net/1942/9562 | - |
dc.description.abstract | The paper presents a sensitivity analysis of a genetic algorithm (GA) as applied to the multiobjective shortest path problem (MSPP). The study explores the robustness of the multi-objective evolutionary algorithm in terms of the sensitivity of its output to changes in its input parameters. Results show that mutation and the recombination operators only slightly affect the exploration and exploitation of solutions in the multiobjective shortest path problem. However, the size of the population and the number of generations of the GA largely influence the output of the genetic algorithm. | - |
dc.language.iso | en | - |
dc.title | Robustness analysis of parameter settings in a genetic algorithm for the multi-objective shortest path problem | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencename | InfoTech2008 | - |
local.bibliographicCitation.conferenceplace | Varna Bulgaria, 19-20 September 2008 | - |
dc.identifier.epage | 124 | - |
dc.identifier.spage | 115 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
local.bibliographicCitation.btitle | Proceedings of the International Conference on Information Technologies (InfoTech-2008) | - |
item.fullcitation | JANSSENS, Gerrit K. & Pangilinan, J.M. (2008) Robustness analysis of parameter settings in a genetic algorithm for the multi-objective shortest path problem. In: Proceedings of the International Conference on Information Technologies (InfoTech-2008), p.115-124. | - |
item.fulltext | With Fulltext | - |
item.contributor | JANSSENS, Gerrit K. | - |
item.contributor | Pangilinan, J.M. | - |
item.accessRights | Open Access | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
InfoTech2008.pdf | Published version | 229.3 kB | Adobe PDF | View/Open |
Page view(s)
8
checked on Sep 7, 2022
Download(s)
2
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.