期刊文献+

基于成本/收益权衡的多元需求FIP选址研究 被引量:1

The Research on Trade-Offs between Cost and Revenue in Multi-demand FIP Location Problem
原文传递
导出
摘要 需求种类分析对选址决策至关重要,考虑了消费者需求种类为多元化,且各类需求间有影响的网络上截流(FIP)选址问题,引入路径上需求损失函数,建立了收益最大和总的建设成本最小的双目标的多元需求FIP(mDFIP)的新模型。所建立的模型为NP-hard问题,设计了多目标演化算法求解模型,最后通过具体的算例与基于ε约束法的分支定界法进行比较,结果表明在求解效率上多目标演化算法具有很大优势。 The type of demand is vital for the location decision.We consider the flow interception problem(FIP) location on the network with multi-demand and the interaction existed among them.Through the demand loss function,we develop a new model of bi-objective multi-demand FIP(mDFIP) model,one objective of our model is to maximize the revenue and the other objective is to minimize the total cost.The model is NP-hard problem,we design the multi-objective evolution algorithm to solve it,and computational experiment is described by comparing multi-objective evolution algorithm with branch and bound method which based on ε-constraint.It shows that the multi-objective evolution algorithm is high-efficiency in solving the model.
出处 《工业工程与管理》 北大核心 2010年第2期62-66,97,共6页 Industrial Engineering and Management
基金 国家自然科学基金(70871044) 教育部新世纪优秀人才支持计划项目(NCET-06-0653)
关键词 截流问题 选址 多元需求 多目标演化算法 FIP location multi-demand multi-objective evolution algorithm
作者简介 张曦(1980-),女,河北南宫人,博士研究生,主要研究方向为选址和网络优化等。
  • 相关文献

参考文献21

  • 1Fatma G,Erhan E.A Lagerangian relaxation approach to large-scale flow interception problems[J].European Journal of Operational Research,2009,198(10):405-411.
  • 2Berman O,Fouska N,Larson R C.Optimal location of discretionary service facilities[J].Transportation Science,1992,26(1):201-211.
  • 3Hodgson J.A flow-capturing location allocation model[J].Geographical Analysis,1990,22(1):270-279.
  • 4Berman O,Hodgson J,Krass D.Flow interception problem In:Drezner,Z(Ed.),Facility Location:A Survey of Apllication and Methods[M].Springer,Berlin,1995.
  • 5Berman O,Bertsimas D,Larson R C.Locating discretionary service facility.II:Minimizing inconvenience[J].Operations Research,1995,43(2):623-632.
  • 6Wu T H,Lin J N.Solving the competitive discretionary service facility location problem[J].European Journal of Operational Research,2003,144(2):366-378.
  • 7杨珺,张敏,陈新.一类带服务半径的服务站截流选址-分配问题[J].系统工程理论与实践,2006,26(1):117-122. 被引量:29
  • 8Berman O,Krass D.Flow intercepting spatial interaction model:a new approach to optimal location of competitive facilities[J].Location science,1998,6(1):41-65.
  • 9杨珺,杨超,马云峰.带有双重容量限制的FIP问题研究[J].中国公路学报,2004,17(4):85-88. 被引量:7
  • 10Yang J,Zhang M,He B,et al.Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice[J].Computers and Mathematics with Applications,2009,57(7)1985-1994.

二级参考文献27

  • 1曾三友,李晖,丁立新,姚书振,许中华.基于排序的非劣集合快速求解算法[J].计算机研究与发展,2004,41(9):1565-1571. 被引量:8
  • 2Hodgson J.A Flow-capturing location allocation model[J].Geographical Analysis,1990,22(3):270 -279.
  • 3Berman O,Fouska N,Larson R C.Optimal location of discretionary service facilities[J].Transportation Science,1992,26(3):201-211.
  • 4Berman O,Bertsimas D,Larson R C.Locating discretionary service facilities Ⅱ:Maximizing market,minimizing inconvenience[J].Operations Research,1995,43:623-632.
  • 5Berman O,Hodgson J,Krass D.Flow interception problem.In:Drezner,Z(Ed.),Facility Location:A Survey of Application andMethods[M].Springer,Berlin,1995,389-426.
  • 6Berman O,Krass D,Xu C W.Locating discretionary service facilities based on probabilistic customer flows[J].TransportationScience,1995,29:276-290.
  • 7Hodgson M J,Rosing K E.Applying the flow capturing location-allocation model to an authentic network:Edmonton,canada[J].European Journal of Operational Research 1996,90:427-443.
  • 8Mirchandani P B,Rebello R,Agnetis A.The inspection station location problem in hazardous materials transportation:someheuristics and bound[J].INFOR,1995,33:100-113.
  • 9[1]BERMAN O,FOUSKA N,LARSON R C. Optimal location of discretionary service facilities[J]. Transportation Science, 1992,26 (3): 201-211.
  • 10[2]HODGSON J. A flow-capturing location allocation model [J]. Geographical Analysis, 1990,22 (3): 270-279.

共引文献457

同被引文献11

  • 1Berman O,Fouska N,Larson R C. Optimal location of Discretionary Service Facilities[J].Transportation Science,1992,(03).
  • 2Hodgson J. A Flow-capturing Location Allocation Model[J].Geographical Analysis,1990,(03).
  • 3Berman O,Bertsimas D,Larson R C. Locating Discretionary Service Facility.Ⅱ:Minimizing Inconvenience[J].Operations Research,1995,(04).doi:10.1287/opre.43.4.623.
  • 4Zeng W P,Hodgson J,Castillo I. The Pickup Problem:Consumers' Locational Preferences in Flow Interception[J].Geographical Analysis,2009,(02).
  • 5Zeng W P,Castilo I,Hodgson J. A Generalized Model for Locating Facilities on a Network with Flow-Based Demand[J].NETWORKS & SPATIAL ECONOMICS,2010,(01).
  • 6Gzara F,Erkut E. A Lagerangian Relaxation Approach to Large-scale Flow Interception Problems[J].European Journal of Operational Research,2008,(08).
  • 7Mark W.Horner,Sara Groves. Network Flow-based Strategies for Identifying Rail Park-and-ride Facility locations[J].Socio-Economic Planning Sciences,2007,(41).
  • 8Yang H,Yang C,Gan L P. Models and Algorithms for the Screen line-based Traffic-counting location Problems[J].Computers and Operations Research,2006,(03).doi:10.1016/j.cor.2004.08.011.
  • 9Suh K,Guo Y,Kurose J,Towsley D. Locating Network Monitors:Complexity,Heuristics,and Coverage[J].Computer Communications,2006,(10).
  • 10Farahani R Z,Hekmatfar M. Facility Location-Concepts,Models,Algorithms and Case Studies[M].Beilin:Springer-Verlag,2009.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部