{"id":"https://openalex.org/W2398782820","doi":"https://doi.org/10.29007/8tjs","title":"Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems","display_name":"Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2398782820","doi":"https://doi.org/10.29007/8tjs","mag":"2398782820"},"language":"en","primary_location":{"id":"doi:10.29007/8tjs","is_oa":true,"landing_page_url":"https://doi.org/10.29007/8tjs","pdf_url":"https://easychair.org/publications/open/FvV","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/FvV","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101519387","display_name":"Zhengmao Ye","orcid":"https://orcid.org/0000-0001-8897-574X"},"institutions":[{"id":"https://openalex.org/I145610796","display_name":"Southern University and Agricultural and Mechanical College","ror":"https://ror.org/04r3m2882","country_code":"US","type":"education","lineage":["https://openalex.org/I145610796"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhengmao Ye","raw_affiliation_strings":["College of Engineering, Southern University, Baton Rouge, LA 70813, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering, Southern University, Baton Rouge, LA 70813, USA","institution_ids":["https://openalex.org/I145610796"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038916499","display_name":"Habib Mohamadian","orcid":null},"institutions":[{"id":"https://openalex.org/I145610796","display_name":"Southern University and Agricultural and Mechanical College","ror":"https://ror.org/04r3m2882","country_code":"US","type":"education","lineage":["https://openalex.org/I145610796"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Habib Mohamadian","raw_affiliation_strings":["College of Engineering, Southern University, Baton Rouge, LA 70813, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering, Southern University, Baton Rouge, LA 70813, USA","institution_ids":["https://openalex.org/I145610796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145610796"],"apc_list":null,"apc_paid":null,"fwci":0.7573,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7671318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":null,"first_page":"43","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.995199978351593,"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.995199978351593,"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.9850999712944031,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9667999744415283,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8178858757019043},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6519213914871216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6134620308876038},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5988500118255615},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5478966236114502},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3823101222515106},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3212025463581085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10924139618873596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.0751485824584961}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8178858757019043},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6519213914871216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6134620308876038},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5988500118255615},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5478966236114502},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3823101222515106},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3212025463581085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10924139618873596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0751485824584961}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/8tjs","is_oa":true,"landing_page_url":"https://doi.org/10.29007/8tjs","pdf_url":"https://easychair.org/publications/open/FvV","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/8tjs","is_oa":true,"landing_page_url":"https://doi.org/10.29007/8tjs","pdf_url":"https://easychair.org/publications/open/FvV","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6899999976158142,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2398782820.pdf","grobid_xml":"https://content.openalex.org/works/W2398782820.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1526455201","https://openalex.org/W1967395904","https://openalex.org/W1983511967","https://openalex.org/W2004109780","https://openalex.org/W2004488827","https://openalex.org/W2013410920","https://openalex.org/W2019339947","https://openalex.org/W2019956049","https://openalex.org/W2056678525","https://openalex.org/W2082878954","https://openalex.org/W2101706868","https://openalex.org/W2115412161","https://openalex.org/W2155293443","https://openalex.org/W2798534591","https://openalex.org/W6722086367"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2017411971","https://openalex.org/W2172069777","https://openalex.org/W2956620057","https://openalex.org/W2384341213","https://openalex.org/W2393811661","https://openalex.org/W2362152818"],"abstract_inverted_index":{"The":[0,41,126,156,202],"multiple":[1,20,127],"trip":[2,220],"vehicle":[3,15,30,49,58,83,123,196,211],"routing":[4,84,124,162,212],"problem":[5,85,198],"involves":[6],"several":[7],"sequences":[8],"of":[9,13,210,227],"routes.":[10,155],"Working":[11],"shift":[12],"single":[14,216],"can":[16,191],"be":[17,51,60,174,192],"scheduled":[18],"in":[19,62,99,106],"trips.":[21],"It":[22,190],"is":[23,73,93,131,158,205],"suitable":[24],"for":[25,88,135],"urban":[26],"areas":[27],"where":[28],"the":[29,48,57,68,82,89,103,122,139,180,195,228],"has":[31,117],"very":[32],"limited":[33],"size":[34,42],"and":[35,43,111,141,172,218,225],"capacity":[36,44,200],"over":[37],"short":[38],"travel":[39],"distances.":[40],"limit":[45],"also":[46],"requires":[47],"should":[50],"vacated":[52],"frequently.":[53],"As":[54,179],"a":[55,95,215],"result,":[56],"could":[59],"used":[61],"different":[63],"trips":[64],"as":[65,67,144,164,194],"long":[66],"total":[69],"time":[70,110],"or":[71,108],"distance":[72],"not":[74],"exceeded.":[75],"Various":[76],"approaches":[77],"are":[78],"developed":[79],"to":[80,101,120,133,145,159,165,173,176,207],"solve":[81,121],"(VRP).":[86],"Except":[87],"simplest":[90],"cases,":[91],"VRP":[92],"always":[94],"computationally":[96],"complex":[97],"issue":[98],"order":[100],"optimize":[102],"objective":[104,157],"function":[105],"terms":[107],"both":[109],"expense.":[112],"Ant":[113],"colony":[114,129],"optimization":[115],"(ACO)":[116],"been":[118],"introduced":[119],"problem.":[125],"ant":[128],"system":[130],"proposed":[132,203],"search":[134],"alternative":[136],"trails":[137],"between":[138],"source":[140],"destination":[142],"so":[143,163],"minimize":[146],"(fuel":[147],"consumption,":[148],"distance,":[149],"time)":[150],"among":[151,168],"numerous":[152],"geographically":[153],"scattered":[154],"design":[160],"adaptive":[161],"balance":[166],"loads":[167],"congesting":[169],"city":[170],"networks":[171],"adaptable":[175],"connection":[177],"failures.":[178],"route":[181,185],"number":[182],"increases,":[183],"each":[184],"becomes":[186],"less":[187],"densely":[188],"packed.":[189],"viewed":[193],"scheduling":[197],"with":[199,214],"constraints.":[201],"scheme":[204],"applied":[206],"typical":[208],"cases":[209],"problems":[213],"depot":[217],"flexible":[219],"numbers.":[221],"Results":[222],"show":[223],"feasibility":[224],"effectiveness":[226],"approach.":[229]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}