Optimization research on distribution of emergency supplies and minimize save points based on grey correlation analysis

被引：0
作者：
Department of Information Management, Nanchang University, Nanchang, Jiangxi, China [1 ]
机构：
[1] Department of Information Management, Nanchang University, Nanchang, Jiangxi
来源：
Adv. Inf. Sci. Serv. Sci. | 2012年 / 15卷 / 50-56期
关键词：
Distribution routes; Emergency supplies; Grey correlation analysis; Optimization; Save points;
D O I：
10.4156/AISS.vol4.issue15.6
中图分类号：
学科分类号：
摘要：
In public emergencies, it is the key point to response to demands of each disaster area as quickly as possible, and then, lowest the loss or casualties. The paper establishes a distribution route evaluation system of emergency supplies, discusses issue on the minimum of save points. In addition, Grey Theory is applied to analyze distribution of emergency supplies and its main factors. According to these optimization researches on distribution of emergency supplies based on grey correlation analysis, this paper aims to make the reasonable distribution of emergency supplies as quick as possible, and reduce cost and disaster extent, and to optimize the emergency response process as well as improving emergency response efficiency.
引用
收藏
页码：50 / 56
页数：6
相关论文
共 26 条
  • [1] Chakravorty Sathya S., Improving distribution operations: Implementation of material handling systems, International Journal of Production Economics, 122, 1, pp. 89-106, (2009)
  • [2] Li X., Peng T., Leung Stephen C.H., Vehicle routing problems with time windows and stochastic travel and services times: Models and algorithm, International Journal of Production Economics, 125, 1, pp. 137-145, (2010)
  • [3] Lawrence B., Bruce G., Classification in vehicle routing and scheduling, Networks, 11, 2, pp. 97-108, (1981)
  • [4] Tan K.C., Chew Y.H., Lee L.H., A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows, Computational Optimization and Applications, 34, 1, pp. 115-151, (2006)
  • [5] Ombuki B., Nakamura M., Maeda O., A hybrid search based on genetic algorithms and tabu search for vehicle routing, Proceedings of the 6th IASTED International Conference On Artificial Intelligence and Soft Computing (ASC2002), pp. 176-181, (2002)
  • [6] Thangiah S.R., A hybrid genetic algorithm simulated annealing and Tabu search heuristic for vehicle routing problems with time windows, CRC Press, USA, (1999)
  • [7] Ghoseiri K., Ghannadpour S.F., Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm, Applied Soft Computing, 10, 4, pp. 1096-1107, (2010)
  • [8] Marinakis Y., Miqdalas A., Pardalos P.M., A hybrid genetic-GRASP algorithm using Langrangean relaxation for the traveling salesman problem, Journal of Combinatorial Optimization, 10, 4, pp. 311-326, (2005)
  • [9] Chung-Ho W., Jiu-Zhang L., An effective evolutionary algorithm for the practical capacitated vehicle routing problems, Journal of Intelligence Manufacturing, 21, 4, pp. 363-375, (2010)
  • [10] Jen-Shiang C., Chap-Hsien P.J., Lin C.-M., A hybrid genetic algorithm for the reentrant flow-shop scheduling problem, Expert System with Application, 34, 1, pp. 570-577, (2008)
123