The analysis of an optimisation model for emergency vehicles scheduling in multi-mode layer networks
by Yongsheng Qian; Jinlong Zhang; Junwei Zeng; Libin Fu; Xiaoping Guang; Xin Wang
International Journal of Computer Applications in Technology (IJCAT), Vol. 53, No. 3, 2016

Abstract: A series of paroxysmal events have occurred unceasingly around the world in recent years, and delivering the relief supplies to disaster areas in the shortest time is becoming a difficult problem in emergency logistics distribution system. A multi-mode layered network is introduced in this paper according to the function of nodes of emergency logistics networks, such as emergency logistics centre and demand centres, in the process of material circulation. Then, we design a multi-mode layered network to describe the behaviour of emergency supply transportation. On this basis, an objective function of emergency vehicles scheduling is proposed by analysing the constraints in the emergency logistics process, and a linear programming model based on an improved idea of maximum flow minimum cost is used to solve this problem. Finally, this model is calculated and analysed through a concrete example. The results show that the model is encouraging and can solve the issues of both urgency of transit time and the feature of road capacity in real life.

Online publication date: Mon, 28-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email