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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

95 篇 期刊文献
33 篇 会议

馆藏范围

128 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

119 篇 工学
- 88 篇 计算机科学与技术...
- 33 篇 控制科学与工程
- 23 篇 电气工程
- 22 篇 机械工程
- 15 篇 软件工程
- 2 篇 材料科学与工程（可...
- 2 篇 信息与通信工程
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 交通运输工程
74 篇 管理学
- 74 篇 管理科学与工程(可...
- 6 篇 工商管理
- 1 篇 图书情报与档案管...
9 篇 理学
- 6 篇 数学
- 2 篇 生物学
- 1 篇 物理学
6 篇 经济学
- 6 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

128 篇 iterated greedy ...
26 篇 makespan
13 篇 scheduling
12 篇 blocking
7 篇 local search
7 篇 heuristic optimi...
6 篇 heuristics
5 篇 differential evo...
5 篇 flowshop
4 篇 multi-objective ...
4 篇 metaheuristics
4 篇 total flowtime
4 篇 iterated local s...
4 篇 automated guided...
4 篇 constraint progr...
4 篇 genetic algorith...
4 篇 group scheduling
4 篇 meta-heuristics
3 篇 multi-objective
3 篇 total tardiness

机构

27 篇 liaocheng univ s...
17 篇 shanghai univ sc...
12 篇 yasar univ dept ...
7 篇 tsinghua univ de...
7 篇 huazhong univ sc...
7 篇 liaocheng univ c...
6 篇 nanyang technol ...
5 篇 shanghai univ sc...
4 篇 school of comput...
4 篇 huazhong univ sc...
3 篇 new jersey inst ...
3 篇 northeastern uni...
3 篇 liaocheng univ n...
3 篇 univ alabama col...
3 篇 sultan qaboos un...
3 篇 nanjing univ aer...
3 篇 hunan univ coll ...
3 篇 nanchang univ sc...
3 篇 yasar univ softw...
2 篇 liaocheng univ e...

作者

33 篇 pan quan-ke
19 篇 tasgetiren m. fa...
11 篇 gao liang
7 篇 suganthan p. n.
6 篇 sang hong-yan
6 篇 han yuyan
5 篇 wang yuhang
5 篇 karabulut korhan
5 篇 wang ling
5 篇 wang yuting
4 篇 li junqing
4 篇 han yu-yan
4 篇 shixin liu
4 篇 oztop hande
4 篇 liu shixin
4 篇 jing xue-lei
4 篇 kizilay damla
4 篇 yuting wang
3 篇 eliiyi deniz tur...
3 篇 lin win-chin

语言

113 篇 英文
14 篇 其他
1 篇 中文

检索条件"主题词=iterated greedy algorithm"

共 128 条记录，以下是31-40 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Populated iterated greedy algorithm with Inver-Over Operator for Traveling Salesman Problem

A Populated Iterated Greedy Algorithm with Inver-Over Operat...

引用

4th International Conference on Swarm, Evolutionary, and Memetic Computing (SEMCCO)

作者： Tasgetiren, M. Fatih Buyukdagli, Ozge Kizilay, Damla Karabulut, Korhan Yasar Univ Dept Ind Engn Izmir Turkey Yasar Univ Software Engn Dept Izmir Turkey

ISBN: (纸本)9783319037530;9783319037523

In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction and construction. The basic idea behind it is to remove some solution components from a current solution and reconstruct them in the partial solution to obtain the complete solution again. In this paper, we apply this idea in a populated manner (IGP) to the traveling salesman problem (TSP). Since the destruction and construction procedure is computationally expensive, we also propose an iteration jumping to an Inver-Over operator during the search process. We applied the proposed algorithm to the well-known 14 TSP instances from TSPLIB. The computational results show that the proposed algorithm is very competitive to the recent best performing algorithms from the literature.

关键词： traveling salesman problem iterated greedy algorithm inver-over operator memetic algorithm genetic algorithm meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A parallel-optimized iterated greedy algorithm for blocking hybrid flow shop scheduling problem 35

A parallel-optimized iterated greedy algorithm for blocking ...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Wang, Yong Wang, Yuting Li, Chengshuai Zhang, Chenyao Wang, Yuhang Liaocheng Univ Sch Comp Sci Liaocheng Shandong Peoples R China

ISBN: (纸本)9798350334722

We study the blocking hybrid flow shop scheduling problem (BHFSP) aiming at maximum completion time in this paper, which has practical implications in the manufacturing industry. A parallel-optimized iterated greedy (POIG) algorithm is presented to optimize the objective of minimizing the maximum completion time. The whole POIG algorithm adopts a parallel scheme to increase the solution diversity. First, the NEH and MME heuristics are used to initialize the two solutions;subsequently, to strengthen the performance of the POIG and make machine blocking timeless, two permutation-based local perturbation strategies are proposed;using simulated annealing (SA) algorithm to increase the solution diversity. The proposed algorithm is tested against other algorithms on 100 instance sets of different scales. The final simulation experiments show that the POIG performs better than other comparison algorithms, and it can be considered as an effective solution to the BHFSP.

关键词： Blocking parallel optimization iterated greedy algorithm hybrid flow shop scheduling problem makespan

来源：评论

学校读者我要写书评

暂无评论

A DE Based Variable iterated greedy algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion

A DE Based Variable Iterated Greedy Algorithm for the No-Idl...

引用

7th International Conference on Intelligent Computing (ICIC)

作者： Tasgetiren, M. Fatih Pan, Quan-Ke Wang, Ling Chen, Angela H. -L. Yasar Univ Dept Ind Engn Izmir Turkey Liaocheng Univ Sch Comp Sci Liaocheng Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Nanya Inst Technol Dept Finance Chungli 320 Taiwan

ISBN: (纸本)9783642259432

In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the differential evolution algorithm. A unique multi-chromosome solution representation is presented such that first chromosome represents the destruction size and cooling parameter of the iterated greedy algorithm while second chromosome is simply a permutation assigned to each individual in the population randomly. As an application area, we choose to solve the no-idle permutation tlowshop scheduling problem with the total flowtime criterion. To the best of our knowledge, the no-idle permutation flowshop problem hasn't yet been studied thought it's a variant of the well-known permutation flowshop scheduling problem. The performance of the vIGP_DE algorithm is tested on the Tail lard's benchmark suite and compared to a very recent variable iterated greedy algorithm from the existing literature. The computational results show its highly competitive performance and ultimately, we provide the best known solutions for the total flowtime criterion for the Tail lard's benchmark suit.

关键词： Differential evolution algorithm iterated greedy algorithm local search no-idle permutation flowshop scheduling problem

来源：评论

学校读者我要写书评

暂无评论

A Variable iterated greedy algorithm with Differential Evolution for Solving No-Idle Flowshops

A Variable Iterated Greedy Algorithm with Differential Evolu...

引用

International Symposium on Swarm and Evolutionary Computation/ Symposium on Swarm Intelligence and Differential Evolution

作者： Tasgetiren, M. Fatih Pan, Quan-Ke Suganthan, P. N. Buyukdagli, Ozge Yasar Univ Dept Ind Engn Izmir Turkey Liaocheng Univ Sch Comp Sci Liaocheng Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Yasar Univ Dept Ind Engn Izmir Turkey

ISBN: (纸本)9783642293528;9783642293535

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by the differential evolution algorithm. A unique multi-chromosome solution representation is presented in such a way that the first chromosome represents the destruction size and the probability whereas the second chromosome is simply a job permutation assigned to each individual in the population randomly. The proposed algorithm is applied to the no-idle permutation flowshop scheduling problem with the makespan criterion. The performance of the proposed algorithm is tested on the Ruben Ruiz's benchmark suite and compared to their best known solutions available in http://***/rruiz as well as to a very recent discrete differential evolution algorithm from the literature. The computational results show its highly competitive performance and ultimately, 183 out of 250 instances are further improved. In comparison to the very recent hybrid discrete differential evolution algorithm, 114 out of 150 new best known solutions they provided are also further improved.

关键词： Differential evolution algorithm iterated greedy algorithm no-idle permutation flowshop scheduling problem heuristic optimization

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Driven iterated greedy algorithm for Energy-Efficiency Flexible Job-Shop Scheduling Problem 4

A Reinforcement Learning Driven Iterated Greedy Algorithm fo...

引用

4th International Conference on Computer, Control and Robotics (ICCCR)

作者： Bao, Haizhu Wang, Chuang Pan, Quanke Wang, Bingtao Rong, Miao Yang, Aolei Wang, Xiaohua Shanghai Univ Sch Mechatron Engn & Automat Shanghai Peoples R China

ISBN: (纸本)9798350373141;9798350373158

The escalating environmental challenges have sparked significant interest in energy-efficient scheduling as a potent strategy for realizing sustainable development and fostering green manufacturing. This approach is characterized by its dual focus on economic efficiency and energy conservation. This paper tackles the energy-efficient scheduling of the flexible job-shop scheduling problem (EFJSP) with the dual objective of minimizing both makespan and total energy consumption. The mixed-integer linear programming (MILP) model of EFJSP is devised. A reinforcement learning driven iterated greedy algorithm (RLIGA) is proposed to solve the EFJSP. Furthermore, upon a thorough analysis of the problem's characteristics, two optimization strategies-a energy-saving strategy and an acceleration strategy-are developed to enhance the solution further. Extensive benchmark tests have substantiated the superior efficiency and significance of the RLIGA over state-of-the-art algorithms in addressing the EFJSP.

关键词： flexible job-shop energy-efficient scheduling iterated greedy algorithm reinforcement learning multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

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

Minimizing Total Tardiness in the Distributed Flowshop Group...

引用

34th Chinese Control and Decision Conference (CCDC)

作者： Wang, Zhi-Yuan Pan, Yiran Pan, Quan-Ke Shanghai Univ Sch Mech & Elect Engn & Automat Shanghai 200444 Peoples R China Shanghai Lixin Univ Accounting & Finance Sch Informat Management Shanghai 201209 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Peoples R China

ISBN: (纸本)9781665478960

This paper studies a distributed permutation flowshop group scheduling problem (DPFGSP) with a total tardiness criterion, which has significant applications in the current manufacturing environment. The 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 family. The 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 FJIG. Comprehensive 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

来源：评论

学校读者我要写书评

暂无评论

Scheduling of distributed blocking flowshop with setup times using a Two-stage perturbation iterated greedy algorithm 35

Scheduling of distributed blocking flowshop with setup times...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Zhang, Chenyao Wang, Yuting Wang, Yuhang Wang, Yong Li, Chengshuai Yang, Feng Liaocheng Univ Sch Comp Sci Liaocheng Shandong Peoples R China Zhongtong Bus Holding Co Ltd Paint Shop Liaocheng Shandong Peoples R China

ISBN: (纸本)9798350334722

The limitations of the centralized production model and the advancement of mass customization production models are guiding the manufacturing industry toward a distributed production pattern. This article aims to solve the distributed blocking flowshop scheduling problem with sequence-dependent setup times, called DBFSP_SDST. Specifically, a Two-stage perturbation iterated greedy algorithm (TIG) is developed to optimize maximum completion time. In TIG, a mechanism with self-adaptive thinking is developed in global perturbation process and an efficient insertion operator is presented in local perturbation process. After counting extensive experimental results, the proposed TIG outperforms the existing state-of-the-art algorithms in solving the considered problem.

关键词： blocking distributed flowshop iterated greedy algorithm makespan

来源：评论

学校读者我要写书评

暂无评论

An iterated greedy algorithm Based on Accelerated Calculation for Distributed Flowshop Group Scheduling Problem with Blocking Constraints 35

An Iterated Greedy Algorithm Based on Accelerated Calculatio...

引用

35th Chinese Control and Decision Conference (CCDC)

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

ISBN: (纸本)9798350334722

Today's industrial production models are becoming increasingly complex. Jobs of the same type are usually divided into groups for machining. Factories are often designed in a distributed structure, i.e., they are built in serval different locations. The distributed flowshop group scheduling problem with blocking constraints (DBFGSP) has not been well studied. We constructed a mixed-integer linear programming model, and an iterated greedy algorithm based on the accelerated calculation (IGACA) to reduce the time complexity. We use 810 instances to compare our proposed algorithm with four other excellent algorithms used to solve related problems. The experimental result shows that our proposed algorithm is advantageous in solving the DBFGSP.

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共13页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：