摘要
研究供应链背景下一种新的工厂选址问题。在考虑一般选址因素的基础之上,着重讨论不同的服务距离限制对工厂选址、工厂车辆分配过程以及运输网络产生的影响。本文中服务距离限制是指对顾客和供应商进行匹配运输的车辆具有的最大配送距离,运输网络采用顾客和供应商匹配方式。根据上述特点构建了一个多阶段线性整数规划模型。采用cp lex软件对模型进行优化求解。最后通过算例说明所建模型的实用性。
A new plant location problem in the supply chain background is studied. We discuss the influence of different service distance constraints to plant location, the assignment of vehicles of plants and transportation network based on ordinary location factors. In this paper service distance constraint is the maximal service distance of each vehicle. In the design of transportation network we adopt the matching mode in which a supplier and a customer are merged. A multi-stage integer programming model is established according to the above characteristics. An algorithm procedure based on eplex is proposed to solve the model. Computational results indicate the model and method are practical.
出处
《运筹与管理》
CSCD
北大核心
2010年第2期40-44,共5页
Operations Research and Management Science
基金
国家自然科学基金资助项目资助(70701029
70433003)
关键词
运筹学
工厂选址
整数规划
距离限制
匹配
cplex
operations research
plant location
integer programming
distance constraints
matching
cplex
