{"id":"https://openalex.org/W2171452091","doi":"https://doi.org/10.1109/nabic.2009.5393689","title":"Tabu search metaheuristic embedded in adaptative memory procedure for the Profitable Arc Tour Problem","display_name":"Tabu search metaheuristic embedded in adaptative memory procedure for the Profitable Arc Tour Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2171452091","doi":"https://doi.org/10.1109/nabic.2009.5393689","mag":"2171452091"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2009.5393689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5057544888","display_name":"Jalel Euchi","orcid":"https://orcid.org/0000-0001-6873-5060"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jalel Euchi","raw_affiliation_strings":["Quantitative Methods Faculty of Economic and Management, GIAD Laboratory, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quantitative Methods Faculty of Economic and Management, GIAD Laboratory, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045242549","display_name":"Habib Chabchoub","orcid":"https://orcid.org/0000-0002-1101-2360"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Habib Chabchoub","raw_affiliation_strings":["Faculty of Economic and Management, GIAD Laboratory, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Economic and Management, GIAD Laboratory, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8877,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85599687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"34","issue":null,"first_page":"204","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9900000095367432,"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/tabu-search","display_name":"Tabu search","score":0.9345987439155579},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6852587461471558},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6605424284934998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6351660490036011},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.546514093875885},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.541122317314148},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5236149430274963},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49977850914001465},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.47991451621055603},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4372679591178894},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.42811036109924316},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.4234470725059509},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.412278950214386},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.29528313875198364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2833905816078186},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.27887701988220215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2317836582660675},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17604437470436096},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.07741302251815796}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9345987439155579},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6852587461471558},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6605424284934998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6351660490036011},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.546514093875885},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.541122317314148},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5236149430274963},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49977850914001465},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.47991451621055603},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4372679591178894},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.42811036109924316},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.4234470725059509},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.412278950214386},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29528313875198364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2833905816078186},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.27887701988220215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2317836582660675},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17604437470436096},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.07741302251815796},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2009.5393689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1937463903","https://openalex.org/W1963938442","https://openalex.org/W1964959815","https://openalex.org/W1965603691","https://openalex.org/W1967547901","https://openalex.org/W1968594877","https://openalex.org/W1969579058","https://openalex.org/W1980201624","https://openalex.org/W1985290529","https://openalex.org/W1986056047","https://openalex.org/W1991149726","https://openalex.org/W1997403587","https://openalex.org/W1999883971","https://openalex.org/W2013876915","https://openalex.org/W2027564756","https://openalex.org/W2029341065","https://openalex.org/W2029681015","https://openalex.org/W2050819731","https://openalex.org/W2069600231","https://openalex.org/W2101467383","https://openalex.org/W2108536179","https://openalex.org/W2111174053","https://openalex.org/W2117466569","https://openalex.org/W2146822189","https://openalex.org/W2148673189","https://openalex.org/W2162508334","https://openalex.org/W2164855953","https://openalex.org/W6649647540"],"related_works":["https://openalex.org/W2064998473","https://openalex.org/W2382386498","https://openalex.org/W7224036","https://openalex.org/W2566005704","https://openalex.org/W3022707108","https://openalex.org/W2494989913","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2168643831","https://openalex.org/W2075514833"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,25,35,47],"tabu":[6],"search":[7],"heuristic":[8],"embedded":[9],"in":[10,33,51,67,93],"adaptative":[11],"memory":[12],"procedure":[13],"to":[14,45,71],"solve":[15],"the":[16,28,52,58,74],"Profitable":[17],"Arc":[18],"Tour":[19],"Problem":[20,32],"(PATP).":[21],"The":[22,42],"PATP":[23],"is":[24,44,66,80],"variant":[26],"of":[27,37,49,54,60,76,96],"well-known":[29],"Vehicle":[30],"Routing":[31],"which":[34,65],"set":[36,48],"vehicle":[38,55],"tours":[39,53],"are":[40],"constructed.":[41],"objective":[43],"find":[46],"cycles":[50,77],"that":[56,78,87],"maximize":[57],"collection":[59],"profits":[61],"minus":[62],"travel":[63],"costs,":[64],"its":[68],"turn":[69],"subject":[70],"constraints":[72],"limiting":[73],"length":[75],"profit":[79],"available":[81],"on":[82],"arcs..":[83],"Computational":[84],"experiments":[85],"show":[86],"our":[88],"algorithm":[89],"provides":[90],"better":[91],"solutions":[92],"terms":[94],"quality":[95],"solution":[97],"and":[98],"completion":[99],"processing":[100],"times.":[101]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}