Research on the Layout of National Economic Mobilization Logistics Centers

Full Text (PDF, 106KB), PP.44-50

Views: 0 Downloads: 0


Pingzhou Tang 1,* Huiying Tian 1

1. North China Electric Power University/School of Economics and Management, Beijing, China

* Corresponding author.


Received: 7 Mar. 2010 / Revised: 1 Jun. 2010 / Accepted: 15 Aug. 2010 / Published: 8 Nov. 2010

Index Terms

Center Layout, set covering problem, national economy mobilization, Layout Model, Layout Network diagram


The problem of the layout of NEMLC (National Economic Mobilization Logistics Center) is one of the most important long-term decision-making issues. The result of NEMLC’s layout directly impacts many aspects of mobilization, such as time, reliability, quality, efficiency, cost, and so on, consequently affects the effect of the mobilization. Reasonable NEMLC layout can bring people convenience in the daily life, reduce costs, and improve service efficiency and competitiveness. Poor NEMLC layout often brings a great deal of inconvenience and loss, and even leads to mobilization failure. Under the restriction of mobilization time, the paper establishes the layout model that one or more mobilization logistics centers provide the material to the mobilization demanding place. The mobilization goods or service can reach the demanding place to carry into mobilization execution within the given time, and the number of the built NEMLCs is the least.

Cite This Paper

Pingzhou Tang, Huiying Tian,"Research on the Layout of National Economic Mobilization Logistics Centers", International Journal of Intelligent Systems and Applications(IJISA), vol.2, no.1, pp.44-50, 2010.  DOI: 10.5815/ijisa.2010.01.07


[1] Roland Durier. The general one center location problem. Mathematics of Operations Research, 1995, 20(2): 400-418.

[2] Shier D.R, Dearing P.M. Optimal locations for a class of nonlinear single-facility location problems on a network [J]. Operations Research. 1983, 31: 292-303.

[3] Lemke C E. Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems [J]. Operations Research, 1971, 19(4): 998-1022.

[4] Luis Gonzalo Acosta Espejo, Roberto D.Galvao. Dual-based heuristics for a hierarchical covering location problem[J]. Computers & Operations Research. 2003, 30: 65-180.

[5] Chen Duanbing, Huang Wenqi. A heuristic algorithm of Solving the problem of set covering problem[J], Computer Science, 2007, 34 (4): 133-136.

[6] Quan Guangri, Hong Bingrong, Ye Feng, et al. The heuristic function algorithm of set covering problem[J], Journal of Software, 1998 (2): 156-160.

[7] Daskin M S. A maximum expected covering location problem: Formulation, properties, and heuristic solution[J]. Transportation Service.1983, 17: 48-70.