{"id":"https://openalex.org/W4294811611","doi":"https://doi.org/10.1109/cec55065.2022.9870405","title":"Optimization of real-world supply routes by nature-inspired metaheuristics","display_name":"Optimization of real-world supply routes by nature-inspired metaheuristics","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4294811611","doi":"https://doi.org/10.1109/cec55065.2022.9870405"},"language":"en","primary_location":{"id":"doi:10.1109/cec55065.2022.9870405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870405","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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/A5088934266","display_name":"Pavel Kr\u00f6mer","orcid":"https://orcid.org/0000-0001-8428-3332"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Pavel Kromer","raw_affiliation_strings":["VSB - Technical University of Ostrava,Department of Computer Science,Ostrava,Czech Republic","Department of Computer Science, VSB - Technical University of Ostrava, Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"VSB - Technical University of Ostrava,Department of Computer Science,Ostrava,Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science, VSB - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058105327","display_name":"Vojt\u011bch Uher","orcid":"https://orcid.org/0000-0002-7475-3625"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vojtech Uher","raw_affiliation_strings":["VSB - Technical University of Ostrava,Department of Computer Science,Ostrava,Czech Republic","Department of Computer Science, VSB - Technical University of Ostrava, Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"VSB - Technical University of Ostrava,Department of Computer Science,Ostrava,Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science, VSB - Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088934266"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":null,"apc_paid":null,"fwci":0.3468,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43000346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"338","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"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.996999979019165,"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.9817000031471252,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.965399980545044,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7024676203727722},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6522117853164673},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6324905157089233},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6168352961540222},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5970096588134766},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4647336006164551},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43966466188430786},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4297041893005371},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.374914288520813},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35874393582344055},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16198685765266418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13580164313316345},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.12952470779418945},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.12752965092658997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11417755484580994}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7024676203727722},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6522117853164673},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6324905157089233},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6168352961540222},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5970096588134766},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4647336006164551},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43966466188430786},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4297041893005371},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.374914288520813},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35874393582344055},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16198685765266418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13580164313316345},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.12952470779418945},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12752965092658997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11417755484580994},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec55065.2022.9870405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870405","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7900000214576721,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G1018858812","display_name":null,"funder_award_id":"SP2022/12,SP2022/77","funder_id":"https://openalex.org/F4320323872","funder_display_name":"Vysok\u00e1 \u0160kola B\u00e1nsk\u00e1 - Technick\u00e1 Univerzita Ostrava"}],"funders":[{"id":"https://openalex.org/F4320323872","display_name":"Vysok\u00e1 \u0160kola B\u00e1nsk\u00e1 - Technick\u00e1 Univerzita Ostrava","ror":"https://ror.org/05x8mcb75"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W1540874458","https://openalex.org/W1565746575","https://openalex.org/W1879678483","https://openalex.org/W1989186045","https://openalex.org/W2008656089","https://openalex.org/W2042253843","https://openalex.org/W2057035153","https://openalex.org/W2074989606","https://openalex.org/W2107941094","https://openalex.org/W2144051602","https://openalex.org/W2152195021","https://openalex.org/W2162145193","https://openalex.org/W2163428398","https://openalex.org/W2168079536","https://openalex.org/W2417927506","https://openalex.org/W2798741797","https://openalex.org/W2896002634","https://openalex.org/W2968169296","https://openalex.org/W3017317785","https://openalex.org/W3083059811","https://openalex.org/W3083328146","https://openalex.org/W3154292443","https://openalex.org/W4205193211"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W1547053391","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W1521781013","https://openalex.org/W2369428395","https://openalex.org/W2406404685"],"abstract_inverted_index":{"The":[0],"traveling":[1],"salesman":[2],"problem":[3,9,29],"(TSP)":[4],"is":[5],"an":[6],"iconic":[7],"permutation":[8],"with":[10,114],"a":[11,27,37],"number":[12],"of":[13,36,39,47,64,82,88],"applications":[14,67],"in":[15,84],"planning,":[16],"scheduling,":[17],"and":[18,58,105],"logistics.":[19],"It":[20],"has":[21],"also":[22],"attracted":[23],"much":[24],"attention":[25],"as":[26,51],"benchmarking":[28],"frequently":[30],"used":[31],"to":[32],"assess":[33],"the":[34,44,52,62,89,95,99,107,111],"properties":[35],"variety":[38],"nature-inspired":[40,103],"optimization":[41],"methods.":[42],"However,":[43],"standard":[45,118],"libraries":[46],"TSP":[48,77],"instances,":[49],"such":[50],"TSPLIB,":[53],"are":[54],"often":[55],"decades":[56],"old":[57],"might":[59],"not":[60],"reflect":[61],"requirements":[63],"modern":[65],"real-world":[66,80,112],"very":[68],"well.":[69],"In":[70],"this":[71],"work,":[72],"we":[73],"introduce":[74],"several":[75,85],"novel":[76],"instances":[78,113],"representing":[79],"locations":[81],"pharmacies":[83,100],"major":[86],"cities":[87],"Czech":[90],"Republic.":[91],"We":[92],"look":[93],"for":[94],"optimum":[96],"routes":[97],"between":[98],"by":[101],"selected":[102],"algorithms":[104],"compare":[106],"results":[108,116],"obtained":[109],"on":[110,117],"their":[115],"TSPLIB":[119],"instances.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}