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

A novel iterated greedy algorithm for detecting communities in complex network

SOCIAL NETWORK ANALYSIS AND MINING 2020年第1期10卷 1-17页

作者： Li, Wenquan Kang, Qinma Kong, Hanzhang Liu, Chao Kang, Yunfan Shandong Univ Sch Mech Elect & Informat Engn Weihai 264209 Shandong Peoples R China Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA

Community structure is one of the most important properties in complex networks. Detecting such communities plays an important role in a wide range of applications such as information sharing and diffusion, recommendation, and classification. In this paper, we propose a novel iterated greedy algorithm for detecting communities in complex networks. The algorithm is based on an iterative process that combines a destruction phase and a reconstruction phase. During the destruction phase, the algorithm destructs community indexes of a certain percent nodes having lower modularity contribution. In the reconstruction phase, their community indexes are reconstructed using the well-known Louvain construction heuristic. A local search procedure can be applied after the reconstruction phase to improve the performance of the algorithm. Experiments on the computer-generated networks and real-world networks show that our algorithm is very efficient and competitive compared with several state-of-the-art methods.

关键词： Community detection iterated greedy algorithm Modularity contribution Louvain heuristic

来源：评论

学校读者我要写书评

暂无评论

Minimizing Total Tardiness in the Distributed Flowshop Group Scheduling Problem with an iterated greedy algorithm

Minimizing Total Tardiness in the Distributed Flowshop Group...

引用

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

作者： Zhi-Yuan Wang Yiran Pan Quan-Ke Pan School of Mechanical and Electrical Engineering and Automation Shanghai University School of Information Management Shanghai Lixin University of Accounting and Finance School of Computer Science Liaocheng University

This paper studies a distributed permutation flowshop group scheduling problem(DPFGSP) with a total tardiness criterion,which has significant applications in the current manufacturing *** considered problem can be broken down into three sub-problems:how to assign the families to each factory,how to determine the sequence of the families within each factory,and the processing order of jobs within each *** paper proposes an effective two-stage iterated greedy algorithm(FJIG) to minimize the total tardiness time for the DPFGSP and utilizes an improved NEH heuristic to generate an initial solution for the proposed *** statistical experiments are carried out to test the effectiveness of the FJIG and the experimental results demonstrate that the proposed FJIG is very effective for the DPFGSP with total tardiness criterion.

关键词： Distributed group scheduling tardiness time metaheuristic iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An upgraded iterated greedy scheduling algorithm for distributed blocking flowshop group problem 35

An upgraded iterated greedy scheduling algorithm for distrib...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Ji, Qianhui Han, Yuyan Wang, Yuhang Wang, Yizheng Liaocheng Univ Sch Comp Sci Liaocheng Shandong Peoples R China

ISBN: (纸本)9798350334722

Owing to the needs of production technology, the demand for group scheduling models will further increase to save costs and time. Thus, the flowshop group scheduling problem (FGSP) has attracted a lot of attention, and is of theoretical significance for academic discussion and practical application. in this paper, we consider a distributed FGSP with blocking constrain (DBFGSP). First, a mathematical model of DBFGSP with makespan criterion is formulated and an upgraded iterative greedy algorithm based on intra-group and inter-group operations (UIG) is developed to increase the solution diversity and balance global and local search capabilities. Through numerical simulation of 810 test cases and statistical comparisons with four representative algorithms, it is verified that the proposed UIG algorithm can obtain good scheduling schemes for DBFGSP.

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

来源：评论

学校读者我要写书评

暂无评论

An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance

引用

EXPERT SYSTEMS WITH APPLICATIONS 2021年 169卷 114495-114495页

作者： Mao, Jia-yang Pan, Quan-ke Miao, Zhong-hua Gao, Liang Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan Peoples R China

In recent years, distributed scheduling problems have been well studied for their close connection with multi-factory production networks. However, the maintenance operations that are commonly carried out on a system to restore it to a specific state are seldom taken into consideration. In this paper, we study a distributed permutation flowshop scheduling problem with preventive maintenance operation (PM/DPFSP). A multi-start iterated greedy (MSIG) algorithm is proposed to minimize the makespan. An improved heuristic is presented for the initialization and re-initialization by adding a dropout operation to NEH2 to generate solutions with a high level of quality and disperstiveness. A destruction phase with the tournament selection and a construction phase with an enhanced strategy are introduced to avoid local optima. A local search based on three effective operators is integrated into the MSIG to reinforce local neighborhood solution exploitation. In addition, a restart strategy is adpoted if a solution has not been improved in a certain number of consecutive iterations. We conducted extensive experiments to test the performance of the presented MSIG. The computational results indicate that the presented MSIG has many promising advantages in solving the PM/DPFSP under consideration.

关键词： Distributed permutation flowshop scheduling problem Makespan Preventive maintenance iterated greedy algorithm Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2021年 104卷 104375-104375页

作者： Chen, Shuai Pan, Quan-Ke Gao, Liang Sang, Hong-yan Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Shandong Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China

We consider the distributed blocking flowshop scheduling problem (DBFSP) which is a meaningful generalization of the blocking flowshop scheduling problem in the distributed production environment. The objective of minimizing the total flowtime is relevant and important in the current dynamic manufacturing environment, but, as far as we know, it has not been investigated in the DBFSP previously. In this paper, a population-based iterated greedy (PBIG) algorithm is proposed to solve the DBFSP with the total flowtime criterion, which takes the advantage of both the population-based search approach and the iterated greedy algorithm. First, an effective constructive heuristic is proposed by integrating two existing constructive approaches to initialize the population with a high level of quality and diversity. Second, three different procedures to generate the offspring solutions are tested for the effective exploration capability, each of which rationally combines the destruction, reconstruction and selection operator. Third, the insertion neighborhood and swap neighborhood are investigated to enhance the local exploitation ability and a hybrid local search procedure that utilizes simultaneously both the two neighborhoods are proposed. The comprehensive experimental evaluation based on a total of 720 well-known instances shows that the proposed algorithms outperform the existing effective algorithms at a significant margin.

关键词： Flowshop Total flowtime Distributed iterated greedy algorithm Blocking

来源：评论

学校读者我要写书评

暂无评论

An iterated greedy algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization 39

An Iterated Greedy Algorithm for Distributed Blocking Flowsh...

引用

39th Chinese Control Conference (CCC)

作者： Chen, Shuai Pan, Quan-ke Hu, XiaoLu Tasgetiren, M. Fatih Shanghai Univ Sch Mech & Elect Engn & Automat Shanghai 200444 Peoples R China China Rural Technol Dev Ctr Beijing 100045 Peoples R China Yasar Univ Int Logist Management Dept Izmir Turkey

ISBN: (纸本)9789881563903

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

来源：评论

学校读者我要写书评

暂无评论

iterated greedy algorithm for Solving a New Single Machine Scheduling Problem 16

Iterated Greedy Algorithm for Solving a New Single Machine S...

引用

16th IEEE International Conference on Networking, Sensing and Control (ICNSC)

作者： Zhao, ZiYan Liu, ShiXin Zhou, MengChu Guo, XiWang Xue, JiaLun Northeastern Univ Coll Informat Sci & Engn State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Liaoning Shihua Univ Coll Comp & Commun Engn Fushun 113001 Peoples R China

ISBN: (纸本)9781728100845

This paper studies a new single machine scheduling problem with sequence-dependent setup time, release time, due time and group technology assumption originated from a wire rod and bar rolling process in steel plants. The objective is to find an optimal batch sequence and job sequences of all batches to minimize the number of late jobs. A two-stage mixed integer program is created to describe and solve this problem. The first stage can be solved in a short time by CPLEX while the second one is time-consuming when dealing with large-scale cases. Thus, an iterated greedy algorithm able to solve the second stage fast is developed. The experimental results demonstrate that the proposed two-stage mixed integer program can be solved optimally by CPLEX for small-scale cases and the proposed algorithm can effectively solve the second stage for large-scale cases.

关键词： Single machine scheduling two-stage integer program iterated greedy algorithm CPLEX wire rod and bar rolling process

来源：评论

学校读者我要写书评

暂无评论

iterated greedy algorithm for Solving a Hybrid Flow Shop Scheduling Problem with Reentrant Jobs

Iterated Greedy Algorithm for Solving a Hybrid Flow Shop Sch...

引用

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

作者： Qi Zhang Zheng Tian Sen Wang Shixin Liu State Key Laboratory of Synthetical Automation for Process Industries College of Information Science and EngineeringNortheast University Shanghai Baosight Software Co. Ltd.

This paper studies a hybrid flow shop scheduling problem with reentrant jobs from a copper strip cold rolling process in copper plants. The objective is to find a near-optimal job sequences to minimize makespan. A mixed integer program is created to describe this problem. An iterated greedy heuristic algorithm is proposed to solve this problem. Practical instances are collected from a Chinese copper plant to test the performance of the proposed algorithm. The experimental results demonstrate that the proposed algorithm can effectively solve the large-scale instances.

关键词： Hybrid flow shop scheduling Reentrant jobs iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop

引用

APPLIED SOFT COMPUTING 2021年 99卷 106945-106945页

作者： Zou, Wen-Qiang Pan, Quan-Ke Tasgetiren, M. Fatih Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Shandong Peoples R China Yasar Univ Int Iogist Management Dept Izmir Turkey

In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent years. The problem aims to determine a solution to minimize the total cost including the travel cost, the service cost, and the cost of vehicles involved. For this purpose, a mixed-integer linear programming model is first constructed. Then, a novel iterated greedy (IG) algorithm including accelerations for evaluating objective functions of neighboring solutions;an improved nearest-neighbor-based constructive heuristic;an improved sweep-based constructive heuristic;an improved destruction procedure;and a simulated annealing type of acceptance criterion is proposed. At last, a series of comparative experiments are implemented based on some real-world instances from an electronic equipment manufacturing enterprise. The computational results demonstrate that the proposed IG algorithm has generated substantially better solutions than the existing algorithms in solving the problem under consideration. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Automated guided vehicle Multi-compartment Scheduling iterated greedy algorithm Heuristics

来源：评论

学校读者我要写书评

暂无评论

A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2019年 349卷 359-366页

作者： Zhang, Wenjie Tu, Jianhua Wu, Lidong Beijing Univ Chem Technol Dept Math Beijing 100029 Peoples R China Univ Texas Tyler Dept Comp Sci Tyler TX 75799 USA

Given a vertex-weighted graph G = (V, E) and a positive integer k >= 2, the minimum weight vertex cover P-k (MWVCPk) problem is to find a vertex subset F subset of V with minimum total weight such that every path of order k in G contains at least one vertex in F. For any integer k >= 2, the MWVCPk problem for general graphs is NP-hard. In this paper, we restrict our attention to the MWVCP3 problem and present a multi-start iterated greedy algorithm to solve the MWVCP3 problem. The experiments are carried out on randomly generated instances with up to 1000 vertices and 250000 edges. Our work is the first one to adopt heuristic algorithms to solve the MWVCP3 problem, and the experimental results show that our algorithm performs reasonably well in practice. (C) 2019 Elsevier Inc. All rights reserved.

关键词： iterated greedy algorithm Minimum weight vertex cover P-3 problem Heuristic algorithms Combinatorial optimization problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：