{"id":"https://openalex.org/W1548169220","doi":"https://doi.org/10.1007/978-3-642-16397-5_10","title":"Ant Colony Algorithm for Multiple-Depot Vehicle Routing Problem with Shortest Finish Time","display_name":"Ant Colony Algorithm for Multiple-Depot Vehicle Routing Problem with Shortest Finish Time","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1548169220","doi":"https://doi.org/10.1007/978-3-642-16397-5_10","mag":"1548169220"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16397-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16397-5_10","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information 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/A5076582278","display_name":"Jianhua Ma","orcid":"https://orcid.org/0000-0001-5710-7018"},"institutions":[{"id":"https://openalex.org/I4210097214","display_name":"Shandong Management University","ror":"https://ror.org/00vzprm14","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210097214"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianhua Ma","raw_affiliation_strings":["Information Management School, Shandong Economic University, Jinan, 250014, China"],"affiliations":[{"raw_affiliation_string":"Information Management School, Shandong Economic University, Jinan, 250014, China","institution_ids":["https://openalex.org/I4210097214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088197540","display_name":"Jie Yuan","orcid":"https://orcid.org/0000-0002-2411-8789"},"institutions":[{"id":"https://openalex.org/I4210097214","display_name":"Shandong Management University","ror":"https://ror.org/00vzprm14","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210097214"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Yuan","raw_affiliation_strings":["Information Management School, Shandong Economic University, Jinan, 250014, China"],"affiliations":[{"raw_affiliation_string":"Information Management School, Shandong Economic University, Jinan, 250014, China","institution_ids":["https://openalex.org/I4210097214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076582278"],"corresponding_institution_ids":["https://openalex.org/I4210097214"],"apc_list":null,"apc_paid":null,"fwci":1.0568,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79869186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"114","last_page":"123"},"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.9945999979972839,"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.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/depot","display_name":"Depot","score":0.8863388299942017},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.810473620891571},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7824488878250122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.598473072052002},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5578758716583252},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.5285819172859192},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.47979241609573364},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4678531289100647},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3988037705421448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38279804587364197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3743528127670288},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.25372105836868286},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21904730796813965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1619265377521515},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08600059151649475},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07890602946281433}],"concepts":[{"id":"https://openalex.org/C2776561332","wikidata":"https://www.wikidata.org/wiki/Q5554853","display_name":"Depot","level":2,"score":0.8863388299942017},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.810473620891571},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7824488878250122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.598473072052002},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5578758716583252},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.5285819172859192},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.47979241609573364},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4678531289100647},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3988037705421448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38279804587364197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3743528127670288},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.25372105836868286},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21904730796813965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1619265377521515},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08600059151649475},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07890602946281433},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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-642-16397-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16397-5_10","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W317335566","https://openalex.org/W1601649239","https://openalex.org/W2085675653","https://openalex.org/W2111563176","https://openalex.org/W2146870367","https://openalex.org/W2368436638","https://openalex.org/W2384199743","https://openalex.org/W2387637774","https://openalex.org/W2809548225"],"related_works":["https://openalex.org/W2900746048","https://openalex.org/W3110294319","https://openalex.org/W2021436470","https://openalex.org/W2893875239","https://openalex.org/W1522546435","https://openalex.org/W1526675075","https://openalex.org/W2353880500","https://openalex.org/W4254412621","https://openalex.org/W2126736140","https://openalex.org/W2369165818"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}