检索结果-南通市图书馆

Cooperated Bayesian algorithm for distributed scheduling problem

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Frontiers of Electrical and Electronic Engineering in China 2006年第3期1卷 251-254页

作者： QIANG Lei XIAO Tian-yuan Department of Automation Tsinghua UniversityBeijing 100084China

This paper presents a new distributed Bayesian optimization algorithm(BOA)to overcome the efficiency problem when solving NP scheduling *** pro-posed approach integrates BOA into the co-evolutionary schema,which builds up a concurrent computing environ-ment.A new search strategy is also introduced for local op-timization *** integrates the reinforcement learning(RL)mechanism into the BOA search processes,and then uses the mixed probability information from BOA(post-probability)and RL(pre-probability)to enhance the cooperation between different local controllers,which im-proves the optimization ability of the *** ex-periment shows that the new algorithm does better in both optimization(2.2%)and convergence(11.7%),compared with classic BOA.

关键词： statistic optimization distributed scheduling Bayesian networks data mining

Proposal of distributed scheduling Heuristics Using Mediation Agent

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Energy and Power Engineering 2013年第2期7卷 381-392页

作者： Takahiro Kawamura Akihiko Ohsuga Corporate Research & Development Center Toshiba Corp. Kawasaki 212-8582 Japan Graduate School of lnformation Systems University of Electro-Communications Tokyo 182-8585 Japan

This paper proposes an agent-based distributed scheduling system against the background of the deregulation of electric utility and the smart grid for the renewable energy, and then focuses on a maintenance scheduling in the context of real problems. A synchronous backtrack algorithm, a welD-known method for distributed scheduling problems, has difficulties handling （A） rapid schedule adjustments and （B） impartial assignment. Thus, this paper proposes two kinds of heuristics：（1） parallel assignment and （2） multiple priority strategies, and developed the distributed scheduling system which makes use of the heuristics. It consists of schedulers for each power station and mediation agents which have cloning and merging functions to support the implementation of the heuristics. Finally, the result of experiment shows an improvement when handling the rapid adjustment and the impartiality issues with reasonable computational overhead.

关键词： Multi-agent distributed scheduling power management smart grid.

distributed link scheduling method with physical interference model in wireless multi-hop networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2013年第4期19卷 353-358页

作者：樊帅 Zhang Lin Feng Wei Ren Yong Department of Electronic Engineering Tsinghua University

To further increase the throughput of wireless multi-hop networks,a distributed scheduling method is proposed,which takes physical interference model into *** is assumed that nodes in the network can perform physical carrier sensing,and the carrier sensing range can be set to different *** the traditional carrier sensing mechanism,the carrier sensing range is computed under the protocol interference model,which is not *** the optimal carrier sensing range with physical interference model is *** sending node implements the distributed approach in three phases at each time slot,and all the concurrent transmissions are interference *** performance can be achieved under this scheduling *** approximation ratio of the distributed method to the optimal one is also proved.

关键词： wireless multi-hop network physical interference model distributed scheduling physical carrier sensing

Q-Learning-Assisted Meta-Heuristics for scheduling distributed Hybrid Flow Shop Problems

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第9期80卷 3573-3589页

作者： Qianyao Zhu Kaizhou Gao Wuze Huang Zhenfang Ma Adam Slowik Institute of Systems Engineering Macao University of Science and TechnologyMacao99078China Department of Electronics and Computer Science Koszalin University of TechnologyKoszalin75-453Poland

The flow shop scheduling problem is important for the manufacturing *** flow shop scheduling can bring great benefits to the ***,there are few types of research on distributed Hybrid Flow Shop Problems(DHFSP)by learning assisted *** work addresses a DHFSP with minimizing the maximum completion time(Makespan).First,a mathematical model is developed for the concerned ***,four Q-learning-assisted meta-heuristics,e.g.,genetic algorithm(GA),artificial bee colony algorithm(ABC),particle swarm optimization(PSO),and differential evolution(DE),are *** to the nature of DHFSP,six local search operations are designed for finding high-quality solutions in local *** of randomselection,Q-learning assists meta-heuristics in choosing the appropriate local search operations during ***,based on 60 cases,comprehensive numerical experiments are conducted to assess the effectiveness of the proposed *** experimental results and discussions prove that using Q-learning to select appropriate local search operations is more effective than the random *** verify the competitiveness of the Q-learning assistedmeta-heuristics,they are compared with the improved iterated greedy algorithm(IIG),which is also for solving *** Friedman test is executed on the results by five *** is concluded that the performance of four Q-learning-assisted meta-heuristics are better than IIG,and the Q-learning-assisted PSO shows the best competitiveness.

关键词： distributed scheduling hybrid flow shop meta-heuristics local search Q-learning

distributed fair queuing algorithm based on compensation coordination scheduling in WMN

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2012年第3期18卷 314-320页

作者： Jiang Fu Peng Jun Kuo Chi LIN School of Information Science and Engineering Central South University Changsha 410075 P. R. China College of Engineering and Computer Science University of Central Florida Orlando Florida USA 32816

This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.

关键词： wireless mesh network (WMN) fair queuing distributed scheduling fairness

Multi-objective Optimization of the distributed Permutation Flow Shop scheduling Problem with Transportation and Eligibility Constraints

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2018年第3期6卷 391-416页

作者： Shuang Cai Ke Yang Ke Liu Academy of Mathematics and Systems Science Chinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Key Laboratory of Management Decision and Information SystemsChinese Academy of SciencesBeijing 100190China National Center for Mathematics and Interdisciplinary Sciences Chinese Academy of SciencesBeijing 100190China

In this paper,we consider the distributed permutation flow shop scheduling problem(DPFSSP)with transportation and eligibility *** objectives are taken into account,i.e.,makespan,maximum lateness and total costs(transportation costs and setup costs).To the best of our knowledge,there is no published work on multi-objective optimization of the DPFSSP with transportation and eligibility ***,we present the mathematics model and constructive heuristics for single objective;then,we propose an improved The Nondominated Sorting Genetic Algorithm II(NSGA-II)for the multi-objective DPFSSP to find Pareto optimal solutions,in which a novel solution representation,a new population re-/initialization,effective crossover and mutation operators,as well as local search methods are *** on extensive computational and statistical experiments,the proposed algorithm performs better than the well-known NSGA-II and the Strength Pareto Evolutionary Algorithm 2(SPEA2).

关键词： Multi-objective optimization distributed scheduling Permutation flow shop scheduling Transportation NSGA-II

An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An iterated greedy algorithm for the distributed permutation...

An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance

第三十九届中国控制会议

作者： Jiayang Mao XiaoLu Hu Quan-ke Pan Zhonghua Miao Chuangxin He M Fatih Tasgetiren School of Mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

In recent years,the distributed permutation flowshop scheduling problem（DPFSP） has been widely *** this paper,we extended the DPFSP by considering preventive maintenance（PM） operation to prevent machines from breaking down after the long *** iterated greedy（IG） algorithm is developed to minimize total flowtime.A heuristic with swapping operator is proposed to initialize the *** that,the destruction phase and construction phase are modified to fit our problem.A local search is then applied to further improve the solution generated in the construction *** last,a simple simulated annealing-like acceptance criterion is used to prevent local optimal *** with three state-of-the art algorithms in the recent literature based on 225 instances shows the high performance of our IG algorithm for solving the DPFSP with PM operation.

关键词： distributed scheduling Flowshop Preventive maintenance

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

An improved discrete artificial bee colony algorithm for the...

A CENTRAL-STAGE BUFFERED THREE-STAGE CLOS SWITCHING FABRIC AND THE scheduling ALGORITHM

第三十九届中国控制会议

作者： Jiayang Mao XiaoLu Hu Quan-ke Pa Zhonghua Miao Chuangxin He M Fatih Tasgetiren School of Mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

The distributed permutation flowshop scheduling problem with preventive maintenance operator（PM/DPFSP） is closely related to modern *** paper presents an improved discrete artificial bee colony（IDABC） algorithm for solving this *** criterion to be optimized is the *** improved NEH heuristic method is proposed to initialize the population *** adapted a local search method with insertion and swap operator to produce neighboring solutions in employ bee phase and onlooker bee phase.A global search method with destruction and reconstruction phase is introduced to avoid local optima in scout bee *** parameters for the proposed IDABC are calibrated by means of a design of experiments and analysis of *** conduct extensive experiments to test the performance of *** results indicate that IDABC has promising advantages on PM/DPFSP.

关键词： distributed scheduling Flowshop Preventive maintenance Artificial bee colony

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2009年第1期26卷 113-119页

作者： Hu Yuxiang Ma Xiangjie Lan Julong Wang Haoxue National Digital Switching System Engineering ＆ Technological R＆D Center Zhengzhou 450002 China

Current MSM switching fabric has poor performance under unbalanced traffic. This paper presents an alternative, novel Central-stage Buffered Three-stage Clos switching (CB-3Clos) fabric and proves that this fabric can emulate output queuing switch without any speedup. By analyzing the condition to satisfy the central-stage load-balance, this paper also proposes a Central-stage Load-balanced-based distributed scheduling algorithm (CLDS) for CB-3Clos. The results show that, compared with Concurrent Round-Robin based Dispatching (CRRD) algorithm based on MSM, CLDS algorithm has high throughput irrespective with the traffic model and better performance in mean packet delay.

关键词： Three-stage Clos switching fabric Central-stage buffered distributed scheduling Loadbalance