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

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

Gautham Puttur Rajappa, Joseph H. Wilck, John E. Bell
Copyright: © 2016 |Volume: 3 |Issue: 1 |Pages: 19
ISSN: 2155-4153|EISSN: 2155-4161|EISBN13: 9781466693142|DOI: 10.4018/IJAIE.2016010104
Cite Article Cite Article

MLA

Rajappa, Gautham Puttur, et al. "An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem." IJAIE vol.3, no.1 2016: pp.55-73. http://doi.org/10.4018/IJAIE.2016010104

APA

Rajappa, G. P., Wilck, J. H., & Bell, J. E. (2016). An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem. International Journal of Applied Industrial Engineering (IJAIE), 3(1), 55-73. http://doi.org/10.4018/IJAIE.2016010104

Chicago

Rajappa, Gautham Puttur, Joseph H. Wilck, and John E. Bell. "An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem," International Journal of Applied Industrial Engineering (IJAIE) 3, no.1: 55-73. http://doi.org/10.4018/IJAIE.2016010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) that allows the same customer to be served by more than one vehicle. Existing literature has applied Ant Colony Optimization (ACO) and Genetic Algorithm (GA) to other variants of VRP but no known research effort has applied ACO or a combination of ACO and GA to solve the Split Delivery Vehicle Routing Problem (SDVRP). Hence, two algorithms using ACO and hybrid metaheuristics algorithm comprising a combination of ACO, Genetic Algorithm (GA) and heuristics is proposed and tested on existing benchmark SDVRP problems. The results indicate that the two proposed algorithms are competitive in both solution quality and solution time and for some problem instances, the best ever solutions have been found.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.