Abstract To get global solution in multi-depots vehicle transshipment scheduling problem (MDVTSP), MDVTSP models are established. Genetic algorithm and particle swarm hybrid optimization is established to solve MDVTSP. The optimization course is as follow: first set up chromosome vector to get goods’ transshipment point, and assign goods to vehicles. Second, establish tabu matrix for ant colony optimization (ACO) to get vehicle route. Then evaluate and filtrate vehicle scheduling results by optimization aim, circulate until meet terminate qualification. Illustration results show that Hybrid arithmetic is effective for multi-depots vehicle transshipment scheduling problem.
Study on Multi-depots Vehicle Transshipment Scheduling Problem and Its Genetic Algorithm and Ant Colony Algorithm Hybrid Optimization
1st ed. 2016
01.01.2016
8 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Optimal location of transshipment depots
Online Contents | 2001
|British Library Online Contents | 2018
|Multiple depots vehicle routing based on the ant colony with the genetic algorithm
BASE | 2013
|Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm
DOAJ | 2021
|The vehicle scheduling problem for a number of depots
TIBKAT | 1966
|