Agents towards vehicle routing problems
暂无分享,去创建一个
[1] Leen Stougie,et al. ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .
[2] Gilbert Laporte,et al. Classical and modern heuristics for the vehicle routing problem , 2000 .
[3] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[4] J. F. Pierce,et al. ON THE TRUCK DISPATCHING PROBLEM , 1971 .
[5] Paolo Toth,et al. Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..
[6] K. Ghedira,et al. An Agent-Oriented Approach for the Dynamic Vehicle Routing Problem , 2008, 2008 International Workshop on Advanced Information Systems for Enterprises.
[7] Piotr Jedrzejowicz,et al. Agent-Based Approach to the Dynamic Vehicle Routing Problem , 2009, PAAMS.
[8] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .
[9] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..
[10] Hylton Boothroyd. Operational Research '90 , 1992 .
[11] György Dósa,et al. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.
[12] Ronen I. Brafman,et al. From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.
[13] Athanasios Migdalas,et al. Annotated bibliography in vehicle routing , 2007, Oper. Res..