Research on Scheduling Emergency Supplies Featuring Hierarchical Linkage Based on Genetic Algorithm

DOI

10.2991/meita-15.2015.29How to use a DOI?

Keywords

Hierarchical linkage Scheduling; Emergency Supplies Scheduling; Vehicle Scheduling Problem; Genetic Algorithm

Abstract

This paper presents the hierarchical linkage scheduling emergency supplies problem. A mathematical description is provided and a model of the hierarchical scheduling emergency supplies with multiple supplies and multiple vehicles is formed in order to acquire the shortest scheduling time and the lowest cost. For this problem, we give a two-stage scheduling case of supplies in this paper. This case consists of a primary transportation system including primary storage, secondary storage and primary road network(normal road and highway), and the secondary system which includes secondary storage, disaster point and secondary road network(normal road). In order to facilitate the expression, we named primary first-stage and secondary second-stage. After that, we define the hybrid of shortest scheduling time and cost as the objective function in this two-stage system. An improved genetic algorithm is applied to calculate this case. Thus, we can obtain the scheduling plan after implementing a global linkage approach.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Feihu Hu
AU  - Weihao Bai
AU  - Chaohui Tian
PY  - 2015/08
DA  - 2015/08
TI  - Research on Scheduling Emergency Supplies Featuring Hierarchical Linkage Based on Genetic Algorithm
BT  - Proceedings of the 2015 International Conference on Materials Engineering and Information Technology Applications
PB  - Atlantis Press
SP  - 141
EP  - 150
SN  - 2352-5401
UR  - https://doi.org/10.2991/meita-15.2015.29
DO  - 10.2991/meita-15.2015.29
ID  - Hu2015/08
ER  -