当前位置: 首页> 国外交通期刊数据库 >详情
原文传递 Agents Toward Vehicle Routing Problem With Time Windows
题名: Agents Toward Vehicle Routing Problem With Time Windows
其他题名: Bachem,A.,Hochstättler,W.,&Malich,M.(1996).The simulated trading heuristic for solving vehicle routing problems.Discrete Applied Mathematics,65,47–72.
正文语种: 英文
作者: PETR KALINA
关键词: Abstract Coordination Mechanism;Multi-Agent Optimization;Vehicle Routing Problem With Time Windows (VRPTW)
摘要: We suggest an efficient polynomial algorithm for the vehicle routing problem with time windows based on agent negotiation. A generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the abstract global coordination achieved by negotiation—differentiating the presented algorithm from the classical centralized algorithms. The semantic of the abstract negotiation process is discussed, as well as the two alternative local planning strategies used by the individual vehicles. A relevant comparison to the state-of-the-art classical and agent-based algorithms is provided, missing from most previous agent-based studies. The algorithm performs slightly worse than the state-of-the-art classical algorithms but improves on all the previous comparable agent-based algorithms.
出版年: 2015
论文唯一标识: J-96Y2015V19N01002
doi: 10.1080/15472450.2014.889953
期刊名称: Journal of Intelligent Transportation Systems Technology Planning and Operations
拼音刊名(出版物代码): J-96
卷: 19
期: 01
页码: 3-17
检索历史
应用推荐