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

A Group Rotate-Vector Algorithm for Mixed-Variable Optimization Problems

IEEE ACCESS 2024年 12卷 184629-184643页

作者： Li, Zhongming Yan, Lutao Li, Haiyuan Wang, Lianxin Beijing Univ Posts & Telecommun Sch Intelligent Engn & Automat Beijing 100876 Peoples R China China Acad Chinese Med Sci Inst Basic Res Clin Med Beijing 100700 Peoples R China

Many engineering design optimization problems can be represented as mixed-variable optimization problems. This study presents a heuristic approach for solving mixed-variable optimization using rotation and contraction of vectors. The current optimization algorithm, known as rotate-vector, has shown promising results in solving optimization problems with real or integer variables. Building upon this concept, the authors of this paper develop methods to solve 0-1 type and general discrete type variables, and introduce corresponding rotation and contraction operators. To address the simultaneous search and optimization of multiple variable types in nonlinear mixed integer programming problems, a grouping and comprehensive processing method is employed. The proposed group rotate-vector algorithm (GRV) is evaluated through the solution of multiple 0-1 programming problems and mixed-variable optimization problems. The study also investigates the impact of parameter settings on solution quality and efficiency. The experimental results demonstrate that the GRV algorithm outperforms other algorithms in terms of solution quality.

关键词： Optimization Vectors Heuristic algorithms Search problems Robots Integer programming programming Convergence Constraint handling Classification algorithms Mixed-variable optimization 0-1 programming rotate-vector heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Hub seaport multimodal freight transport network design: Perspective of regional integration development

引用

OCEAN & COASTAL MANAGEMENT 2023年第1期242卷

作者： Yin, Chuanzhong Zhang, Ziang Zhang, Xiangdong Chen, Jihong Tao, Xuezong Yang, Lixuan Shanghai Maritime Univ Coll Transport & Commun Shanghai 201306 Peoples R China Shanghai Municipal Engn Design Inst Grp Co Ltd Comprehens Transport Planning & Design Inst Shanghai 200092 Peoples R China Shenzhen Univ Coll Management Shenzhen 518060 Peoples R China

To design the multimodal freight transport network of regional hub seaports, and promote the high-quality development of regional economic integration. Combined with the principal component analysis method, the comprehensive evaluation value of the inland cities is determined. Meanwhile, the gravity model is used to obtain the correlation degree between non-core cities and core cities, and the hinterlands of these core cities are divided. The entropy weight TOPSIS model is applied to select the inland hinterland transshipment cities. Taking the minimum total transport costs as the objective function, the regional hub seaport multimodal freight transport network optimization model with space-time constraints is established, and solved by MATLAB software. Taking the freight transport from Chengdu-Chongqing Economic Zone to Yangtze River Delta as an example, a multimodal freight transport network is constructed. It is calculated that Chengdu and Chongqing can be set as freight consolidation centers, and Changsha, Wuhan, Nanchang, Nanjing, Hangzhou, Hefei, Zhengzhou and Xi'an can be set as transshipment nodes. These non-core cities in the Chengdu-Chongqing Economic Zone can be divided into five groups to achieve effective improvement in transport efficiency through group combined transport. This study gives managerial implications for multimodal transport structure optimization and provides reference for the regional integration development between seaports and hinterlands.

关键词： Hub seaport Multimodal freight transport Network design 0-1 programming Regional integration development

来源：评论

学校读者我要写书评

暂无评论

Design and countermeasure of optimal cyber-routing attack on remote Kalman filter in stochastic microgrids

引用

INFORMATION SCIENCES 2023年 649卷

作者： Song, Yunbo Ye, Dan Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China

This paper addresses security issues of remote Kalman filter in stochastic microgrids. Smart sensors package data from the phase measurement unit and send it to a remote estimator over wireless networks, in which data packets could be vulnerable to malicious cyber-routing (CR) attacks. The definition approach is first used to develop the iteration form of corrupted estimation error covariances that is utilized to evaluate the adversary's detrimental effect. Subsequently, we formulate the solving problems of optimal CR attacks into nonlinear 0-1 programming problems under one-step, terminal, and holistic objectives, respectively. Based on the analysis of physical implementation of attacks, a novel double serial number check method is proposed to detect multi-stage CR attacks with different objectives. From the perspective of system protection, the optimal defense mechanism that minimizes the estimation error with optimal attacks is designed by anticipating the actions of the attacker. Comparisons of CR attacks and its countermeasures through the microgrid consisting of 5-Generator and 8-Line are provided to illustrate the theoretical results.

关键词： Microgrids Cyber-routing attack Kalman filter 0-1 programming Detection and defense

来源：评论

学校读者我要写书评

暂无评论

The parking allocation problem for connected vehicles

引用

JOURNAL OF HEURISTICS 2020年第3期26卷 377-399页

作者： Mladenovic, Marko Delot, Thierry Laporte, Gilbert Wilbaut, Christophe CNRS UMR 8201 LAMIH UVHC F-59313 Valenciennes France HEC Montreal 3000 Chem Cote St Catherine Montreal PQ H3T 2A7 Canada

In this paper, we propose a parking allocation model that takes into account the basic constraints and objectives of a problem where parking lots are assigned to vehicles. We assume vehicles are connected and can exchange information with a central intelligence. Vehicle arrival times can be provided by a GPS device, and the estimated number of available parking slots, at each future time moment and for each parking lot is used as an input. Our initial model is static and may be viewed as a variant of the generalized assignment problem. However, the model can be rerun, and the algorithm can handle dynamic changes by frequently solving the static model, each time producing an updated solution. In practice this approach is feasible only if reliable quality solutions of the static model are obtained within a few seconds since the GPS can continuously provide new input regarding the vehicle's positioning and its destinations. We propose a 0-1 programming model to compute exact solutions, together with a variable neighborhood search-based heuristic to obtain approximate solutions for larger instances. Computational results on randomly generated instances are provided to evaluate the performance of the proposed approaches.

关键词： Parking allocation 0-1 programming Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Application of Linear programming Modeling in Multiwave Missile Launch

Application of Linear Programming Modeling in Multiwave Miss...

引用

作者： Qitong Ou Chenhong Du School of Applied Mathematics Xiamen University of Technology

Linear programming modeling is mainly concerned with solving the maximum or minimum value of a linear function under a group of linear constraints. It has been widely used in many subjects and fields. As an application example of linear programming, this paper decomposed two-wave salvo into three steps, used Floyd algorithm and 0-1 programming to complete the task allocation model, and used Dijkstra algorithm to carry out path planning for the subsequent transfer of missile vehicles, and designed the transfer path with the highest survival rate.

关键词： Mathematical modelling Linear programming method 0-1 programming Floyd algorithm Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive binary artificial bee colony algorithm

引用

APPLIED SOFT COMPUTING 2021年 101卷 107054-107054页

作者： Durgut, Rafet Aydin, Mehmet Emin Karabuk Univ Dept Comp Engn Karabuk Turkey UWE Bristol Dept Comp Sci & Creat Technol Bristol Avon England

Metaheuristics and swarm intelligence algorithms are bio-inspired algorithms, which have long standing track record of success in problem solving. Due to the nature and the complexity of the problems, problem solving approaches may not achieve the same success level in every type of problems. Artificial bee colony (ABC) algorithm is a swarm intelligence algorithm and has originally been developed to solve numerical optimisation problems. It has a sound track record in numerical problems, but has not yet been tested sufficiently for combinatorial and binary problems. This paper proposes an adaptive hybrid approach to devise ABC algorithms with multiple and complementary binary operators for higher efficiency in solving binary problems. Three prominent operator selection schemes have been comparatively investigated for the best configuration in this regard. The proposed approach has been applied to uncapacitated facility location problems, a renown NP-Hard combinatorial problem type modelled with 0-1 programming, and successfully solved the well-known benchmarks outperforming state-of-art algorithms. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Artificial bee colony 0-1 programming Adaptive operator selection Uncapacitated facility location problems

来源：评论

学校读者我要写书评

暂无评论

Optimization of high-level preventive maintenance scheduling for high-speed trains

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2019年第Mar.期183卷 261-275页

作者： Lin Boliang Wu Jianping Lin Ruixi Wang Jiaxi Wang Hui Zhang Xuhui Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China CloudMinds 4500 Great Amer PkwySuite 230 Santa Clara CA 95054 USA China Acad Railway Sci Inst Comp Technol Beijing 100081 Peoples R China Shanghai Railway Bur Vehicle Dept Shanghai 200071 Peoples R China

For safety reasons, a high-speed train needs to carry out the preventive maintenance when its accumulated running mileage or time reaches a predefined threshold. This paper formulates the train high-level preventive maintenance planning problem as a 0-1 programming model. A novel state function is designed to describe whether a train is under maintenance or not. By using this function, the constraint for restricting the total number of trains under maintenance can be formulated reasonably well. A linearization technique is also employed to refine the original non-linear state function into a linear one. To handle large-scale instances, a simulated annealing algorithm is proposed for solving the problem and is applied to a real-world case study from Shanghai Railway Bureau (SRB), a regional railway operator under China Railway. The optimized results yield a total cost of 3,619,200 standard train-km in terms of remaining mileage. In addition, sensitivity analyses based on the real-world case study reveal some interesting insights. We have delivered the results to SRB as a useful and efficient decision support tool for their high-level maintenance planning work.

关键词： High-speed railway EMU train High-level maintenance planning 0-1 programming Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A fuzzy AHP-outranking framework for selecting measures of river basin management plans

引用

DESALINATION AND WATER TREATMENT 2019年第0期167卷 398-411页

作者： Spiliotis, Mike Skoulikaris, Charalampos Democritus Univ Thrace Dept Civil Engn Kimmeria Campus GR-67100 Xanthi Greece Aristotle Univ Thessaloniki Dept Civil Engn Univ Campus Thessaloniki 54124 Greece

The selection of development measures is not merely a financial issue, but crucial parameters, such as environmental protection and socioeconomic security ought to be taken into consideration. In this research, the measures proposed by the Programmes of Measures (PoMs) through the Water Framework Directive implementation process are evaluated with the use of integrated hybrid multicriteria methods. Multicriteria outranking methods are coupled with a 0/1 linear programming in which the cost of the measures is induced as a constraint. The monocriterion scores of the applied method, in which 6 criteria and 37 alternatives are integrated, are proposed for the prioritization of the supplementary PoMs. The case study area is the River Basin District of Central Macedonia, Greece. Fuzzy analytical hierarchy processes are used to determine the weights of the criteria as crisp numbers even if fuzzy pairwise comparisons among the importance of the criteria exist. The advantages of these choices are presented in the article, and the results of the research demonstrate the usefulness of the methodology when financial constraints do not permit the implementation of the whole set of measures.

关键词： Multicriteria outranking methods Fuzzy AHP 0-1 programming River Basin Management Plans Central Macedonia Water District

来源：评论

学校读者我要写书评

暂无评论

Minimal arc-sets spanning dicycles

引用

DISCRETE APPLIED MATHEMATICS 2018年 240卷 33-43页

作者： Cornaz, D. Kerivin, H. Mahjoub, A. R. Univ Paris 09 PSL Res Univ CNRS UMR 7244LAMSADE F-75016 Paris France Univ Blaise Pascal LIMOS Cornplexe Sci Cezeaux F-63173 Aubiere France Clemson Univ Dept Math Sci Clemson SC USA

We give a structural characterization of the inclusionwise minimal arc subsets whose vertices induce a subgraph containing at least one directed cycle. These arc sets arise in a linear formulation of a binary quadrati... 详细信息

关键词： Directed cycles Minimal forbidden structure Sherali-Adams's Linearization 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Modeling the Geometry and Dynamics of the Endoplasmic Reticulum Network

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018年第2期15卷 377-386页

作者： Lin, Congping Lemarchand, Laurent Euler, Reinhardt Sparkes, Imogen Univ Exeter Math Exeter Devon England UBO Univ Eurcipeenne Bretagne Lab STICC UMR 6285 Brest France Univ Exeter Biosci Exeter Devon England

The endoplasmic reticulum (ER) is an intricate network that pervades the entire cortex of plant cells and its geometric shape undergoes drastic changes. This paper proposes a mathematical model to reconstruct geometric network dynamics by combining the node movements within the network and topological changes engendered by these nodes. The network topology in the model is determined by a modified optimization procedure from the work (Lemarchand, et al. 2014) which minimizes the total length taking into account both degree and angle constraints, beyond the conditions of connectedness and planarity. A novel feature for solving our optimization problem is the use of "lifted" angle constraints, which allows one to considerably reduce the solution runtimes. Using this optimization technique and a Langevin approach for the branching node movement, the simulated network dynamics represent the ER network dynamics observed under latrunculin B treated condition and recaptures features such as the appearance/disappearance of loops within the ER under the native condition. The proposed modeling approach allows quantitative comparison of networks between the model and experimental data based on topological changes induced by node dynamics. An increased temporal resolution of experimental data will allow a more detailed comparison of network dynamics using this modeling approach.

关键词： Endoplasmic reticulum network dynamics 0-1 programming cutting planes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：