基于知识图谱的运筹学发展现状及趋势研究
|
摘要
借助于Citespace软件对web of science上2006年到2015年之间以运筹学为主题的3166篇学术论文进行分析,梳理了运筹学这十年间的发展脉络、重要文献、研究热点和前沿等。研究发现,目前美国在运筹学研究领域依然遥遥领先,英国、中国等也取得了较为丰硕的成果。近十年对运筹学发展有较大影响的成果主要有Stahlbock R在2008对运筹学在港口的作业组织和控制,码头运作计划和调度应用的总结; 19世纪70年代和80年代由Charnes A和Cooper W W以及Rhodes E开创的CCR和BCC模型; 1979年由Garey M R总结的具有三百个具有NP完全性的问题;由Goldberg D E在1989年对于遗传算法的论著等。研究热点领域主要集中在集装箱码头调度运输方面的研究。研究前沿主要集中在管理科学、战略制定、遗传算法、人员排班、数据包络分析等问题。
At present,operations research has been used in various fields widely. In order to understand the development of operations research,this paper analyzes 3166 academic papers on the web of science from 2006 to 2015 based on Citespace. It investigates the development,important literatures,research hotspots and frontiers of operational research in this decade. This study finds that the United States is still far ahead in the field of operations research,and the United Kingdom and China also produce fruitful results. The mainly influential results of the last decade on the development of operational research are the summary of the application on operational organization in the harbor and control,terminal operation planning and scheduling by Stahlbock R in2008; the model of CCR and BBC created by Charnes A and Cooper W W and Rhodes E in 1870 s and 1880 s;the three hundred NP-complete problem summed up by Garey M R in 1979; the study in genetic algorithms by Goldberg D E in 1989 and so on. The research hotspots focus on the container terminal dispatching and transportation. Research frontiers mainly focus on management science, strategy formulation, genetic algorithm,personnel scheduling,data envelopment analysis and so on.
At present,operations research has been used in various fields widely. In order to understand the development of operations research,this paper analyzes 3166 academic papers on the web of science from 2006 to 2015 based on Citespace. It investigates the development,important literatures,research hotspots and frontiers of operational research in this decade. This study finds that the United States is still far ahead in the field of operations research,and the United Kingdom and China also produce fruitful results. The mainly influential results of the last decade on the development of operational research are the summary of the application on operational organization in the harbor and control,terminal operation planning and scheduling by Stahlbock R in2008; the model of CCR and BBC created by Charnes A and Cooper W W and Rhodes E in 1870 s and 1880 s;the three hundred NP-complete problem summed up by Garey M R in 1979; the study in genetic algorithms by Goldberg D E in 1989 and so on. The research hotspots focus on the container terminal dispatching and transportation. Research frontiers mainly focus on management science, strategy formulation, genetic algorithm,personnel scheduling,data envelopment analysis and so on.
引文
[1]刘则渊,王贤文,陈超美.科学知识图谱方法及其在科技情报中的应用[J].数字图书馆论坛,2009,10(10):14-34.
[2] Stahlbock R,VoBS. Operations research at container terminals:a literature update[J]. OR Spectrum,2008,30(1):1-52.
[3] Charnes A,Cooper W W,Rhodes E. Measuring the efficiency of decision making units[J]. European Journal of Operational Research,1978,2(6):429-444.
[4] Garey M R,Johnson D S. Computers and intractability:a guide to the theory of NP-completeness[M]. W. H.Freeman,1979.
[5] Banker R D,Charnes A,Cooper W W. Some models for estimating technical and scale inefficiencies in data envelopment analysis[J]. Management Science,1984,30(9):1078-1092.
[6] Goldberg D E. Genetic algorithm in search,optimization,and machine learning[J]. Reading,1989,xiii(7):2104-2116.
[7] Saaty T L. The analytic hierarchy process:planning,priority setting,resource allocation. mc Graw-hill,NY,USA[M]//The Analytic Hierarchy Process:Planning,Priority Setting,Resource Allocation,1980.
[8] Kuhn H W,Tucker A W. Proceedings of 2nd berkeley symposium[J]. Nonlinear programming,1951. 481-492.
[9] Dantzig G B,Ramser J H. The truck dispatching problem[J]. Management Science,1959,6(1):80-91.
[10] Gilmore P C,Gomory R E. A linear programming approach to the cutting-stock problem[J]. Operations research,1961,9(6):849-859.
[11] Ford L R,Fulkerson D R. Flows in networks:[M].Princeton University Pre,1962.
[12] Bierwirth C,Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals[J]. European Journal of Operational Research,2010,202(202):615-627.
[13] Hakan Akyüz M,Lee C Y. A mathematical formulation and efficient heuristics for the dynamic container relocation problem[J]. Naval Research Logistics(NRL),2014,61(2):101-118.
[14] Alessandri A,Cervellera C,Cuneo M,et al. Modeling and feedback control for resource allocation and performance analysis in container terminals[J]. IEEE Transactions on Intelligent Transportation Systems,2008,9(4):601-614.
[15] Rosenhead J, Mingers J. Rational analysis for a problematic world revisited[M]. John Wiley and Sons,2001.
[16] Burt G. Towards the integration of system modelling with scenario planning to support strategy:the case of the UK energy industry[J]. Journal of the Operational Research Society,2011,62(5):830-839.
[17] Zhang J,Tian B,Li X. Solving TSP with improved multi-agent genetic algorithm[J]. Journal of Computer Applications,2008,13:42-45.
[18] Bogdanovi'c M. An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem[J]. Computers&Mathematics with Applications,2010,59(9):3029-3038.
[2] Stahlbock R,VoBS. Operations research at container terminals:a literature update[J]. OR Spectrum,2008,30(1):1-52.
[3] Charnes A,Cooper W W,Rhodes E. Measuring the efficiency of decision making units[J]. European Journal of Operational Research,1978,2(6):429-444.
[4] Garey M R,Johnson D S. Computers and intractability:a guide to the theory of NP-completeness[M]. W. H.Freeman,1979.
[5] Banker R D,Charnes A,Cooper W W. Some models for estimating technical and scale inefficiencies in data envelopment analysis[J]. Management Science,1984,30(9):1078-1092.
[6] Goldberg D E. Genetic algorithm in search,optimization,and machine learning[J]. Reading,1989,xiii(7):2104-2116.
[7] Saaty T L. The analytic hierarchy process:planning,priority setting,resource allocation. mc Graw-hill,NY,USA[M]//The Analytic Hierarchy Process:Planning,Priority Setting,Resource Allocation,1980.
[8] Kuhn H W,Tucker A W. Proceedings of 2nd berkeley symposium[J]. Nonlinear programming,1951. 481-492.
[9] Dantzig G B,Ramser J H. The truck dispatching problem[J]. Management Science,1959,6(1):80-91.
[10] Gilmore P C,Gomory R E. A linear programming approach to the cutting-stock problem[J]. Operations research,1961,9(6):849-859.
[11] Ford L R,Fulkerson D R. Flows in networks:[M].Princeton University Pre,1962.
[12] Bierwirth C,Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals[J]. European Journal of Operational Research,2010,202(202):615-627.
[13] Hakan Akyüz M,Lee C Y. A mathematical formulation and efficient heuristics for the dynamic container relocation problem[J]. Naval Research Logistics(NRL),2014,61(2):101-118.
[14] Alessandri A,Cervellera C,Cuneo M,et al. Modeling and feedback control for resource allocation and performance analysis in container terminals[J]. IEEE Transactions on Intelligent Transportation Systems,2008,9(4):601-614.
[15] Rosenhead J, Mingers J. Rational analysis for a problematic world revisited[M]. John Wiley and Sons,2001.
[16] Burt G. Towards the integration of system modelling with scenario planning to support strategy:the case of the UK energy industry[J]. Journal of the Operational Research Society,2011,62(5):830-839.
[17] Zhang J,Tian B,Li X. Solving TSP with improved multi-agent genetic algorithm[J]. Journal of Computer Applications,2008,13:42-45.
[18] Bogdanovi'c M. An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem[J]. Computers&Mathematics with Applications,2010,59(9):3029-3038.