The Provincial Network Planning Model Study Based on 0-1 Mixed Integer for Programming Tobacco Commercial Enterprise

Article Preview

Abstract:

In order to adapt to the trend of modern logistics, coordinate the planning of tobacco logistics across the province, and save logistics resource, lower logistics cost and promote the core competitiveness of tobacco logistics, we use the 0-1integer programming method to build the network planning model for tobacco business. To revise the objective function and limitation factor of general location model for tobacco industry, and to make overall planning for the distribution system across the province, and make it more cost competitiveness.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

588-592

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Clarisse, D.F.: Spatial Decomposition for a Multi-facility Production and Distribution Problem. J. International Journal of Production Economics. 64, 177-186(2000)

DOI: 10.1016/s0925-5273(99)00056-0

Google Scholar

[2] Sanjay, M., Mark, S.D.: An Integrated Model of Facility Location and Transportation Network Design. J. Transportation Research. Part A, 35(6), 515—538(2001)

DOI: 10.1016/s0965-8564(00)00005-7

Google Scholar

[3] Ali, A.: Designing a Distribution Network in a Supply Chain System: Formulation and Efficient Solution Procedure. J. European Journal of Operational Research. 171(2), 567-576(2006)

DOI: 10.1016/j.ejor.2004.09.018

Google Scholar

[4] Marc, G., Carlos, J. V., Koray, D.: Modeling and Design of Global Logistics Systems: a Review of Integrated Strategic and Tactical Models and Design Algorithms. J. European Journal of Operational Research. 143(1), l—18 (2002)

DOI: 10.1016/s0377-2217(02)00142-x

Google Scholar

[5] Chuang, J.C.: Distributed Network Storage Service with Quality of Service Quarantees. J. Journal of Network and Computer Applications. 23(12), 163-185(2000)

DOI: 10.1006/jnca.2000.0109

Google Scholar

[6] Sam, R.T., Jean, Y. P., Tong, S.: Heuristic Approaches to Vehicle Routing with Backhauls and Time Windows. J. Computer and Operations Research, 23(11),1043-1057(1996)

DOI: 10.1016/0305-0548(96)00018-4

Google Scholar