Accession Number : AD1013435


Title :   An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem


Descriptive Note : Technical Report


Corporate Author : U.S. Air Force Academy Air Force Academy United States


Personal Author(s) : Rajappa,Gautham ; Wilck,Joseph ; Bell,John


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/1013435.pdf


Report Date : 01 Jan 2015


Pagination or Media Count : 27


Abstract : Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) wherein a customer can be visited by more than one vehicle. Two approaches using, 1) Ant Colony Optimization and 2) hybrid metaheuristics algorithm comprising a combination of ACO, Genetic Algorithm (GA) and heuristics are proposed and tested on benchmark SDVRP problems. The results indicate that the two proposed algorithms are competitive in both solution quality and solution time. In some instances, the best ever solutions have been found for particular problem instances.


Descriptors :   Optimization , LogisticS , Routing , genetic algorithms , operations research , heuristic methods


Distribution Statement : APPROVED FOR PUBLIC RELEASE