{"id":"https://openalex.org/W2059151316","doi":"https://doi.org/10.1145/1143997.1144274","title":"Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs","display_name":"Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2059151316","doi":"https://doi.org/10.1145/1143997.1144274","mag":"2059151316"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5103387228","display_name":"Rajeev Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Rajeev Kumar","raw_affiliation_strings":["Indian Institute of Technology, Kanpur, India","Indian Institute of Technology , Kanpur , India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Indian Institute of Technology , Kanpur , India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023471512","display_name":"Pramod Kumar Singh","orcid":"https://orcid.org/0000-0003-0019-1436"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P.K. Singh","raw_affiliation_strings":["Indian Institute of Technology, Kanpur, India","Indian Institute of Technology , Kanpur , India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Indian Institute of Technology , Kanpur , India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067730042","display_name":"Bhargab B. Bhattacharya","orcid":"https://orcid.org/0000-0002-5890-2483"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bhargab B. Bhattacharya","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103387228"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.337,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61538802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1689","last_page":"1696"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11798","display_name":"Optimal Experimental Design Methods","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7182851433753967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6068211197853088},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5691455602645874},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5362697243690491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5277621746063232},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.524178683757782},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4820905029773712},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4622390568256378},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43150395154953003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3961185812950134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18250972032546997}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7182851433753967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6068211197853088},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5691455602645874},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5362697243690491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5277621746063232},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.524178683757782},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4820905029773712},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4622390568256378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43150395154953003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3961185812950134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18250972032546997},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1143997.1144274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.1406","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p1689.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W4368930","https://openalex.org/W114403858","https://openalex.org/W114533130","https://openalex.org/W1479771599","https://openalex.org/W1502374754","https://openalex.org/W1504943474","https://openalex.org/W1521316934","https://openalex.org/W1595498733","https://openalex.org/W1597538628","https://openalex.org/W1617187171","https://openalex.org/W1751300721","https://openalex.org/W1978344479","https://openalex.org/W1985816708","https://openalex.org/W1987786682","https://openalex.org/W2013493321","https://openalex.org/W2019192303","https://openalex.org/W2030563429","https://openalex.org/W2034112563","https://openalex.org/W2069712919","https://openalex.org/W2074242067","https://openalex.org/W2086586141","https://openalex.org/W2098907614","https://openalex.org/W2104723386","https://openalex.org/W2118656253","https://openalex.org/W2125861228","https://openalex.org/W2127420314","https://openalex.org/W2128106741","https://openalex.org/W2142146559","https://openalex.org/W2155019998","https://openalex.org/W2161880126","https://openalex.org/W2166775052","https://openalex.org/W2241855467","https://openalex.org/W2334719410","https://openalex.org/W2506088122","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6635692906","https://openalex.org/W6636510425"],"related_works":["https://openalex.org/W2165127677","https://openalex.org/W2140318223","https://openalex.org/W2774921197","https://openalex.org/W2003480636","https://openalex.org/W1969057002","https://openalex.org/W3122566932","https://openalex.org/W2031409011","https://openalex.org/W4200388139","https://openalex.org/W2889491356","https://openalex.org/W3001422724"],"abstract_inverted_index":{"Wire":[0],"routing":[1],"in":[2,41,115,141],"a":[3,42,50,85,153,174],"VLSI":[4],"chip":[5],"often":[6],"requires":[7],"minimization":[8],"of":[9,16,68,72,96,101,148,155],"ire-length":[10],"as":[11,13],"well":[12],"the":[14,45,59,66,89,94,99,102,112,116,142,161,169,182],"number":[15,95],"intersections":[17,97],"among":[18,98],"multiple":[19,82],"nets.":[20],"Such":[21],"an":[22],"optimization":[23,132],"problem":[24,51,67],"is":[25,36,52,152],"computationally":[26],"hard":[27],"for":[28],"which":[29,119],"no":[30],"efficient":[31],"algorithm":[32],"or":[33],"good":[34],"heuristic":[35],"known":[37],"to":[38,48,53,77,87,110,137,160,181],"exist.":[39],"Additionally,":[40],"biobjective":[43],"setting,":[44],"major":[46],"challenge":[47],"solve":[49],"obtain":[54,111,138],"representative":[55],"diverse":[56,124,139],"solutions":[57,140],"across":[58],"(near-)":[60],"Pareto-front.In":[61],"this":[62,149],"work,":[63],"we":[64],"consider":[65],"constructing":[69],"spanning":[70,157],"trees":[71,158],"two":[73,78,103,156],"geometric":[74,163],"graphs":[75],"corresponding":[76,159],"nets,":[79],"each":[80],"with":[81,84],"terminals,":[83],"goal":[86],"minimize":[88],"total":[90],"edge":[91],"cost":[92],"and":[93,177],"edges":[100],"trees.":[104],"We":[105],"first":[106],"design":[107],"simple":[108],"heuristics":[109],"extreme":[113],"points":[114],"solution":[117,144,150],"space,":[118],"however,":[120],"could":[121],"not":[122],"produce":[123],"solutions.":[125],"Search":[126],"algorithms":[127,172],"based":[128],"on":[129],"evolutionary":[130,171],"multiobjective":[131],"(EMO)":[133],"are":[134,178],"then":[135],"proposed":[136,170],"feasible":[143],"space.":[145],"Each":[146],"element":[147],"set":[151],"tuple":[154],"given":[162],"graphs.":[164],"Empirical":[165],"evidence":[166],"shows":[167],"that":[168],"cover":[173],"larger":[175],"range":[176],"much":[179],"superior":[180],"heuristics.":[183]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}