Research of emergent material dispatching algorithm based on multi-depot and multi-material

doi:10.3778/j.issn.1002-8331.2010.06.065

Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (6): 224-226.DOI: 10.3778/j.issn.1002-8331.2010.06.065

• 工程与应用 • Previous Articles Next Articles

Research of emergent material dispatching algorithm based on multi-depot and multi-material

CHAI Xiu-rong^1，2，WANG Ru-jing¹

1.Institute of Intelligent Machines，Chinese Academy of Science，Hefei 230031，China
2.Department of Automation，University of Science and Technology of China，Hefei 230027，China

Received:2008-09-19 Revised:2008-11-28 Online:2010-02-21 Published:2010-02-21
Contact: CHAI Xiu-rong

多出救点、多物资应急调度算法研究

柴秀荣^1，2，王儒敬¹

1.中国科学院合肥智能机械研究所，合肥 230031
2.中国科学技术大学自动化系，合肥 230027

通讯作者: 柴秀荣

Abstract

Abstract: The existing material dispatching methods are mostly single-depot and single-material dispatching，they can’t satisfy the actual needs of emergent rescue.In the paper，how to solve the multi-material dispatching problem for disaster occurred place in the constraints of time and the number of depots is discussed.How to seek the shortest path between the disaster occurred place and the material reserve storages is also discussed.Two specific algorithms are given and an example is utilized to verify the feasibility of the algorithm.

Key words: emergent rescue, material dispatching, shortest path

摘要： 目前物资调度方法大多是针对单出救点、单物资的调度，不能满足应急救助的实际需要。讨论在满足时间与出救点数量的约束条件下，如何解决灾害发生地多种物资调度问题，同时解决灾害发生地和物资储备仓库之间的最短路径问题。给出了两个具体的算法，并用一个实例验证了算法的可行性。

关键词: 应急救助, 物资调度, 最短路径

CLC Number:

TP301.6

CHAI Xiu-rong^1，2，WANG Ru-jing¹. Research of emergent material dispatching algorithm based on multi-depot and multi-material[J]. Computer Engineering and Applications, 2010, 46(6): 224-226.

柴秀荣^1，2，王儒敬¹. 多出救点、多物资应急调度算法研究[J]. 计算机工程与应用, 2010, 46(6): 224-226.

[1]	LI Jun. Improved Social Force Crowd Evacuation Simulation Model Combined with Shortest Path [J]. Computer Engineering and Applications, 2021, 57(8): 264-270.
[2]	YE Yingshi, WEI Fuyi, CAI Xianzi. Research on Fast Dijkstra Algorithm Based on Parallel Computing [J]. Computer Engineering and Applications, 2020, 56(6): 58-65.
[3]	LI Yan, WANG Yangyang, ZHANG Hongyan, WU Youxi. Fast Pruning Algorithm for Unreachable Vertices and Its Application in Solving Shortest Path Problem [J]. Computer Engineering and Applications, 2020, 56(15): 51-57.
[4]	MA Xuan, LIU Dong, HU Jiaxin. Particle Swarm Optimization for Solving Problem of k-Shortest Paths via Designated Points [J]. Computer Engineering and Applications, 2019, 55(20): 89-94.
[5]	ZHANG Xin, YAN Pei, GUO Yang, WANG Huihui. K-Shell Shortest Path Approximation Algorithm for Complex Networks [J]. Computer Engineering and Applications, 2019, 55(14): 54-60.
[6]	ZHANG Linxia, HE Liwen, HUANG Jun. Route of security device research based on SDN Network [J]. Computer Engineering and Applications, 2018, 54(4): 103-109.
[7]	GAO Zunhai, GAO Ying, CHENG Guo. Weighted path matrix of graph and all pairs shortest path problem [J]. Computer Engineering and Applications, 2017, 53(9): 47-50.
[8]	YING Wenjie, XU Kai, XU Shaoping. Multi-objective trajectory planning of manipulator for badminton robot [J]. Computer Engineering and Applications, 2017, 53(3): 258-265.
[9]	DONG Yuehua, ZHOU Yongxin. Selective sorting algorithm over a set of necessary nodes [J]. Computer Engineering and Applications, 2017, 53(20): 43-49.
[10]	YAO Bo1, FENG Hongwei1, GAO Yuan2, MA Jiali1, FENG Jun1. Dynamic pruning search algorithm that must go through certain node set [J]. Computer Engineering and Applications, 2017, 53(15): 57-62.
[11]	YANG Nan1, CHEN Yuanbo2, WANG Yanjie2, LI Qing2. Multipath transmission protocol based on degree-constrained shortest path tree [J]. Computer Engineering and Applications, 2017, 53(11): 126-130.
[12]	YUAN Yabo, LIU Yi, WU Bin. Solving shortest path problem with modified ant colony algorithm [J]. Computer Engineering and Applications, 2016, 52(6): 8-12.
[13]	MENG Yingxiang1, GAO Donghuai2, XU Hao2, XU Weizhong2. Link layer topology discovery for multi-subnet networks based on shortest path [J]. Computer Engineering and Applications, 2016, 52(2): 131-134.
[14]	HOU Xiaoqin1, HU Zhihua1, GAO Chaofeng1, LUO Xunjie2. Priority-based genetic algorithm for routing automated guided vehicles for traversing blocks in warehouse aisles [J]. Computer Engineering and Applications, 2016, 52(12): 31-36.
[15]	WU Xingliang, TU Fenghua. Personalized tag recommendation method using graph-model [J]. Computer Engineering and Applications, 2015, 51(9): 142-146.

Research of emergent material dispatching algorithm based on multi-depot and multi-material

多出救点、多物资应急调度算法研究

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics