{"id":"https://openalex.org/W2032431794","doi":"https://doi.org/10.1016/0167-6377(94)90065-5","title":"A new adaptive multi-start technique for combinatorial global optimizations","display_name":"A new adaptive multi-start technique for combinatorial global optimizations","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W2032431794","doi":"https://doi.org/10.1016/0167-6377(94)90065-5","mag":"2032431794"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(94)90065-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(94)90065-5","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-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/A5064315831","display_name":"Kenneth D. Boese","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth D. Boese","raw_affiliation_strings":["UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA"],"affiliations":[{"raw_affiliation_string":"UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073558386","display_name":"Andrew B. Kahng","orcid":"https://orcid.org/0000-0002-4490-5018"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew B. Kahng","raw_affiliation_strings":["UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA"],"affiliations":[{"raw_affiliation_string":"UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050535285","display_name":"S. Muddu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudhakar Muddu","raw_affiliation_strings":["UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA"],"affiliations":[{"raw_affiliation_string":"UCLA Computer Science Department, Los Angeles, CA 90024-1596, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073558386"],"corresponding_institution_ids":[],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":6.7801,"has_fulltext":false,"cited_by_count":354,"citation_normalized_percentile":{"value":0.96743424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"16","issue":"2","first_page":"101","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.998199999332428,"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.998199999332428,"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.9966999888420105,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.9102528095245361},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8219550848007202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6325271129608154},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5884861946105957},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5399217009544373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5371072888374329},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5336492657661438},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.5167098045349121},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.49325841665267944},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.44015079736709595},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4383416175842285},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4215690493583679},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41676002740859985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3704942762851715},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35204339027404785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2642385959625244}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.9102528095245361},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8219550848007202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6325271129608154},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5884861946105957},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5399217009544373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5371072888374329},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5336492657661438},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5167098045349121},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.49325841665267944},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.44015079736709595},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4383416175842285},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4215690493583679},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41676002740859985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3704942762851715},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35204339027404785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2642385959625244},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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.1016/0167-6377(94)90065-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(94)90065-5","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W110560563","https://openalex.org/W592446282","https://openalex.org/W1507599800","https://openalex.org/W1517590633","https://openalex.org/W1546457065","https://openalex.org/W1564953322","https://openalex.org/W1905425803","https://openalex.org/W1964440694","https://openalex.org/W1969857637","https://openalex.org/W1978866944","https://openalex.org/W1988625344","https://openalex.org/W1991318915","https://openalex.org/W2024060531","https://openalex.org/W2039906176","https://openalex.org/W2047820376","https://openalex.org/W2051682049","https://openalex.org/W2073850430","https://openalex.org/W2089500395","https://openalex.org/W2092705424","https://openalex.org/W2102076751","https://openalex.org/W2102521203","https://openalex.org/W2126641717","https://openalex.org/W2128193809","https://openalex.org/W2156698647","https://openalex.org/W2170675987","https://openalex.org/W2324108981","https://openalex.org/W2504494713","https://openalex.org/W2572756133","https://openalex.org/W2905110430","https://openalex.org/W6604581964","https://openalex.org/W6632882950","https://openalex.org/W6639918947","https://openalex.org/W6675106601"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2946024655","https://openalex.org/W2758988501","https://openalex.org/W4246557197","https://openalex.org/W3013791021","https://openalex.org/W2146364482","https://openalex.org/W1604040598","https://openalex.org/W2075572857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}