期刊文献+

Improved Multi-Agent System for the Vehicle Routing Problem with Time Windows 被引量:6

Improved Multi-Agent System for the Vehicle Routing Problem with Time Windows
原文传递
导出
摘要 The vehicle routing problem with time windows (VRPTW) involves assigning a fleet of limited capacity vehicles to serve a set of customers without violating the capacity and time constraints. This paper presents a multi-agent model system for the VRPTW based on the internal behavior of agents and coordination among the agents. The system presents a formal view of coordination using the traditional contract-net protocol (CNP) that relies on the basic loop of agent behavior for order receiving, order announcement, bid calculation, and order scheduling followed by order execution. An improved CNP method based on a vehicle selection strategy is used to reduce the number of negotiations and the negotiation time. The model is validated using Solomon's benchmarks, with the results showing that the improved CNP uses only 30% as many negotiations and only 70% of the negotiation time of the traditional CNP. The vehicle routing problem with time windows (VRPTW) involves assigning a fleet of limited capacity vehicles to serve a set of customers without violating the capacity and time constraints. This paper presents a multi-agent model system for the VRPTW based on the internal behavior of agents and coordination among the agents. The system presents a formal view of coordination using the traditional contract-net protocol (CNP) that relies on the basic loop of agent behavior for order receiving, order announcement, bid calculation, and order scheduling followed by order execution. An improved CNP method based on a vehicle selection strategy is used to reduce the number of negotiations and the negotiation time. The model is validated using Solomon's benchmarks, with the results showing that the improved CNP uses only 30% as many negotiations and only 70% of the negotiation time of the traditional CNP.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2009年第3期407-412,共6页 清华大学学报(自然科学版(英文版)
关键词 vehicle routing problem with time window multi-agent system improved contract-net protocol vehicle routing problem with time window multi-agent system improved contract-net protocol
  • 相关文献

参考文献12

  • 1Beatrice Ombuki,Brian J. Ross,Franklin Hanshar.Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows[J].Applied Intelligence.2006(1)
  • 2M. W. P. Savelsbergh.Local search in routing problems with time windows[J].Annals of Operations Research.1985(1)
  • 3Fischer K,Müller J P,Pischel M.A model for cooperative transportation scheduling[].Proceedings of the st Inter- national Conference on Multiagent Systems (ICMAS’).1995
  • 4Kohout R,Erol K.In-time agent-based vehicle routing with a stochastic improvement heuristic[].AAAI/IAAI International Conference American Association for Artifi- cial Intelligence.1999
  • 5Shigaki I,Konishi M.Decentralized probabilistic algo- rithm using a multi-agent system for vehicle routing prob- lems[].International Journal of Smart Engineering System Design.2003
  • 6Leong H S,Liu M.A multi-agent algorithm for vehicle routing problem with time window[].SAC’.2006
  • 7JADE. http://jade.tilab.com . 2008
  • 8Solomon M M.Algorithms for the vehicle routing and scheduling problems with time window constraints[].Operations Research.1987
  • 9Savelsbergh M.Local Search for Routing Problems with Time Windows[].Annals of Operation Research.1985
  • 10Taillard E,Badeau P,Gendreau M,et al.A tabu search heuristic for the vehicle routing problem with soft time windows[].Transportation Science.1997

同被引文献39

引证文献6

二级引证文献48

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部