{"id":"https://openalex.org/W38922916","doi":null,"title":"Navigation Using Hybrid Genetic Programming: Initial Conditions and State Transitions","display_name":"Navigation Using Hybrid Genetic Programming: Initial Conditions and State Transitions","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W38922916","mag":"38922916"},"language":"en","primary_location":{"id":"mag:38922916","doi":null,"is_oa":false,"landing_page_url":"http://www.hpl.hp.com/techreports/2003/HPL-2003-56.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W38922916"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022519243","display_name":"Steven J. Simske","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Steven J. Simske","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5022519243"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00800469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6675000190734863,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6675000190734863,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1860000044107437,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0997999981045723,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/real-time-navigation","display_name":"real-time navigation","score":0.777999997138977},{"id":"https://openalex.org/keywords/node-clustering","display_name":"node clustering","score":0.7289999723434448},{"id":"https://openalex.org/keywords/rule-based-systems","display_name":"rule-based systems","score":0.9089999794960022},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9089999794960022},{"id":"https://openalex.org/keywords/dynamic-routing","display_name":"dynamic routing","score":0.4320000112056732},{"id":"https://openalex.org/keywords/path-optimization","display_name":"path optimization","score":0.578000009059906},{"id":"https://openalex.org/keywords/initial-conditions","display_name":"initial conditions","score":0.5220000147819519}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7405168414115906},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6588994860649109},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6382477879524231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6337795257568359},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5905537009239197},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5244565010070801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5173391699790955},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.45847514271736145},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45362111926078796},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4456876218318939},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.4119527041912079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41049063205718994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26113492250442505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22117683291435242},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18444567918777466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1605096459388733},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14835301041603088},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:38922916","doi":null,"is_oa":false,"landing_page_url":"http://www.hpl.hp.com/techreports/2003/HPL-2003-56.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.246","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hpl.hp.com/techreports/2003/HPL-2003-56.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W36351923","https://openalex.org/W126329683","https://openalex.org/W1480442582","https://openalex.org/W1572593412","https://openalex.org/W1606791384","https://openalex.org/W1639032689","https://openalex.org/W1886554846","https://openalex.org/W2093319245","https://openalex.org/W2098433970","https://openalex.org/W2103593133","https://openalex.org/W2113725019","https://openalex.org/W2612800866","https://openalex.org/W2746814836","https://openalex.org/W2775872788","https://openalex.org/W2940857332","https://openalex.org/W2972323964","https://openalex.org/W3005744311","https://openalex.org/W3015614393","https://openalex.org/W3116196447","https://openalex.org/W3160112806","https://openalex.org/W3173472551","https://openalex.org/W4205987157","https://openalex.org/W4224234661"],"related_works":["https://openalex.org/W7098801283","https://openalex.org/W3024965025","https://openalex.org/W3042597530","https://openalex.org/W2575773132","https://openalex.org/W2115802736","https://openalex.org/W4238820382","https://openalex.org/W6991324939","https://openalex.org/W3029193618","https://openalex.org/W2321729575"],"abstract_inverted_index":{"genetic":[0,112],"algorithms,":[1],"navigation,":[2],"optimization":[3],"Real-time":[4],"navigation":[5],"requires":[6],"the":[7,37,62,85,95],"dynamic":[8,134],"updating":[9],"of":[10,31,72,88,97,131],"node-node":[11,76,106],"(state)":[12],"transition":[13,17,107,135],"costs.":[14,136],"These":[15],"state":[16],"costs":[18,77],"are":[19],"based":[20,33],"on,":[21],"among":[22],"other":[23,49],"things,":[24],"distance,":[25],"traffic":[26],"patterns,":[27],"and":[28,48,105],"intelligent":[29],"clustering":[30,100],"nodes":[32,132],"on":[34,94],"similarity":[35],"in":[36],"navigator\u2019s":[38],"intents":[39],"at":[40],"each":[41],"destination,":[42],"maximum":[43],"distance":[44],"preferred":[45],"between":[46],"nodes,":[47],"pragmatic":[50],"considerations.":[51],"Such":[52],"superimposed":[53],"conditions":[54,104],"require":[55],"a":[56,90,129],"hybrid":[57,91],"genetic/rule-based":[58],"system":[59],"to":[60,115,123],"accommodate":[61],"real-world":[63],"considerations":[64],"(rule-based)":[65],"as":[66,68],"well":[67],"providing":[69],"efficient":[70],"computation":[71],"minimized":[73],"overall":[74],"(summed)":[75],"(genetic":[78],"algorithm-based;":[79],"\u201ctraveling":[80],"salesman\u201d).":[81],"This":[82],"paper":[83],"introduces":[84],"important":[86],"elements":[87],"such":[89],"system,":[92],"focusing":[93],"use":[96],"rule-based":[98],"&":[99],"techniques":[101],"for":[102],"initial":[103],"costs,":[108],"while":[109],"showing":[110],"how":[111],"algorithms":[113],"akin":[114],"those":[116],"using":[117],"gene":[118],"linking":[119],"can":[120],"be":[121],"used":[122],"efficiently":[124],"compute":[125],"best":[126],"paths":[127],"through":[128],"set":[130],"with":[133]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W38922916","counts_by_year":[],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
