{"id":"https://openalex.org/W2039337830","doi":"https://doi.org/10.5220/0005043202690274","title":"Hierarchical Optimization Using Hierarchical Multi-competitive Genetic Algorithm and its Application to Multiple Vehicle Routing Problem","display_name":"Hierarchical Optimization Using Hierarchical Multi-competitive Genetic Algorithm and its Application to Multiple Vehicle Routing Problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2039337830","doi":"https://doi.org/10.5220/0005043202690274","mag":"2039337830"},"language":"en","primary_location":{"id":"doi:10.5220/0005043202690274","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005043202690274","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Signal Processing and Multimedia Applications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005043202690274","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101001478","display_name":"Shudai Ishikawa","orcid":null},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shudai Ishikawa","raw_affiliation_strings":["Kyushu Institute of Technology, Japan","Kyushu Institute of Technology, Kitakyushu, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology, Japan","institution_ids":["https://openalex.org/I207014233"]},{"raw_affiliation_string":"Kyushu Institute of Technology, Kitakyushu, Japan#TAB#","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110601345","display_name":"Ryosuke Kubota","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094110","display_name":"National Institute of Technology, Ube College","ror":"https://ror.org/00pjwdc92","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210094110","https://openalex.org/I4210120810"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryosuke Kubota","raw_affiliation_strings":["Ube National College of Technology, Japan"],"affiliations":[{"raw_affiliation_string":"Ube National College of Technology, Japan","institution_ids":["https://openalex.org/I4210094110"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109846856","display_name":"Keiichi Horio","orcid":null},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keiichi Horio","raw_affiliation_strings":["Kyushu Institute of Technology, Japan","Kyushu Institute of Technology, Kitakyushu, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology, Japan","institution_ids":["https://openalex.org/I207014233"]},{"raw_affiliation_string":"Kyushu Institute of Technology, Kitakyushu, Japan#TAB#","institution_ids":["https://openalex.org/I207014233"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101001478"],"corresponding_institution_ids":["https://openalex.org/I207014233"],"apc_list":null,"apc_paid":null,"fwci":1.18904867,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.83070573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"269","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6826733350753784},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6304783225059509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5968809127807617},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5551087856292725},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5545865893363953},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.506928026676178},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4858993887901306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46580320596694946},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4513496458530426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.302979052066803}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6826733350753784},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6304783225059509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5968809127807617},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5551087856292725},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5545865893363953},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.506928026676178},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4858993887901306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46580320596694946},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4513496458530426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.302979052066803},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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.5220/0005043202690274","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005043202690274","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Signal Processing and Multimedia Applications","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005043202690274","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005043202690274","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Signal Processing and Multimedia Applications","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1485961250","https://openalex.org/W1507906417","https://openalex.org/W1540874458","https://openalex.org/W1589975099","https://openalex.org/W1994863634","https://openalex.org/W2002592134","https://openalex.org/W2029681015","https://openalex.org/W2408320523"],"related_works":["https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2370289839","https://openalex.org/W2082716031","https://openalex.org/W2933494595","https://openalex.org/W4313347705","https://openalex.org/W1568049691","https://openalex.org/W1590096425","https://openalex.org/W2890485617"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"a":[3,54],"new":[4],"optimization":[5,12],"technique":[6,17],"which":[7],"is":[8,14,18,43,58,71],"effective":[9],"for":[10],"hierarchical":[11,88],"problem":[13],"proposed.":[15],"This":[16,28],"an":[19],"extension":[20],"of":[21,31,66,102],"the":[22,46,50,61,67,74,86,91,95,100,103],"multiple-competitive":[23],"distributed":[24],"genetic":[25],"algorithm":[26],"(mcDGA).":[27],"method":[29],"consists":[30],"two":[32],"levels":[33],"upper":[34,47],"and":[35,49,69],"lower.":[36],"The":[37,64],"solution":[38,52,56,79],"space":[39,57],"to":[40,90,93],"be":[41,81],"searched":[42],"determined":[44,59],"at":[45,60,73],"level,":[48],"optimum":[51],"in":[53],"given":[55],"lower":[62,75],"level.":[63],"migration":[65],"individual":[68],"competition":[70],"performed":[72],"layer":[76],"thereby":[77],"optimal":[78],"can":[80],"found":[82],"efficiently.":[83],"We":[84],"apply":[85],"proposed":[87,104],"mcDGA":[89],"mVRP":[92],"confirm":[94],"effectiveness.":[96],"Simulation":[97],"result":[98],"shows":[99],"effectiveness":[101],"method.":[105]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}