Synchronous vs. asynchronous cooperative approach to solving the vehicle routing problem

Authors:
Dariusz Barbucha
Affiliations:
Department of Information Systems, Gdynia Maritime University, Gdynia, Poland
Venue:
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI
Year:
2010

Citing 6
Cited 2

Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows

IEEE Intelligent Systems
Cooperative Multi-Agent Learning: The State of the Art

Autonomous Agents and Multi-Agent Systems
Explicit and Emergent Cooperation Schemes for Search Algorithms

Learning and Intelligent Optimization
A cooperative hyper-heuristic search framework

Journal of Heuristics

Solving the capacitated vehicle routing problem by a team of parallel heterogeneous cooperating agents

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Search modes for the cooperative multi-agent system solving the vehicle routing problem

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cooperation as a problem-solving strategy is widely used to build methods addressing complex hard optimization problems. It involves a set of highly autonomous agents, each implementing a particular solution method. Agents cooperate during the process of solving the problem. The main goal of the paper is to evaluate to what extent a mode of cooperation (synchronous or asynchronous) between a number of optimization agents cooperating through sharing a central memory influences the quality of solutions while solving instances of the Vehicle Routing Problem.