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

Scheduling Model for the Practical Steelmaking-continuous Casting Production and heuristic algorithm Based on the Optimization of "Furnace-caster Matching" Mode

引用

ISIJ INTERNATIONAL 2020年第6期60卷 1213-1224页

作者： Yang, Jian-ping Wang, Bai-lin Liu, Qian Guan, Min Li, Tie-ke Gao, Shan Guo, Wei-da Liu, Qing Univ Sci & Technol Beijing State Key Lab Adv Met Beijing 100083 Peoples R China Univ Sci & Technol Beijing Engn Res Ctr MES Technol Iron & Steel Prod Beijing 100083 Peoples R China Jiangsu Boji Spraying Syst Co Ltd Yangzhou 225267 Jiangsu Peoples R China Laiwu Iron & Steel Grp Yinshan Sect Steel Co Ltd Jinan 271104 Shandong Peoples R China

Considering the "furnace-caster matching" modes, this paper focuses on the scheduling problems from practical steelmaking-continuous casting production lacking refining span. Aiming at the improvement on quality and output of steel products, a mathematical model is established with multi-objective optimization including the minimum earliness/tardiness of starting cast times, the shortest waiting times of heats among different processes and the shortest idle times of converters. A heuristic algorithm based on the optimization of "furnace-caster matching" mode is developed to solve this model, which involves two procedures of device assignment and conflict elimination. Through the detailed analysis on workshop layout and production rhythm, four classes of matching modes of "refining furnace-caster" are proposed to perform the assignments of refining furnaces. The assignments of converters rely on three categories of greedy strategies in terms of minimizing conflictions among heats. A rough scheduling solution with some possible conflicts among heats is obtained through combining "furnace-caster matching" modes and greedy strategies. Then applying the linear programming method to eliminate the conflicts and generate the final solution. Based on the proposed algorithm and the improved genetic algorithms, simulation experiments are carried out by introducing actual production plans as instances. The results indicate that heuristic algorithm based on the optimization of "furnace-caster matching" mode is the right candidate owing to its acceptable scheduling solutions with the better process matching relations and the highlighted performances under crane constraint. Currently, the proposed model and algorithm have been successfully used in a large converter steel plant in China.

关键词： steelmaking-continuous casting workshop layout scheduling model heuristic algorithm furnace-caster matching

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT heuristic algorithm FOR TWO-DIMENSIONAL RECTANGULAR PACKING PROBLEM WITH CENTRAL RECTANGLE

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2020年第1期16卷 495-510页

作者： Chen, Mao Tang, Xiangyang Zeng, Zhizhong Liu, Sanya Cent China Normal Univ Natl Engn Res Ctr E Learning Wuhan 430079 Hubei Peoples R China

This paper presents a heuristic algorithm for solving a specific NP-hard 2D rectangular packing problem in which a rectangle called central rectangle is required to be placed in the center of the final layout, and the aspect ratio of the container is also required to be in a given range. The key component of the proposed algorithm is a greedy constructive procedure, according to which, the rectangles are packed into the container one by one and each rectangle is packed into the container by an angle-occupying placement with maximum fit degree. The proposed algorithm is evaluated on two groups of 35 well-known benchmark instances. Computational results disclose that the proposed algorithm outperforms the previous algorithm for the packing problem. For the first group of test instances, solutions with average filling rate 99.31% can be obtained;for the real-world layout problem in the second group, the filling rate of the solution is 94.75%.

关键词： Optimization heuristic algorithm 2D rectangular packing problem central rectangle angle-occupying placement

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for Extending Lifetime of Wireless Sensor Network

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2013年第12期10卷 2853-2859页

作者： Qiu, Yinghui North China Elect Power Univ Sch Elect & Elect Engn Beijing 102206 Peoples R China

Wireless sensor network can be employed in many applications, such as military, environmental surveillance and healthcare. Due to the limited resources of the sensor nodes, energy efficiency issue is one of the most critical issues for WSN. The purpose of many researches is to prolong lifetime of sensor network. Lifetime is times that the sink can collect data from all sensor nodes. When a user proposes a query, then the sink gathers data from all sensor nodes. One effective approach is to partition sensors into several covers, each of which must include all targets, and then to activate these covers iteratively. The problem of finding the maximum number of covers has been modeled as the SET K-COVER problem, which has been proved to be NP-complete problem. In order to prolong lifetime of WSN, this work proposes an efficient heuristic algorithm to solve this problem. The algorithm was implemented in a wires sensor network simulator and some extensive experiment was conducted. The simulation results on numerous problem instances confirm that the effectiveness of the proposed algorithm in extending the lifetime of WSN.

关键词： heuristic algorithm Wireless Sensor Network Coverage Lifetime Extension

来源：评论

学校读者我要写书评

暂无评论

A two stage heuristic algorithm for the integrated aircraft and crew schedule recovery problems

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2015年 87卷 436-453页

作者： Zhang, Dong Lau, H. Y. K. Henry Yu, Chuhang Univ Hong Kong Hong Kong Hong Kong Peoples R China

Airline disruptions incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated aircraft and crew schedule recovery problem. A two stage heuristic algorithm for the integrated recovery problem is proposed. In the first stage, the integrated aircraft recovery and flight-rescheduling model with partial crew consideration is built. This model is based on the traditional multi-commodity network model for the aircraft schedule recovery problem. The objective of this model also includes minimization of the original crew connection disruption. In the second stage, the integrated crew schedule recovery and flight re-scheduling model with partial aircraft consideration is built. We proposed a new multi-commodity model for the crew schedule recovery. The main advantage of such model is that it is much more efficient to integrate the flight-scheduling and aircraft consideration. New constraints are incorporated to guarantee that the aircraft connections generated in the stage 1 are still feasible. Two stages are run iteratively until no improvement can be achieved. Experimental results show that our method can provide better recovery solutions compared with the benchmark algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Airline schedule recovery Airline rescheduling Disruption management heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

LTHS: A heuristic algorithm based on local two-hop search strategy for influence maximization in social networks

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2021年第2期41卷 3161-3172页

作者： Qiu, Liqing Yang, Zhongqi Zhu, Shiwei Gu, Chunmei Tian, Xiangbo Shandong Univ Sci & Technol Coll Comp Sci & Engn Shandong Prov Key Lab Wisdom Mine Informat Techno Qingdao Peoples R China Qilu Univ Technol Shandong Acad Sci Jinan Peoples R China Shandong Acad Sci Informat Res Inst Jinan Peoples R China Natl Tech Univ Ukraine Igor Sikorsky Kyiv Polytech Inst Kiev Ukraine

Influence maximization is a classic network optimization problem, which has been widely used in the field of viral marketing. The influence maximization problem aims to find a fixed number of active nodes. After a specific propagation model, the number of active nodes reaches the maximum. However, the existing influence maximization algorithms are overly pursuing certain indicators of efficiency or accuracy, which cannot be well accepted by some researchers. This paper proposes an effective algorithm to balance the accuracy and efficiency of the influence maximization problem called local two-hop search algorithm (LTHS). The core of the proposed algorithm is a node not only be affected by one-hop neighbor nodes, but also by two-hop neighbor nodes. Firstly, this paper selects initial seed nodes according to the characteristics of the node degree. Generally, the high degree of nodes regards as influential nodes. Secondly, this paper proposes a node two-hop influence evaluate function called two-hop diffusion value (THDV), which can evaluate node influence more accurately. Furthermore, in order to seek higher efficiency, this paper proposes a method to reduce the network scale. This paper conducted full experiments on five real-world social network datasets, and compared with other four well-known algorithms. The experimental results show that the LTHS algorithm is better than the comparison algorithms in terms of efficiency and accuracy.

关键词： Social network influence maximization local influence heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fast heuristic algorithm for Ladle Scheduling Based on Vehicle Routing Problem with Time Windows Model

引用

ISIJ INTERNATIONAL 2014年第11期54卷 2588-2597页

作者： Wei, Zheng Zhu, Tan He, Tianzhang Liu, Shixin Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Tsinghua Univ Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

In the process of steelmaking and continuous casting production, an optimized ladle schedule will greatly reduce energy consumption and improve production. The ladle scheduling problem can be modeled as vehicle routing problem with time windows (VRPTW) and extra constraints. The main extra constraint is that components of the ladle, at the right time, have to be repaired no later than serving certain number of heats. The objective of ladle scheduling problem is minimizing the number of serving ladles and reducing the waiting time between serving two adjacent heats. According to the serving process of ladles, a mathematical model is established to solve this specific problem. In this paper, a three-step heuristic algorithm with time complexity of O(n(2)) is proposed, which is based on characteristics of the model and some preliminary experiments. The algorithm has been tested by several practical instances from a steel plant in China. Comparing with the schedules used in actual production, the computational results show that our algorithm optimizes the ladle schedules and solves the problem in less than 1 second, which proves the algorithm's efficiency.

关键词： steelmaking and continuous casting ladle scheduling VRPTW heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for robustly stable generalized disturbance observer synthesis with closed loop consideration

引用

ISA TRANSACTIONS 2019年 90卷 147-156页

作者： Xiang, Guofei Su, Jianbo Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China

This paper investigate the problem of disturbance observer (DOB) based disturbance rejection control with closed loop performance guaranteed. A generalized DOB based control framework is presented. Specifically, the novel DOB framework if obtained by taking advantage of Youla factorization of a two degree-of-freedom controller in a nontraditional way. Closed loop analysis clarifies that generalized DOB inherits advantages of the traditional one, while mitigating its restrictions. Through appropriate reconfiguration, the Q-filter synthesizing is transformed into reduced-order controller designing. By taking advantage of the Kalman-Yakubovich-Popov (KYP) lemma and projection lemma, a two-stage heuristic algorithm is proposed: an initial full information controller is firstly established for the reconfigured system, which is used to heuristically obtain the reduced-order controller by alternately solving LMIs in the second stage. Finally, we illustrate the application of these results to minimum phase and non-minimum phase plants. Elaborated comparisons between the two-stage heuristic algorithm based generalized DOB and the state-of-art H-infinity based DOB are conducted, the results verify the effectiveness and advantages. (C) 2019 ISA. Published by Elsevier Ltd. All rights reserved.

关键词： Generalized disturbance observer Youla parametrization Kalman-Yakubovich-Popov (KYP) lemma heuristic algorithm Linear Matrix Inequality (LMI)

来源：评论

学校读者我要写书评

暂无评论

Mobile edge server placement based on meta-heuristic algorithm

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2021年第5期40卷 8883-8897页

作者： Guo, Feiyan Tang, Bing Zhang, Jiaming Hunan Univ Sci & Technol Sch Comp Sci & Engn Xiangtan 411201 Peoples R China Wuhan Univ Technol Sch Entrepreneurship Wuhan Peoples R China Wuhan Univ Technol Sch Informat Engn Wuhan Peoples R China

The rapid development of the Internet of Things and 5G networks have generated a large amount of data. By offloading computing tasks from mobile devices to edge servers with sufficient computing resources, network congestion and data transmission delays can be effectively reduced. The placement of edge server is the core of task offloading and is a multi-objective optimization problem with multiple resource constraints. Efficient placement approach can effectively meet the needs of mobile users to access services with low latency and high bandwidth. To this end, an optimization model of edge server placement has been established in this paper through minimizing both communication delay and load difference as the optimization goal. Then, an Edge Server placement based on meta-heuristic algorithm (ESH-GM) has been proposed to achieve multi-objective optimization. Firstly, the K-means algorithm is combined with the ant colony algorithm, and the pheromone feedback mechanism is introduced into the placement of edge servers by emulating the mechanism of ant colony sharing pheromone in the foraging process, and the ant colony algorithm is improved by setting the taboo table to improve the convergence speed of the algorithm. Then, the improved heuristic algorithm is used to solve the optimal placement of edge servers. Experimental results using Shanghai Telecom's real datasets show that the proposed ESH-GM achieves an optimal balance between low latency and load balancing, while guaranteeing quality of service, which outperforms several existing representative approaches.

关键词： Mobile edge computing server placement heuristic algorithm performance optimization

来源：评论

学校读者我要写书评

暂无评论

Interruptible charge scheduling of plug-in electric vehicle to minimize charging cost using heuristic algorithm

引用

ELECTRICAL ENGINEERING 2022年第3期104卷 1425-1440页

作者： Mohammed, S. Sheik Ahamed, T. P. Imthias Aleem, Shady H. E. Abdel Omar, Ahmed, I TKM Coll Engn Elect & Elect Engn Dept Kollam India Sci Valley Acad Valley High Inst Engn & Technol Dept Elect Engn Qalyubia 44971 Egypt Higher Inst Engn El Shorouk City Elect Power & Machines Engn El Shorouk City Egypt

In recent times, transportation electrification has been recognized as one of the key solutions to accelerate global GHG emission reductions. As the electric vehicle industry grows faster, plug-in electric vehicles (PEV) are expected to be the most dominant load in the utility sector in less than a decade. Regular charging of the battery energy storage system (BESS) is a mandate for the continued operation of the vehicle, and the PEVs are connected to the utility to charge. Since PEVs are mobility loads, predicting the interconnection of these mobility loads in the utility network for recharging is a major challenge. The intermittent connection of mobility loads to the grid for charging leads to an unpredictable increase in electricity demand and other grid-related issues. Optimal scheduling of PEV charging would conquer the grid-related issues and provide financial benefits to the users. In this paper, an intelligent charge scheduling technique of PEV charging for both residential and commercial charging stations using the heuristic algorithm is proposed and discussed. The primary objective of the algorithm is to achieve the minimization of PEV charging costs by implementing an interrupted charging schedule. The proposed algorithm is tested by conducting exhaustive simulation studies under several conditions for PEVs with different power ratings for residential and commercial charging scenarios. The time-of-use pricing (ToUP) system is adopted as a tariff system in this paper. A detailed comparison of the unscheduled algorithm, the modified placement algorithm (MPA) and proposed heuristic technique-based charge scheduling is carried out through simulation studies. A detailed cost analysis for charging the PEVs with the selected charge scheduling techniques for various conditions is conducted and cost minimization by implementing the proposed charging scheme is validated.

关键词： Plug-in electric vehicle (PEV) Optimization Charge scheduling heuristic algorithm Interrupted scheduling Time-of-use pricing (ToUP) Modified placement algorithm (MPA)

来源：评论

学校读者我要写书评

暂无评论

An efficient heuristic algorithm for the capacitated median problem

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2013年第3期11卷 229-248页

作者： Yaghini, Masoud Momeni, Mohsen Sarmadi, Mohammadreza Ahadi, Hamid Reza Iran Univ Sci & Technol Sch Railway Engn Dept Rail Transportat Engn Tehran Iran

The capacitated -median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity limit. This paper presents an efficient heuristic algorithm based on the local branching and relaxation induced neighborhood search methods for the CPMP. The proposed algorithm is a heuristic technique that utilizes a general mixed integer programming solver to explore neighborhoods. The parameters of the proposed algorithm are tuned by design of experiments. The proposed method is tested on a large set of benchmark instances. The results show that the method outperforms the best method found in the literature.

关键词： Location-allocation problem Capacitated p-median problem heuristic algorithm Local branching algorithm Relaxation induced neighborhood search method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：