Yayın:
A New Solution Approach To Multi-Depot Vehicle Routing Problem With Ant Colony Optimization

Basit öğe sayfası
dc.contributor.authorDemirel, Tufan
dc.contributor.authorYilmaz, Sule
dc.contributor.institutionauthorDEMİREL, Tufan
dc.date.accessioned2026-06-27T13:17:17Z
dc.date.issued2012
dc.description.abstractThe Multi-Depot Vehicle Routing Problem (MDVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which vehicles start from multiple depots to visit customers and return to their depots of origin at the end of their tours. The objective of MDVRP is to minimize the total length of the routes, same as the other types of VRP. In this paper a solution methodology based on Ant Colony Optimization (ACO) inspired by the observation of real ants is proposed to solve MDVRP. ACO includes many algorithms which are many diverse variants of the basic principle. We presented the computational implementations of our model for different benchmark MDVRP problem sets. Besides we also recognized the effects to the solutions of all the parameter changes of Ant Colony Optimization and the effects of angle changes on candidate list in detail.en
dc.identifier.eissn1542-3999
dc.identifier.endpage439
dc.identifier.issn1542-3980
dc.identifier.issue3-4
dc.identifier.startpage421
dc.identifier.urihttps://hdl.handle.net/20.500.14981/51496
dc.identifier.volume18
dc.identifier.wos000301082300011
dc.language.isoeng
dc.publisherOLD CITY PUBLISHING INC
dc.relation.ispartofJOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING
dc.subjectVehicle Routing Problem
dc.subjectMulti Depot Vehicle Routing Problem
dc.subjectAnt Colony Optimization
dc.subjectAnt Colony System
dc.subjectLOCAL SEARCH
dc.subjectTIME WINDOW
dc.subjectALGORITHM
dc.subjectComputer Science
dc.subjectScience & Technology - Other Topics
dc.titleA New Solution Approach To Multi-Depot Vehicle Routing Problem With Ant Colony Optimization
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar