{"id":"https://openalex.org/W2791102720","doi":"https://doi.org/10.1007/978-3-319-76348-4_75","title":"An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand","display_name":"An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2791102720","doi":"https://doi.org/10.1007/978-3-319-76348-4_75","mag":"2791102720"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-76348-4_75","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-76348-4_75","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","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/A5030567361","display_name":"Jonatas B. C. Chagas","orcid":"https://orcid.org/0000-0001-7965-8419"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jonatas B. C. Chagas","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, Universidade Federal de Ouro Preto, Ouro Preto, Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, Universidade Federal de Ouro Preto, Ouro Preto, Brazil","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086393146","display_name":"Andr\u00e9 Gustavo dos Santos","orcid":"https://orcid.org/0000-0002-5743-3523"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 G. Santos","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030567361"],"corresponding_institution_ids":["https://openalex.org/I10824318"],"apc_list":null,"apc_paid":null,"fwci":1.6972,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.84742181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"785","last_page":"796"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.998199999332428,"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7803595662117004},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.7170087695121765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7149354219436646},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6586101055145264},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6467206478118896},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6060062646865845},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6016187071800232},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5708764791488647},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.536287784576416},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43653711676597595},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.4125370979309082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3582316040992737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1453682780265808},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1093064546585083},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0765954852104187}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7803595662117004},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.7170087695121765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7149354219436646},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6586101055145264},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6467206478118896},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6060062646865845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6016187071800232},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5708764791488647},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.536287784576416},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43653711676597595},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.4125370979309082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3582316040992737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1453682780265808},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1093064546585083},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0765954852104187},{"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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-76348-4_75","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-76348-4_75","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322980","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","ror":"https://ror.org/00nc55f03"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2020737022","https://openalex.org/W2024060531","https://openalex.org/W2141119792","https://openalex.org/W2216725884","https://openalex.org/W2427648012","https://openalex.org/W2563976220","https://openalex.org/W2590186741"],"related_works":["https://openalex.org/W2741596907","https://openalex.org/W4248894450","https://openalex.org/W3117281083","https://openalex.org/W4293253022","https://openalex.org/W2183192769","https://openalex.org/W2048314949","https://openalex.org/W3204694157","https://openalex.org/W2403875102","https://openalex.org/W2148102208","https://openalex.org/W2912883510"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}