Ant Colony Optimization Method and Split-Delivery Vehicle Routing Problem
Ant Colony Optimization Method and Split-Delivery Vehicle Routing Problem
Author(s): Andrej ChuSubject(s): Methodology and research technology, Transport / Logistics
Published by: Žilinská univerzita v Žilině
Keywords: split delivery vehicle routing problem; integer programming; ant colony optimization; metaheuristics;
Summary/Abstract: This paper deals with a split delivery vehicle routing problem, which is a modification of a vehicle routing problem. It consists in delivery routes optimization in communications network containing initial city of all routes and a given number of places, which is necessary to include in delivery routes, where a customer can be served by more than one vehicle. The objective is to find a set of vehicle routes that serve all the customers and the total distance traveled is minimized. The split delivery vehicle routing problem is NP hard, therefore we present a solution approach by three heuristics, and a metaheuristics called Ant colony optimization (ACO).
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 11/2009
- Issue No: 4
- Page Range: 38-42
- Page Count: 5
- Language: English