检索结果-南通市图书馆

Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Mechanical Engineering 2012年第5期25卷 990-1000页

作者： SANG Hongyan GAO Liang pan quanke State Key Lab. of Digital Manufacturing Equipment & Technology Huazhong University of Science and Technology Wuhan 430074 China School of Mathematics Science Liaocheng University Liaocheng 252059 China School of Computer Science Liaocheng University Liaocheng 252059 China

Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.

关键词： lot-streaming flowshop scheduling artificial bee colony algorithm total flowtime

Solving Multi-Area Environmental/Economic Dispatch by Pareto-Based Chemical-Reaction Optimization Algorithm

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2019年第5期6卷 1240-1250页

作者： Junqing Li quanke pan Peiyong Duan Hongyan Sang Kaizhou Gao the School of Computer Science Liaocheng UniversityLiaocheng 252059China the School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China the School of Information Science and Engineering Shandong Normal UniversityJinan 250014China the Macao Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China

In this study, we present a Pareto-based chemicalreaction optimization(PCRO) algorithm for solving the multiarea environmental/economic dispatch optimization *** objectives are minimized simultaneously, i.e., total fuel cost and emission. In the proposed algorithm, each solution is represented by a chemical molecule. A novel encoding mechanism for solving the multi-area environmental/economic dispatch optimization problems is designed to dynamically enhance the performance of the proposed algorithm. Then, an ensemble of effective neighborhood approaches is developed, and a selfadaptive neighborhood structure selection mechanism is also embedded in PCRO to increase the search ability while maintaining population diversity. In addition, a grid-based crowding distance strategy is introduced, which can obviously enable the algorithm to easily converge near the Pareto front. Furthermore,a kinetic-energy-based search procedure is developed to enhance the global search ability. Finally, the proposed algorithm is tested on sets of the instances that are generated based on realistic production. Through the analysis of experimental results, the highly effective performance of the proposed PCRO algorithm is favorably compared with several algorithms, with regards to both solution quality and diversity.

关键词： Chemical-reaction optimization algorithm gridbased crowding distance multi-area environmental/economic dispatch (MAEED) problem multi-objective optimization

A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2019年第4期6卷 904-916页

作者： Kaizhou Gao Zhiguang Cao Le Zhang Zhenghua Chen Yuyan Han quanke pan IEEE the Macao Institute of Systems Engineering at Macao University of Science and Technology 999078 China School of Computer at Liaocheng Univeristy Liaocheng252059China the Department of Industrial Systems Engineering and Management National University of SingaporeSingapore Centre for Maritime Studies National University of SingaporeSingapore the Institute for Infocomm Research(I2R) the Agency for ScienceTechnology and Research(A*STAR)Singapore the School of Computer at Liaocheng Univeristy Liaocheng 252059China School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China

Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many *** to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving *** than 60%of the publications are related to SI and *** paper intents to give a comprehensive literature review of SI and EA for solving ***,the mathematical model of FJSP is presented and the constraints in applications are ***,the encoding and decoding strategies for connecting the problem and algorithms are *** strategies for initializing algorithms?population and local search operators for improving convergence performance are ***,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are ***,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.

关键词： Evolutionary algorithm flexible job shop scheduling review swarm intelligence

A multi-swarm fruit fly optimization algorithm to minimize makespan for the hybrid flowshop problem

在线全文

学校读者我要写书评

暂无评论

A multi-swarm fruit fly optimization algorithm to minimize m...

A new latency-reducing and energy-efficient protocol for the wireless sensor network

第36届中国控制会议

作者： Junhua Duan Qingda Chen Weiqing Sun quanke pan Computation Center Shanghai University State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University) School of Mechatronic Engineering and Automation Shanghai University

ISBN: (纸本)9781538629185

This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization（FFO）, called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented MMFO algorithm are calibrated by means of a design of experiments approach. The numerical comparisons show that MFFO performs much better than several well-known metaheuristics in the literature for the considered HFS problem.

关键词： Evolutionary Algorithm Fruit Fly Optimization Hybrid Flowshop Makespan

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Frontiers of Electrical and Electronic Engineering in China 2007年第2期2卷 144-150页

作者： XIONG Junjie QU Yugui LIN Huahui pan quanke ZHAO Baohua Department of Electronic Engineering and Information Science MOEMS Key Laboratory of Multimedia Calculation and CommunicationUniversity of Science and Technology of ChinaHefei 230027China

This paper introduces a new protocol routing medium access control(RMAC)that integrates the routing and medium access control(MAC)layer *** can both reduce latency and save energy in the wireless sensor network(WSN)while most others propose protocols that sacrifice latency for *** make RMAC fit WSN better,we designed an easy and efficient routing protocol base station flooding(BSF)and then integrated it with a MAC protocol timing out MAC(TMAC)[1],while traditionally BSF and TMAC work separately at two *** call this two-layer protocol(TLP).We theoretically proved the advan-tages of RMAC over TLP and evaluated RMAC over *** simulation results show that RMAC spends half the latency of TLP,as well as consumes less energy than TLP.

关键词： WSN MAC routing energy efficient latency-reducing

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Complex System Modeling and Simulation 2021年第3期1卷 198-217页

作者： Xue Han Yuyan Han Qingda Chen Junqing Li Hongyan Sang Yiping Liu quanke pan Yusuke Nojima the School of Computer Science Liaocheng UniversityLiaocheng 252000China the State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China the School of Information Science and Engineering Shandong Normal UniversityJinan 252000China the College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China the School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China the Department of Computer Science and Intelligent Systems Osaka Prefecture UniversityOsaka 599-8531Japan

To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing *** this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup *** solve DPFSPs,significant developments of some metaheuristic algorithms are *** this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in *** to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed *** compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.

关键词： distributed permutation flow shop iterated greedy local search swapping strategy

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

解决无等待流水线调度问题的变邻域搜索算法

中国机械工程 2006年第16期17卷 1741-1743页

作者：潘全科朱剑英聊城大学聊城252059 南京航空航天大学南京210016

提出了解决无等待流水线调度问题的变邻域搜索调度算法。采用基于自然数编码的工件序列表达问题的解,采用多重Insert移动邻域和多重Swap移动邻域作为变邻域搜索的两种邻域结构。多重移动有利于算法向包含较优解的区域搜索,因而有较高的... 详细信息

提出了解决无等待流水线调度问题的变邻域搜索调度算法。采用基于自然数编码的工件序列表达问题的解,采用多重Insert移动邻域和多重Swap移动邻域作为变邻域搜索的两种邻域结构。多重移动有利于算法向包含较优解的区域搜索,因而有较高的求解质量和效率。仿真实验证明了变邻域搜索算法的有效性。

关键词：无等待流水线调度问题生产周期变邻域搜索算法多重移动

一类解决Job Shop问题的禁忌搜索算法

在线全文

学校读者我要写书评

暂无评论

中国机械工程 2006年第5期17卷 536-539页

作者：潘全科朱剑英聊城大学聊城252059 南京航空航天大学南京210016

针对Job shop问题,设计了一种改进的禁忌搜索算法(MTS算法)。MTS算法从多个初始解开始,将传统禁忌搜索算法由串行搜索结构变为并行搜索结构;采用互换和交叉两种邻域搜索函数,既有利于新邻域的探索又有利于交换信息;基于目标值的禁忌表... 详细信息

针对Job shop问题,设计了一种改进的禁忌搜索算法(MTS算法)。MTS算法从多个初始解开始,将传统禁忌搜索算法由串行搜索结构变为并行搜索结构;采用互换和交叉两种邻域搜索函数,既有利于新邻域的探索又有利于交换信息;基于目标值的禁忌表保证了群体的多样性。实验表明,MTS算法克服了传统禁忌搜索算法的缺陷,具有较高的求解质量和鲁棒性。

关键词：禁忌搜索作业调度并行结构亚试探法

在线全文

学校读者我要写书评

暂无评论

求解模糊作业车间调度问题的混合优化算法

机械工程学报 2013年第23期49卷 142-149页

作者：李俊青潘全科东北大学流程工业综合自动化国家重点实验室沈阳110819 聊城大学计算机学院聊城252059

针对模糊作业车间调度问题(Fuzzy job-shop scheduling problem,FJSSP),提出一种结合化学反应优化和禁忌搜索的混合算法(Chemical-reaction optimization and tabu search,CROTS),优化的目标是最小化最大模糊完工时间。算法采用基于工... 详细信息

针对模糊作业车间调度问题(Fuzzy job-shop scheduling problem,FJSSP),提出一种结合化学反应优化和禁忌搜索的混合算法(Chemical-reaction optimization and tabu search,CROTS),优化的目标是最小化最大模糊完工时间。算法采用基于工序的编码,通过扩展壁面碰撞、分子碰撞、合成、分解等操作算子,改进了基本化学反应优化(Chemical-reaction optimization,CRO)的四类基元反应。给出一种有效的交叉算子,并应用到分子碰撞、合成、分解三种基元反应中。对最好解进行禁忌搜索,进一步提高种群的搜索能力。结合16个经典算例试验分析,并与三种典型算法比较,验证算法具有较强的全局和局部搜索能力。通过18个随机算例的测试,验证算法具备求解较大规模问题的能力。

关键词：模糊作业车间调度化学反应优化禁忌搜索混合算法