返回
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Guided local search
Cooperative multi-agent systems
Asynchronous team
Vehicle routing problem
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
Organocatalyzed atom transfer radical polymerization driven by visible light可见光驱动的有机催化原子转移自由基聚合
Science
IF0
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关
Gut
IF0
A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints具有二维载荷约束的车辆路径问题的引导禁忌搜索

