{"id":"https://openalex.org/W1196487533","doi":"https://doi.org/10.1007/978-3-319-21407-8_34","title":"Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints","display_name":"Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1196487533","doi":"https://doi.org/10.1007/978-3-319-21407-8_34","mag":"1196487533"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-21407-8_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-21407-8_34","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5060690100","display_name":"Telmo Pinto","orcid":"https://orcid.org/0000-0003-1087-7941"},"institutions":[{"id":"https://openalex.org/I99682543","display_name":"University of Minho","ror":"https://ror.org/037wpkx04","country_code":"PT","type":"education","lineage":["https://openalex.org/I99682543"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Telmo Pinto","raw_affiliation_strings":["Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal","institution_ids":["https://openalex.org/I99682543"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005896430","display_name":"Cl\u00e1udio Alves","orcid":"https://orcid.org/0000-0002-4017-1184"},"institutions":[{"id":"https://openalex.org/I99682543","display_name":"University of Minho","ror":"https://ror.org/037wpkx04","country_code":"PT","type":"education","lineage":["https://openalex.org/I99682543"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Cl\u00e1udio Alves","raw_affiliation_strings":["Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal","institution_ids":["https://openalex.org/I99682543"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002599858","display_name":"Jos\u00e9 Val\u00e9rio de Carvalho","orcid":"https://orcid.org/0000-0002-5566-845X"},"institutions":[{"id":"https://openalex.org/I99682543","display_name":"University of Minho","ror":"https://ror.org/037wpkx04","country_code":"PT","type":"education","lineage":["https://openalex.org/I99682543"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Val\u00e9rio de Carvalho","raw_affiliation_strings":["Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro Algoritmi, Escola de Engenharia, Universidade do Minho, 4710-057, Braga, Portugal","institution_ids":["https://openalex.org/I99682543"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060690100"],"corresponding_institution_ids":["https://openalex.org/I99682543"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.1619,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.94689441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"474","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7553325891494751},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7192478775978088},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.665459156036377},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.6565860509872437},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5881366729736328},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.584259569644928},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5765293836593628},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5538427829742432},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5007240772247314},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47436603903770447},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.46890273690223694},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40176552534103394},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3878759741783142},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27791255712509155},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.2629750967025757},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23746970295906067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23263466358184814}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7553325891494751},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7192478775978088},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665459156036377},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.6565860509872437},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5881366729736328},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.584259569644928},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5765293836593628},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5538427829742432},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5007240772247314},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47436603903770447},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.46890273690223694},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40176552534103394},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3878759741783142},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27791255712509155},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2629750967025757},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23746970295906067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23263466358184814},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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":3,"locations":[{"id":"doi:10.1007/978-3-319-21407-8_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-21407-8_34","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:repositorium.sdum.uminho.pt:1822/53144","is_oa":false,"landing_page_url":"http://hdl.handle.net/1822/53144","pdf_url":null,"source":{"id":"https://openalex.org/S4306400354","display_name":"Reposit\u00f3riUM (Universidade do Minho)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99682543","host_organization_name":"University of Minho","host_organization_lineage":["https://openalex.org/I99682543"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"},{"id":"pmh:oai:repositorium.uminho.pt:1822/53144","is_oa":false,"landing_page_url":"https://hdl.handle.net/1822/53144","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1543377438","https://openalex.org/W1986254541","https://openalex.org/W1996966568","https://openalex.org/W2010334716","https://openalex.org/W2029341065","https://openalex.org/W2050841472","https://openalex.org/W2099391941","https://openalex.org/W2112147420","https://openalex.org/W2139148132","https://openalex.org/W2169921235","https://openalex.org/W2223853737","https://openalex.org/W2512422858","https://openalex.org/W2749062520"],"related_works":["https://openalex.org/W2388573368","https://openalex.org/W2135709899","https://openalex.org/W1985012061","https://openalex.org/W2029570945","https://openalex.org/W2164934014","https://openalex.org/W1977897522","https://openalex.org/W2167861360","https://openalex.org/W2886794128","https://openalex.org/W2148549331","https://openalex.org/W2736751709"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}