{"id":"https://openalex.org/W2082353113","doi":"https://doi.org/10.1016/s0305-0548(03)00075-3","title":"An improved heuristic for the period traveling salesman problem","display_name":"An improved heuristic for the period traveling salesman problem","publication_year":2003,"publication_date":"2003-04-30","ids":{"openalex":"https://openalex.org/W2082353113","doi":"https://doi.org/10.1016/s0305-0548(03)00075-3","mag":"2082353113"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(03)00075-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00075-3","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","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/A5015988643","display_name":"Luca Bertazzi","orcid":"https://orcid.org/0000-0002-0227-9135"},"institutions":[{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Bertazzi","raw_affiliation_strings":["Dipartimento di Metodi Quantitativi, Universit\u00e0 di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Metodi Quantitativi, Universit\u00e0 di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy","institution_ids":["https://openalex.org/I79940851"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063921491","display_name":"Giuseppe Paletta","orcid":"https://orcid.org/0000-0001-8446-781X"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Paletta","raw_affiliation_strings":["Dipartimento di Economia Politica, Universit\u00e0 della Calabria, Arcavacata di Rende (Cs) 87036, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Economia Politica, Universit\u00e0 della Calabria, Arcavacata di Rende (Cs) 87036, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035146046","display_name":"M. Grazia Speranza","orcid":"https://orcid.org/0000-0002-8893-5227"},"institutions":[{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"M.Grazia Speranza","raw_affiliation_strings":["Dipartimento di Metodi Quantitativi, Universit\u00e0 di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Metodi Quantitativi, Universit\u00e0 di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy","institution_ids":["https://openalex.org/I79940851"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035146046"],"corresponding_institution_ids":["https://openalex.org/I79940851"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":2.3278,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.88339949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"8","first_page":"1215","last_page":"1222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9970999956130981,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9921000003814697,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8972458839416504},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7386407256126404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6246774792671204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49214571714401245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4710022509098053},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.45544907450675964},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4163152575492859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3787727653980255}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8972458839416504},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7386407256126404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6246774792671204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49214571714401245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4710022509098053},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.45544907450675964},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4163152575492859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3787727653980255}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0305-0548(03)00075-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00075-3","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:iris.unibs.it:11379/28416","is_oa":false,"landing_page_url":"http://hdl.handle.net/11379/28416","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1582842319","https://openalex.org/W1964375421","https://openalex.org/W1975828823","https://openalex.org/W1997853206","https://openalex.org/W2030910540","https://openalex.org/W2039682345","https://openalex.org/W2125009529","https://openalex.org/W2125613881","https://openalex.org/W2257704390","https://openalex.org/W2324108981","https://openalex.org/W6634891009"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W2946024655","https://openalex.org/W2171568915","https://openalex.org/W1966089951","https://openalex.org/W2766731260","https://openalex.org/W2191054341","https://openalex.org/W2170228269","https://openalex.org/W3136451934","https://openalex.org/W2975368677"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}