Research on Model Structure and Algorithm of Allied Vehicle Routing and Scheduling Problems
Cai Yan-guang · Computer Technology and Development · 2007
Allied vehicle routing and scheduling problems(AVRP) are derived from vehicle routing and scheduling problems(VRP),and they are the most realistic combinatorial optimization problems,moreover,they have been a focus of research in the logistic management recently.According to the classified method of VRP,the model structure of AVRP is described.The character and the application actualities of Genetic Algorithm,Simulated Annealing,Tabu Search,Ant Colony Algorithm,Particle Swarm Optimization are analyzed,and the possibilities to solve AVRP are discussed.Finally,the development foreground of AVRP is presented,and the viewpoint that improving original algorithms,putting forward new algorithms,parallel algorithms are important measures to solve AVRP is pointed out.