检索结果-南通市图书馆

General Pattern and neighborhood search Algorithms for Non-Convex Unit Commitment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Electricity 2014年第2期25卷 21-28,35页

作者： Li Jinghua Lan Fei College of Electric Engineering Guangxi University

This paper presents a new approach to solve mixed-variable unit commitment(UC) problems with non-smooth cost functions based on a generalized pattern search filter(GPS-filter) algorithm. A GPS-filter algorithm does not require any information about the gradient of the objective function while searching for an optimum solution. At the same time, it is available for solving mixed-variable optimization problems, which is very suitable for UC. A new suitable discrete neighborhood structure with UC characteristics is proposed to improve GPS-filter efficiently. A lot of multiple units' states are fixed before search; hence, the polling search of discrete variable is efficient for a few uncertain units. Numerical experiments are included to demonstrate the proposed approach's ability to handle the highly nonlinear, discontinuous, non-smooth cost functions and mixed variables of the UC problem.

关键词： optimal power system operation pattern search method filter method unit commitment neighborhood search

维普期刊数据库

Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search

在线全文

学校读者我要写书评

暂无评论

Hybrid flow shop scheduling with assembly operations and key...

Intelligent Optimization Under Multiple Factories: Hybrid Flow Shop Scheduling Problem with Blocking Constraints Using an Advanced Iterated Greedy Algorithm

第30届中国控制与决策会议

作者： Cong Lv Deming Lei Wuhan University of Technology

In this study hybrid flow shop scheduling problem（HFSP） with unrelated parallel machines and assembly operations is considered, in which two tardiness objectives are minimized as key ones under the bounded condition that makespan is not allowed to exceed an upper bound. A novel neighborhood search with memory and global exchange（NSMG） is then proposed based on a part-based representation and a new dominance called limited dominance. Global exchange is cooperated with neighborhood search to improve solution quality. Extensive experiments are conducted to test the performance of NSMG finally. The results show that the preferential handling strategy of key objectives is reasonable and effective and NSMG is a very competitive method for the considered HFSP.

关键词： Hybrid flow shop scheduling neighborhood search Assembly operation Key objective Limited dominance

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Complex System Modeling and Simulation 2023年第4期3卷 282-306页

作者： Yong Wang Yuting Wang Yuyan Han Junqing Li Kaizhou Gao Yusuke Nojima School of Computer Science Liaocheng UniversityLiaocheng 252000China School of Computer Science Shandong Normal UniversityJinan 252000China Macao Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China Department of Computer Science and Intelligent Systems Osaka Prefecture UniversityOsaka 599-8531Japan

The distributed hybrid flow shop scheduling problem(DHFSP),which integrates distributed manufacturing models with parallel machines,has gained significant ***,in actual scheduling,some adjacent machines do not have buffers between them,resulting in *** paper focuses on addressing the DHFSP with blocking constraints(DBHFSP)based on the actual production *** solve DBHFSP,we construct a mixed integer linear programming(MILP)model for DBHFSP and validate its correctness using the Gurobi ***,an advanced iterated greedy(AIG)algorithm is designed to minimize the makespan,in which we modify the Nawaz,Enscore,and Ham(NEH)heuristic to solve blocking *** balance the global and local search capabilities of AIG,two effective inter-factory neighborhood search strategies and a swap-based local search strategy are ***,each factory is mutually independent,and the movement within one factory does not affect the *** view of this,we specifically designed a memory-based decoding method for insertion operations to reduce the computation time of the ***,two shaking strategies are incorporated into the algorithm to mitigate premature *** advanced algorithms are used to conduct comparative experiments with AIG on 80 test instances,and experimental results illustrate that the makespan and the relative percentage increase(RPI)obtained by AIG are 1.0%and 86.1%,respectively,better than the comparative algorithms.

关键词： blocking distributed hybrid flow shop neighborhood search iterated greedy algorithm

ANALYSIS OF AFFECTIVE ECG SIGNALS TOWARD EMOTION RECOGNITION

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2010年第1期27卷 8-14页

作者： Xu Ya Liu Guangyuan Hao Min Wen Wanhui Huang Xiting School of Electronic and Information Engineering Southwest University Chongqing 400715 China School of Psychology Southwest University Chongqing 400715 China

Recently,as recognizing emotion has been one of the hallmarks of affective computing,more attention has been paid to physiological signals for emotion *** paper presented an approach to emotion recognition using ElectroCardioGraphy(ECG) signals from multiple *** collect reliable affective ECG data,we applied an arousal method by movie clips to make subjects experience specific emotions without external *** precise location of P-QRS-T wave by continuous wavelet transform,an amount of ECG features was extracted *** feature selection is a combination optimization problem,Improved Binary Particle Swarm Optimization(IBPSO) based on neighborhood search was applied to search out effective features to improve classification results of emotion states with the help of fisher or K-Nearest Neighbor(KNN) *** the experiment,it is shown that the approach is successful and the effective features got from ECG signals can express emotion states excellently.

关键词： Emotion recognition ElectroCardioCraphy (ECG) signal Continuous wavelet transform Improved Binary Particle Swarm Optimization (IBPSO) neighborhood search

维普期刊数据库

Open pit waste removal optimization through equipment fleet scheduling

在线全文

学校读者我要写书评

暂无评论

Transactions of Nonferrous Metals Society of China 2017年第12期27卷 2682-2690页

作者： Xiao-wei GU Qing WANG Xiao-chuan XU Jian-ping LIU Tai-wei SUN Kun DU College of Resource and Civil Engineering Northeastern University Shenyang 110819 China Dongmei Foundation Company of Shenyang Shenyang 110016 China

A neighborhood search algorithm was proposed to simultaneously schedule the waste removal quantity and the equipment fleet profile over the mine life for open pit *** initial search domain was first defined and a good schedule was obtained as the current best schedule by searching in this ***,progressively narrower neighborhood search domains were constructed around the current best schedule to search for better *** objective is to minimize the present value of waste removal costs over the mine *** resulting schedule from this algorithm provides a complete fleet profile for each year over the mine life:the selected equipment models,the number of equipment units of each model,the age of each unit,as well as the quantity of waste removed.A numerical example of application was provided to demonstrate the feasibility and merits of the algorithm.

关键词： open pit waste removal equipment fleet scheduling neighborhood search

维普期刊数据库

A neighborhood Structure for the CMST Problem

在线全文

学校读者我要写书评

暂无评论

A Neighborhood Structure for the CMST Problem

Modeling and optimizing of flexible mixed-flow assembly line scheduling problem with non-tight operations priority constraints

International Conference on Machine Learning and Computing（ICMLC 2009）

作者： Jun Han Ming Lei Xiang Long Dianfu Ma Xin Wei School of Computer Science and Engineering Beihang University China

This paper studies the capacitated minimum spanning tree（CMST） problem,which is one of the most fundamental and significant problems in the optimal design of communication networks.A new neighborhood structure is proposed by analyzing the features of the optimal solution of the CMST problem.A new neighborhood search algorithm based on the new neighborhood structure and certain new searching methods is designed and *** experiments showing the effectiveness of the new algorithm on benchmark instances are given.

关键词： CMST Heuristic Algorithm neighborhood search Tabu search

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Modeling and optimizing of flexible mixed-flow assembly line...