Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Computers and Operations Research
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
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
Learning Network Designs for Asynchronous Teams
Proceedings of the 8th European Workshop on Modelling Autonomous Agents in a Multi-Agent World: Multi-Agent Rationality
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
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
Using memetic algorithms with guided local search to solve assembly sequence planning
Expert Systems with Applications: An International Journal
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
Expert Systems with Applications: An International Journal
INFORMS Journal on Computing
A-Teams and Their Applications
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Metaheuristics: From Design to Implementation
Metaheuristics: From Design to Implementation
JABAT middleware as a tool for solving optimization problems
Transactions on computational collective intelligence II
An agent-based guided local search for the capacited vehicle routing problem
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
| Hi-index | 12.05 |
The main contribution of the paper is to propose and validate a new hybrid approach for solving combinatorial optimization problems in which guided local search metaheuristic is incorporated into a cooperative multi-agent framework based on the concept of asynchronous teams (A-Teams). Generally, an 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 the suggested implementation each software agent carries out a guided local search. The proposed approach has been extensively validated experimentally on one of the best known combinatorial optimization problem - the vehicle routing problem. The promising results of experiments have confirmed the effectiveness of the suggested approach.