Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26350
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematics-
dc.creatorLee, HWJ-
dc.creatorAli, MM-
dc.creatorWong, KH-
dc.date.accessioned2015-06-23T09:13:54Z-
dc.date.available2015-06-23T09:13:54Z-
dc.identifier.issn1492-8760-
dc.identifier.urihttp://hdl.handle.net/10397/26350-
dc.language.isoenen_US
dc.publisherWatam Pressen_US
dc.subjectDiscrete valueden_US
dc.subjectGenetic algorithmen_US
dc.subjectGlobal optimizationen_US
dc.subjectOptimal controlen_US
dc.subjectSimulated annealingen_US
dc.titleGlobal optimization for a special class of discrete-valued optimal control problemsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage735-
dc.identifier.epage756-
dc.identifier.volume11-
dc.identifier.issue6-
dcterms.abstractA special class of optimal discrete-valued control problems is solved by two different global optimization techniques, namely, the Simulated Annealing algorithm (SA) and the Genetic algorithm (GA). Two numerical examples have been solved to examine the efficiency of each of these two methods.-
dcterms.bibliographicCitationDynamics of continuous, discrete & impulsive systems. Series B, Applications & algorithms, 2004, v. 11, no. 6, p. 735-756-
dcterms.isPartOfDynamics of continuous, discrete & impulsive systems. Series B, Applications & algorithms-
dcterms.issued2004-
dc.identifier.isiWOS:000229121100006-
dc.identifier.scopus2-s2.0-9944229009-
dc.identifier.eissn1918-2538-
dc.identifier.rosgroupidr20767-
dc.description.ros2004-2005 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Feb 1, 2020

WEB OF SCIENCETM
Citations

14
Last Week
0
Last month
0
Citations as of Oct 24, 2020

Page view(s)

106
Last Week
0
Last month
Citations as of Oct 27, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.