检索结果-内蒙古大学图书馆

12th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

作者： Gao, Guoming Fan, Fengjiao Li, Jianping Tang, Xuefei Univ Elect & Technol China Sch Engn & Comp Sci Chengdu Peoples R China Univ Elect Sci & Technol China Sch Informat & Software Engn Chengdu Peoples R China

ISBN: (纸本)9781467382663

This paper researches the fragment mosaic model of fragments from the same paper. By analyzing the character of Chinese character, we classify the fragments into different group. And for different situation that fragments were cut, we put forward the 0-1 integer programming model to solve the problem. The matching degree of different fragment decided by the eosine similarity ofthe fragments. The result ofthe research show that fragment mosaic model based on 0-1 integer programming model can accurately describe the problem and solve the problem.

关键词： Fragment mosaic classify 0-1 integer programming model eosine similarity

来源：评论

学校读者我要写书评

暂无评论

modeling and analysis of the dynamic location registration and paging in microcellular systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1996年第1期45卷 82-90页

作者： Kim, SJ Lee, CY Department of Management Science Korea Advanced Institute of Science and Technology Taejon South Korea

A 0-1 integer programming model is considered to determine the most appropriate dynamic location registration (LR) area of each subscriber in microcellular systems. The minimization model of the LR area updating and paging signal costs is examined, The model is based on the subscriber characteristics, such as the call arrival rate and the velocity, as well as the regional information, The control channel blocking probabilities are considered as constraints to meet the service level of subscribers, A dynamic scheme which adaptively updates the size and shape of the LR area is developed by solving the minimization problem. Paging and location updating procedures are presented based on the dynamic procedure. The superiority of the proposed scheme is demonstrated with various computational results.

关键词： cellular radio economics integer programming minimisation probability radio direction-finding 0-1 integer programming model analysis call arrival rate control channel blocking probabilities dynamic location registration location registration area updatin cellular radio modeling integer programming location registration RADIO LOCATING Probability arrival rate economics

来源：评论

学校读者我要写书评

暂无评论

Possibilistic-diagnosis theory for fault-section estimation and state identification of unobserved protective relays using tabu-search method

引用

IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION 1998年第6期145卷 722-730页

作者： Wen, FS Chang, CS Natl Univ Singapore Dept Elect Engn Singapore 119260 Singapore

In the paper an integrated approach is presented for fault-section estimation and state identification of those protective relays whose state information is not available in electrical power dispatching centres (hereafter the authors refer to these protective relays as unobserved protective relays) using tabu-search (TS) method. The proposed fault-section estimation method utilises incomplete operational information of protective relays and tripping information of circuit breakers, and is able to deal with tho operating reliabilities ii of protective relays and circuit breakers. At first, based on the logic relationship among section fault, protective relay operation and circuit breaker trip, a 0-1 integer programming model for fault-section estimation and state identification of unobserved protective relays (FSE-SIUPR) is presented. The developed model is based on recently proposed possibilistic-diagnosis theory under graded uncertainty and the well developed parsimonious set covering theory. In this model. the problem of the fault-section estimation under incomplete information from protective relays is dealt with in a formal and systematic manner, and the operating reliabilities of protective relays ana circuit breakers are taken into account at the same time. Secondly, the TS method is used to solve this 0-1 programming model to find the optimal solution efficiently. In addition. an efficient method for identification of faulty subnetworks which include all faulty sections is adopted by using the realtime information from circuit breakers. Extensive: test results of a sample power system have demonstrated the correctness of the developed mathematical model and the efficiency of the TS-based method.

关键词： power system state estimation unobserved protective relays integer programming tabu-search method 0-1 integer programming model 0-1 programming model Optimisation techniques probability power system relaying tripping information parsimonious set covering theory operating reliabilities Switchgear relay protection power system protection state identification power systems Possibilistic-diagnosis theory Power system protection graded uncertainty Other topics in statistics circuit breakers power system faults fault-section estimation

来源：评论

学校读者我要写书评

暂无评论

Study on Location Adjustment model of Store Area in Distribution Center Based on Shortest Picking Time

Study on Location Adjustment Model of Store Area in Distribu...

引用

International Conference on Advances in Engineering (ICAE)

作者： Xing, Meifang Wang, Zhuan Cheng, Guoquan Zhang, Qinghua Univ Sci & Technol Beijing Beijing 100083 Peoples R China

In order to solve the problem that the work efficiency in distribution center becomes low because of the unreasonable store area location, this paper studies the location adjustment model of store area in distribution center. The store area location 0-1 integer-programming model is established with the shortest total picking time as target function, store capacity and picking points as constraint conditions and a heuristic method is provided for calculating. The practical example shows that the proposed method to adjust store area location is reasonable so as to prove the validity of the location adjustment model. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICAE2011.

关键词： distribution center store area location picking time 0-1 integer programming model heuristic method

来源：评论

学校读者我要写书评

暂无评论

Fishing model based on Seawater Temperature Prediction

International Core Journal of Engineering

引用

International Core Journal of Engineering 2021年第9期7卷 249-256页

作者： Shaoyou Ao

Seventy percent of the Earth's surface area is covered by water. As the pace of global warming accelerates, some species in the ocean have to make compromises, and we have to be forced to make compromises. Therefore, this article predicts the interaction between us and marine populations. The impact will become very meaningful. First, I have established research indicators to study the effects of changes in ocean water temperature on the habitat of Scottish herring and mackerel. In the light of seasonal time series based on world ocean temperature changes over the past 20 years. I built a seasonal time series ASIMA model of seawater temperature, based on which we made water temperature forecasts around the North Atlantic for the next 50 years, and identified the most likely locations for Scottish herring and mackerel in the next 50 ***, using prediction data for bilinear interpolation to determine the best or worst impact of Scottish herring and mackerel habitats on North Atlantic small fishing companies, and the time that the impact is most likely to ***, from the above directions, we have established a 0-1 integer programming model that considers the business strategy of small fishing companies to increase revenue through site selection, and recommendations for the strategy when it is used to relocate some fisheries to another ***'s more, in the pros and cons test of the model, the time series model is applied in this case with a high degree of fit, under the same conditions, the fitting degree is much higher than the Grey model. The comparison between the two shows that the time series model is more suitable in this case. Then analyze the advantages and disadvantages of 0-1 integer planning in the location problem.

关键词： ARIMA model Bilinear Interpolation 0-1 integer programming model

来源：评论

学校读者我要写书评

暂无评论

Study on Location Adjustment model of Store Area in Distribution Center Based on Shortest Picking Time

引用

Procedia Engineering 2011年 24卷 604-609页

作者： Meifang Xing Zhuan Wang Guoquan Cheng Qinghua Zhang 30 Xueyuan RoadHaidian DistrictUniversity of Science and Technology BeijingBeijing100083 China

关键词： distribution center store area location picking time 0-1 integer programming model heuristic method

来源：评论

学校读者我要写书评

暂无评论

Weekly Fleet Assignment model and Algorithm

引用

Journal of Southwest Jiaotong University(English Edition) 2007年第3期15卷 231-235页

作者：朱星辉朱金福巩在武 College of Civil Aviation Nanjing University of Aeronautics and Astronautics

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.

关键词： Flight scheduling Fleet assignment problem 0-1 integer programming model Branch-and-bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Examination-order scheduling for minimizing waiting time: A case study of a medical checkup

引用

OPERATIONS RESEARCH FOR HEALTH CARE 2019年 22卷 100190-000页

作者： Ito, Mari Hara, Shizuka Tanaka, Mirai Takashima, Ryuta Tokyo Univ Sci Fac Sci & Technol Dept Ind Adm 2641 Yamazaki Noda Chiba 2788510 Japan Inst Stat Math Dept Stat Inference & Math 10-3 Midori Cho Tachikawa Tokyo 1908562 Japan

This paper introduces a mathematical programming model and a heuristic method for examination-order scheduling in medical checkup. The purpose of this scheduling is to minimize the time spent waiting for medical examinations. We create the examination-order schedule based on the expected throughput of examinations. The obtained schedules improved efficiency by reducing the total time spent waiting. Comparisons with previously used scheduling methods demonstrate the efficiency of our scheduling method. We find that the labor cost decreases due to reduction in waiting times. Furthermore, it is shown that the heuristic method proposed in this study has a robustness to the results by means of a Monte Carlo simulation. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： OR in health services 0-1 integer programming model Heuristic method Waiting time Examination-order scheduling

来源：评论

学校读者我要写书评

暂无评论

Weekly Fleet Assignment model and Algorithm

引用

Journal of Modern Transportation 2007年第3期000卷

作者： ZHU Xing-hui ZHU Jin-fu GONG Zai-wu College of Civil Aviation Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.

关键词： Flight scheduling Fleet assignment problem 0-1 integer programming model Branch-and-bound algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：