Mostra el registre d'ítem simple

dc.contributor.authorLiu, ChunYing
dc.contributor.authorYu, Jijiang
dc.date.accessioned2014-01-08T09:24:05Z
dc.date.available2014-01-08T09:24:05Z
dc.date.issued2013-12
dc.identifier.citationLiu, ChunYing; Yu, Jijiang. Multiple depots vehicle routing based on the ant colony with the genetic algorithm. "Journal of Industrial Engineering and Management", Desembre 2013, vol. 6, núm. 4, p. 1013-1026.
dc.identifier.issn2013-0953
dc.identifier.urihttp://hdl.handle.net/2099/14148
dc.description.abstractPurpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm together can improve the efficiency multiple depots vehicle routing.
dc.format.extent14 p.
dc.language.isoeng
dc.publisherSchool of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
dc.rightsAttribution-NonCommercial 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions::Modelització de transports i logística
dc.subject.lcshComputer algorithms
dc.subject.lcshFreight and freightage -- Mathematical models
dc.subject.otherGenetic algorithm
dc.subject.otherAnt colony algorithm
dc.subject.otherMultiple depots
dc.subject.otherVehicle routing
dc.subject.otherFusion algorithm
dc.titleMultiple depots vehicle routing based on the ant colony with the genetic algorithm
dc.typeArticle
dc.subject.lemacAlgorismes genètics
dc.subject.lemacTransport de mercaderies -- Models matemàtics
dc.identifier.dlB-28744-2008
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.citation.authorLiu, ChunYing; Yu, Jijiang
local.citation.publicationNameJournal of Industrial Engineering and Management
local.citation.volume6
local.citation.number4
local.citation.startingPage1013
local.citation.endingPage1026


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple