An agent-based guided local search for the capacited vehicle routing problem

Authors:
Dariusz Barbucha
Affiliations:
Department of Information Systems, Gdynia Maritime University, Gdynia, Poland
Venue:
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Year:
2011

Citing 10
Cited 2

Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
A tabu search heuristic for the vehicle routing problem

Management Science
An agent architecture for vehicle routing problems

Proceedings of the 2001 ACM symposium on Applied computing
Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
A Roadmap of Agent Research and Development

Autonomous Agents and Multi-Agent Systems
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research
Cooperative solution to the vehicle routing problem

KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II

Agent-based guided local search

Expert Systems with Applications: An International Journal
Modeling of route planning system based on Q value-based dynamic programming with multi-agent reinforcement learning algorithms

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of the paper is to propose and validate a new agent-based method of solving instances of the Capacited Vehicle Routing Problem (CVRP). The approach adopts a guided local search metaheuristic and combines it with an asynchronous team (A-Team) concept. A-Team assumes that a collection of software agents, each representing a particular problem solving method, cooperate to solve a problem by dynamically evolving a population of solutions. In suggested implementation each software agent carries out a guided local search. The paper contains the CVRP formulation, an overview of the dedicated multi-agent framework and a description of the proposed implementation for solving CVRP. The approach is validated experimentally and results of computational experiment are included in the final part of the paper.