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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2015
Accession Number
AD1013435

Entities

People

  • Gautham Rajappa
  • John Bell
  • Joseph Wilck

Organizations

  • United States Air Force Academy

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Data Sets
  • Equations
  • Genetic Algorithms
  • Heuristic Methods
  • Humanitarian Assistance
  • Integer Programming
  • Logistics
  • Mathematical Analysis
  • Mathematical Models
  • Operations Research
  • Optimization
  • Supply Chain
  • Supply Chain Management

Fields of Study

  • Computer science

Readers

  • Operations Research

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Biotechnology
  • Biotechnology - Cancer Biotech