{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:34:25Z","timestamp":1769268865922,"version":"3.49.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1109\/icsmc.2010.5641920","type":"proceedings-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T16:35:53Z","timestamp":1291134953000},"page":"2539-2544","source":"Crossref","is-referenced-by-count":8,"title":["A study of genetic algorithms for approximating the longest path in generic graphs"],"prefix":"10.1109","author":[{"given":"David","family":"Portugal","sequence":"first","affiliation":[{"name":"Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"}]},{"given":"Carlos Henggeler","family":"Antunes","sequence":"additional","affiliation":[{"name":"INESC Coimbra, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"}]},{"given":"Rui","family":"Rocha","sequence":"additional","affiliation":[{"name":"Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_35"},{"key":"ref11","first-page":"530","article-title":"Finding The Longest Simple Path in Cyclic Combinational Circuits","author":"hsu","year":"0","journal-title":"IEEE Int Conf Computer-Design"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062799"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653814"},{"key":"ref14","first-page":"47","article-title":"Comparison of Genetic Algorithm and Simulated Annealing Technique for Optimal Path Selection In Network Routing","author":"nair","year":"2009","journal-title":"Proceedings of the National Conference on VLSI and Networks (NCVN-09"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.873213"},{"key":"ref16","first-page":"463","article-title":"Intelligent Transport Route Planning Using Genetic Algorithms in Path Computation Algorithms","volume":"25","author":"kumar","year":"2009","journal-title":"European Journal of Scientific Research"},{"key":"ref17","first-page":"5\/1","article-title":"Generation of collision-free paths, a genetic approach","author":"solano","year":"1993","journal-title":"Proc IEE Colloquium on Genetic Algorithms for Control and Syst Eng"},{"key":"ref18","first-page":"42","article-title":"Path Planning and Trajectory Control of Collaborative Mobile Robots Using Hybrid Control Architecture","volume":"6","author":"davies","year":"2008","journal-title":"Journal of Systemics Cybernetics and Informatics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/109025.109102"},{"key":"ref4","first-page":"239","article-title":"How to find long paths efficiently","volume":"25","author":"monien","year":"1985","journal-title":"Annals of Discrete Mathematics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774360"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51542-9_48"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/106652704773416885"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.01.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007418"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523689"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_74"},{"key":"ref20","author":"scheinerman","year":"0","journal-title":"Matgraph A Matlab Toolbox for Graph Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"}],"event":{"name":"2010 IEEE International Conference on Systems, Man and Cybernetics - SMC","location":"Istanbul, Turkey","start":{"date-parts":[[2010,10,10]]},"end":{"date-parts":[[2010,10,13]]}},"container-title":["2010 IEEE International Conference on Systems, Man and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5629466\/5641665\/05641920.pdf?arnumber=5641920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:23:07Z","timestamp":1756318987000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5641920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2010.5641920","relation":{},"subject":[],"published":{"date-parts":[[2010,10]]}}}