{"id":"https://openalex.org/W1963583020","doi":"https://doi.org/10.1145/1947940.1948036","title":"Improvement of bounded-diameter MST instances with hybridization of multi-objective EA","display_name":"Improvement of bounded-diameter MST instances with hybridization of multi-objective EA","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1963583020","doi":"https://doi.org/10.1145/1947940.1948036","mag":"1963583020"},"language":"en","primary_location":{"id":"doi:10.1145/1947940.1948036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1947940.1948036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 International Conference on Communication, Computing & Security - ICCCS '11","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/A5023704176","display_name":"Soma Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Soma Saha","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India","Indian Inst. of Technology Kharagpur, Kharagpur West Bengal India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Indian Inst. of Technology Kharagpur, Kharagpur West Bengal India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103387228","display_name":"Rajeev Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajeev Kumar","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India","Indian Inst. of Technology Kharagpur, Kharagpur West Bengal India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Indian Inst. of Technology Kharagpur, Kharagpur West Bengal India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023704176"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.3138,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56158296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"468","last_page":"468"},"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.9991999864578247,"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.9991999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9941999912261963,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9898999929428101,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7702677249908447},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7146480679512024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6741745471954346},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6727032661437988},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5922778844833374},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5897881388664246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5089168548583984},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5074674487113953},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4919385612010956},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47915998101234436},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4206463098526001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40023624897003174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3186085820198059},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07980838418006897},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.07744169235229492}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7702677249908447},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7146480679512024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6741745471954346},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6727032661437988},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5922778844833374},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5897881388664246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5089168548583984},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5074674487113953},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4919385612010956},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47915998101234436},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4206463098526001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40023624897003174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3186085820198059},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07980838418006897},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.07744169235229492},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1947940.1948036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1947940.1948036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 International Conference on Communication, Computing & Security - ICCCS '11","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W69139308","https://openalex.org/W1510935138","https://openalex.org/W1523604403","https://openalex.org/W1665846492","https://openalex.org/W1968026564","https://openalex.org/W1970231897","https://openalex.org/W1983511657","https://openalex.org/W2011039300","https://openalex.org/W2024315858","https://openalex.org/W2053900989","https://openalex.org/W2066124178","https://openalex.org/W2078614936","https://openalex.org/W2082629204","https://openalex.org/W2083059844","https://openalex.org/W2086586141","https://openalex.org/W2115831664","https://openalex.org/W2126105956","https://openalex.org/W2140606557","https://openalex.org/W2159991628","https://openalex.org/W2166775052"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"The":[0],"Bounded":[1],"Diameter":[2,4],"(a.k.a":[3],"Constraint)":[5],"Minimum":[6,34],"Spanning":[7,35],"Tree":[8,36],"(BDMST/DCMST)":[9],"is":[10,50],"a":[11,21,32,71],"well-known":[12,23],"combinatorial":[13],"optimization":[14],"problem.":[15],"In":[16],"this":[17],"work,":[18],"we":[19],"recast":[20],"few":[22],"heuristics,":[24],"which":[25,84],"are":[26],"evolved":[27],"for":[28,82,90],"BDMST":[29,91],"problem,":[30],"to":[31,77],"Bi-Objective":[33],"(BO-MST)":[37],"problem":[38],"and":[39],"then":[40],"obtain":[41],"Pareto":[42,47,80,100,111],"fronts.":[43],"On":[44],"visualizing":[45],"the":[46,55,58,62,66,79,96,104,108],"fronts,":[48],"it":[49],"observed":[51],"that":[52,95],"none":[53],"of":[54,65,107],"heuristics":[56],"provides":[57,87,98],"best":[59],"solution":[60,89],"across":[61,103],"complete":[63,105],"range":[64,106],"diameter.":[67],"We":[68,93],"have":[69],"used":[70],"Multi-Objective":[72],"Evolutionary":[73],"Algorithm":[74],"(MOEA)":[75],"approach":[76],"improve":[78],"front":[81,101,112],"BOMST,":[83],"in":[85],"turn":[86],"better":[88],"instances.":[92],"observe":[94],"MOEA":[97],"improved":[99],"solutions":[102,113],"diameter":[109],"over":[110],"generated":[114],"from":[115],"individual":[116],"heuristics.":[117]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}