检索结果-南通市图书馆

Multi-Objective Teaching-Learning-Based Optimizer for a Multi-Weeding Robot Task Assignment Problem

Tsinghua Science and Technology 2024年第5期29卷 1249-1265页

作者： Nianbo Kang Zhonghua Miao quan-ke pan Weimin Li M.Fatih Tasgetiren School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200444China School of Computer Engineering and Science Shanghai UniversityShanghai 200444China Industrial Engineering Department Baskent UniversityAnkara 06790Türkiye

With the emergence of the artificial intelligence era,all kinds of robots are traditionally used in agricultural ***,studies concerning the robot task assignment problem in the agriculture field,which is closely related to the cost and efficiency of a smart farm,are ***,a Multi-Weeding Robot Task Assignment(MWRTA)problem is addressed in this paper to minimize the maximum completion time and residual herbicide.A mathematical model is set up,and a Multi-Objective Teaching-Learning-Based Optimization(MOTLBO)algorithm is presented to solve the *** the MOTLBO algorithm,a heuristicbased initialization comprising an improved Nawaz Enscore,and Ham(NEH)heuristic and maximum loadbased heuristic is used to generate an initial population with a high level of quality and *** effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule.A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the ***,a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the *** results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.

关键词： genetic algorithm heuristic algorithm Multi-Weeding Robot Task Assignment(MWRTA) teaching optimization algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers

An effective invasive weed optimization algorithm for the fl...

引用

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

作者： Hong-yan Sang quan-ke pan School of Mathematics Science Liaocheng University State key Laboratory of Synthetical Automation for Process Industries Northeastern University College of Computer Science Liaocheng University

ISBN: (纸本)9781467355322

The flow shop scheduling problem with intermediate bffers has important applications in modern industry. This paper addresses this problem with the objective of minimizing the makespan and presents an effective discrete IWO （DIWO） algorithm. In the proposed DIWO, a Nawaz-Enscore-Ham heuristic is used to generate an initial solution with a certain level of quality. An improved IWO-search mechanism is utilized to evolve in the global space. An efficient local search algorithm is embedded in the algorithm to enhance exploitation. Computational experiments demonstrate the effectiveness of the proposed DIWO algorithm for solving the problem.

关键词： Flow shop with intermediate buffers Makespan Discrete invasive weed optimization Local search

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Speed-up Method for calculating total flowtime in permutation flow shop scheduling problem

A Speed-up Method for calculating total flowtime in permutat...

引用

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

作者： Jun-hua Duan Yu-Jie Yang Kai-zhou Gao Jun-qing Li quan-ke pan School of computer science Liaocheng University Network and Informatin Center Liaocheng University State key Laboratory of Synthetical Automation for Process Industries (Northeastern University)

ISBN: (纸本)9781467355339

Permutation flow shop scheduling problem with total flowtime criterion has been increasingly dealt with in recent years. A number of heuristics and metaheuristics have been developed for this problem. However, the calculation of total flow time for job permutations spends too much computational time in the algorithms. To address to this problem, Li et al [OMEGA, 2009, 37:155-164] presented a general flowtime computing method and proved its effectiveness. This paper proposes an improvement for the general flowtime computing method. The computation experiments based on the well-known benchmarks are provided. It is shown that the presented speed-up method is of effectiveness for the problem considered.

关键词： Flow shop scheduling total flowtime speed-up heuristics

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

An Effective Fruit Fly Optimization for the Distributed Assembly Flowshop Scheduling Problem

An Effective Fruit Fly Optimization for the Distributed Asse...

引用

第37届中国控制会议

作者： Yi-Ran pan Qing-Da Chen quan-ke pan Shanghai Xingzhi Experimental Middle School State key Laboratory of Synthetical Automation for Process Industries Northeastern University School of Mechatronic Engineering and Automation Shanghai University

The distributed assembly flowshop scheduling problem has important applications in modern industries. For solving the problem with the objective of minimizing total flowtime, this paper proposes an effective fruit fly optimization（FFO） algorithm with a number of parallel swarms, each of which has its own osphresis foraging and vision foraging stages. The swarms are initialized by a LPT-based heuristic and find food sources using a hybrid operator which is a combination of the product-based and part-based insertion operators. A specific relinking procedure is presented to improve the cooperative search capability. To evaluate the proposed algorithm, we conduct a comprehensive set of computational and statistical experiments based on 910 benchmark instances. The results show that the proposed FFO algorithm performs significantly better than the existing methods in comparison.

关键词： Fruit Fly Optimization Cooperative Search Evolutionary Algorithm Flowshop Assembly Scheduling

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A hybrid Pareto-based algorithm for multi-objective resource allocation problem

A hybrid Pareto-based algorithm for multi-objective resource...

引用

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

作者： Jun-qing Li quan-ke pan Kun Mao State key Laboratory of Synthetic Automation for Process Industries Northeastern University College of Computer Science Liaocheng University

This paper introduces a hybrid algorithm combining discrete harmony search（DHS） and iterated local search（ILS） for solving the multi-objective resource allocation problem（RAP）. Two objectives are considered simultaneously, i.e. minimization of the overall cost and overall efficiency. The harmony search algorithm is used to conduct the global exploration task, while the iterated local search performs the exploitation work. In addition, an external Pareto archive set was introduced to memory the non-dominated solutions found so far. Experimental results on the well-known benchmarks verify the efficiency and effectiveness of the propose algorithm.

关键词： Harmony search resource allocation problem Pareto archive set multi-objective optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

An Iterated Greedy Algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization

An Iterated Greedy Algorithm for Distributed Blocking Flowsh...

引用

第三十九届中国控制会议

作者： Shuai Chen quan-ke pan XiaoLu Hu 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 this paper, we study a distributed blocking flowshop scheduling problem（DBFSP） that is an extension of the traditional blocking flowshop scheduling problem（BFSP）, in which an additional decision of which factory to process each job. We propose an iterated greedy（IG） algorithm to minimize makespan among all the factories. First of all, an effective initialization method based on the PW algorithm is used in order to make better use the problem-specific characteristics. Then, an enhanced construction method is developed to further improve the solution obtained at each iteration. At last, after calibration of algorithm parameters, comparison of algorithms is carried out using the well-known 720 instances from the literature. The results demonstrate the effectiveness of the proposed IG algorithm for solving the DBFSP with makespan criterion.

关键词： distributed flowshop scheduling blocking iterated greedy algorithm makespan

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

NEH-Based heuristics for the distributed blocking flowshop with makespan criterion

NEH-Based heuristics for the distributed blocking flowshop w...

引用

第三十九届中国控制会议

The distributed blocking flowshop scheduling problem（DBFSP） that is an important generalization of the traditional blocking flowshop scheduling problem（BFSP）, in which the blocking constraint has to be considered. The NEH heuristic is regarded as the best constructive heuristic for the permutation flowshop scheduling problem. Naderi and Ruiz proposed the NEH2 for the distributed permutation flowshop scheduling problem by adding a factory assignment rule to the Nawaz-Enscore-Ham（NEH） heuristic. In this paper, a priority rule is first presented for generating initial sequence for the NEH2. Then, the proposed rescheduling operator is applied in NEH insertion procedure. Additionally, we generated a sequence containing all job twice, and then the solution for the problem is constructed by applying the NEH insertion procedure on each element of the sequence. Based on the above ideas we proposed three NEH-based heuristics, namely NEH2 E, NEH2 Een and NEH2 EE. Computational results demonstrate that the proposed heuristics perform significantly better than the original NEH2.

关键词： distributed flowshop scheduling heuristic blocking NEH makespan

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

An iterated local search algorithm for distributed permutation flowshop group scheduling problems with total flowtime minimization

An iterated local search algorithm for distributed permutati...

引用

第40届中国控制会议

作者： Hui Zhao Yu-Fan Liu quan-ke pan Yuan-Zhen Li School of Mechanical and Electrical Engineering and Automation Shanghai University International School Beijing University of Posts and Telecommunications

Distributed permutation flowshop group scheduling problem(DPFGSP) is studied in this paper. This problem can be regarded as a combination of the distributed flowshop scheduling and group scheduling. An improved iterated local search(dILS)algorithm is proposed to minimize the total flowtime. First of all, we use a simple heuristic algorithm based on the famous NEH heuristics to generate an initial solution. Next, we use the solutions obtained from two different neighborhoods to perform an iterated local search. The acceptance criterion is the simulated-annealing type with a constant temperature. Finally, the proposed dILS algorithm is compared with the existing VND algorithm based on the 810 benchmark instances. The experimental results show that the proposed dILS algorithm has significant advantages in solving the DPFGSP under consideration.

关键词： Iterated local search Distributed permutation flowshop group scheduling Total flowtime

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Effective heuristics for the distributed permutation flowshop scheduling problem with release dates

Effective heuristics for the distributed permutation flowsho...

引用

第40届中国控制会议

作者： Biao Han Yu-Fan Liu quan-ke pan Yuan-Zhen Li School of Mechatronic Engineering and Automation Shanghai University International School Beijing University of Posts and Telecommunications

In recent years,the distributed permutation flowshop scheduling problem（DPFSP） has become a hotspot in *** this paper,we change several heuristics for a single factory to the heuristics for a multi-factory environment to solve the DPFSP with total completion time（TCT） ***,these distributed heuristics are improved to deal with the minimization of the TCT for the DPFSP with release dates by modifying the initialization procedure and local search ***,we calculate 720 instances and compare our proposed heuristics and those from the recent *** results indicate the superiority of the presented heuristics for the problem considered.

关键词： Distributed flowshop scheduling Heuristic Release dates Total completion time

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A New Heuristic for PCBs Grouping Problem with Setup Times

A New Heuristic for PCBs Grouping Problem with Setup Times

引用

第三十九届中国控制会议

作者： Jiang-Ping Huang quan-ke pan M Fatih Tasgetiren Ying-Ying Huang School of Mechatronic Engineering and Automation Shanghai University International logistics management department Yasar University

In this paper, we present a new heuristic to divide a batch of printed circuit boards(PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic, we propose several concepts about similarity to make the number of groups as few as possible. To better show the relationship between the PCB types and the component types of a group, we introduce a new solution representation. In addition, considering the characteristics of the PCBs grouping problem(PGP), a method for pairing PCBs is presented. With the PCB pairs, an iterative scheme is applied to start a new group. We try the rest PCBs one by one according to the similarity between it and the PCB group. Finally, the experiments and comparisons show the good performance of the proposed heuristic.

关键词： Heuristic PCBs Setup time Grouping Similarity

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：