[1] |
李晓燕, 陈红. 城市生态交通规划的理论框架[J]. 长安大学学报: 自然科学版, 2006, 26(1): 79-82. https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200601017.htmLi Xiao-yan, Chen Hong. Urban eco-transportation planning theory[J]. Journal of Chang'an University: Natural Science Edition, 2006, 26(1): 79-82. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200601017.htm
|
[2] |
许良, 高自友. 基于路段能力可靠性的城市交通网络设计[J]. 中国公路学报, 2006, 19(2): 86-90. doi: 10.3321/j.issn:1001-7372.2006.02.015Xu Liang, Gao Zi-you. Urban transport network design based on link capacity reliability[J]. China Journal of Highwayand Transport, 2006, 19(2): 86-90. (in Chinese) doi: 10.3321/j.issn:1001-7372.2006.02.015
|
[3] |
陈松岩, 今井昭夫. 物流网络选址与路径优化问题的模型与启发式解法[J]. 交通运输工程学报, 2006, 6(3): 118-121. doi: 10.3321/j.issn:1671-1637.2006.03.025Chen Song-yan, Imai Akio. Model and heuristic solution for location routing problems of logistics network[J]. Journal of Traffic and Transportation Engineering, 2006, 6(3): 118-121. (in Chinese) doi: 10.3321/j.issn:1671-1637.2006.03.025
|
[4] |
华国伟, 杨丰梅, 黎建强. 两个双目标竞争选址问题模型[J]. 系统工程理论与实践, 2007, 28(1): 99-106. doi: 10.3321/j.issn:1000-6788.2007.01.014Hua Guo-wei, Yang Feng-mei, Li Jian-qiang. Two bi-objective optimization models for competitive location problems[J]. Systems Engineering-Theory & Practice, 2007, 28(1): 99-106. (in Chinese) doi: 10.3321/j.issn:1000-6788.2007.01.014
|
[5] |
龚延成, 郭晓汾, 蔡团结, 等. 物流配送点选址模型及其算法研究[J]. 中国公路学报, 2003, 16(2): 123-126. doi: 10.3321/j.issn:1001-7372.2003.02.031Gong Yan-cheng, Guo Xiao-fen, Cai Tuan-jie, et al. Research on the choosing model of physical distribution sites and its arithmetic[J]. China Journal of Highway and Transport, 2003, 16(2): 123-126. (in Chinese) doi: 10.3321/j.issn:1001-7372.2003.02.031
|
[6] |
Daskin M, Hesse S, Revelle S. α-Reliable p-minimax regret: a new model for strategic facility location modeling[J]. Location Science, 1997, 5(4): 227-246. doi: 10.1016/S0966-8349(98)00036-9
|
[7] |
Averbakh I, Berman O. Minmax regret median location on anetwork under uncertainty[J]. INFORMS Journal on Computing, 2000, 12(2): 104-110. doi: 10.1287/ijoc.12.2.104.11897
|
[8] |
Averbakh I, Berman O. Minimax regret p-center location on a network with demand uncertainty[J]. Location Science, 1997, 5(4): 247-254. doi: 10.1016/S0966-8349(98)00033-3
|
[9] |
Averbakh I. Minmax regret linear resource allocation problems[J]. Operations Research Letters, 2004, 32(2): 174-180. doi: 10.1016/S0167-6377(03)00091-9
|
[10] |
Montemanni R, Gambardella L M. An exact algorithm for the robust shortest path problem withinterval data[J]. Computers and Operations Research, 2004, 31(10): 1 667-1 680.
|
[11] |
Kouvelis P, Yu G. Robust Discrete Optimization and Its Applications[M]. Boston: Kluwer Academic Publishers, 1997.
|
[12] |
Leung S C H, Tsang S O S, Ng W L, et al. A robust optimization model for multi-site production planning problemin anuncertain environment[J]. European Journal of Operational Research, 2007, 181(1): 224-238.
|
[13] |
方磊, 何建敏. 给定限期条件下的应急系统优化选址模型及算法[J]. 管理工程学报, 2004, 18(1): 48-51. https://www.cnki.com.cn/Article/CJFDTOTAL-GLGU200401012.htmFang Lei, He Jian-min. Optimal location model of emergency systems by a given deadline[J]. Journal of Industrial Engineering and Engineering Management, 2004, 18(1): 48-51. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-GLGU200401012.htm
|
[14] |
陈伯成. 利用距离矩阵求绝对中心及绝对重心的讨论[J]. 系统工程理论与实践, 1997, 18(1): 1-7. https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL701.000.htmChen Bo-cheng. Study of searching an absolute center and anabsolute median by using distance matrix[J]. Systems Engineering-Theory & Practice, 1997, 18(1): 1-7. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL701.000.htm
|