Time Petri Net with Ant Colony Mechanism and Its Application in Scheduling Optimization of Flexible Manufacturing Systems

PAN Li; ZHENG Hong; GUO Guan-qi; LIU Xian-ming

doi:10.3969/j.issn.0372-2112.2014.08.011

您当前的位置：

首页 >

文章列表页 >

Time Petri Net with Ant Colony Mechanism and Its Application in Scheduling Optimization of Flexible Manufacturing Systems

更新时间：2025-07-16

- Time Petri Net with Ant Colony Mechanism and Its Application in Scheduling Optimization of Flexible Manufacturing Systems
- Acta Electronica Sinica Vol. 42, Issue 8, Pages: 1531-1537(2014)
- 作者机构：
  
  1. 湖南理工学院信息与通信工程学院,湖南,岳阳,414006
  2. 湖南理工学院复杂系统优化与控制湖南省普通高等学校重点实验室,湖南,岳阳,414006
  3. 华东理工大学,上海,200237
  4. 江西省电力公司,江西,南昌,330077
  5. 湖南理工学院信息与通信工程学院,湖南,岳阳,414006
  6. 湖南理工学院复杂系统优化与控制湖南省普通高等学校重点实验室,湖南,岳阳,414006
  7. 华东理工大学,上海,200237
  8. 江西省电力公司,江西,南昌,330077
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2014.08.011
  CLC： TP311
- Published：2014
- 稿件说明：
移动端阅览
PAN Li, ZHENG Hong, GUO Guan-qi, et al. Time Petri Net with Ant Colony Mechanism and Its Application in Scheduling Optimization of Flexible Manufacturing Systems[J]. Acta Electronica Sinica, 2014, 42(8): 1531-1537.
DOI：

PAN Li, ZHENG Hong, GUO Guan-qi, et al. Time Petri Net with Ant Colony Mechanism and Its Application in Scheduling Optimization of Flexible Manufacturing Systems[J]. Acta Electronica Sinica, 2014, 42(8): 1531-1537. DOI： 10.3969/j.issn.0372-2112.2014.08.011.

摘要

Petri网的优化调度求解主要采用基于状态空间的智能搜索方法，执行效率往往不高.提出基于蚁群优化的时间Petri网，通过在Petri网的变迁和进化规则中引入蚁群优化机制，改变Petri网原有的非确定性选择行为，使之具备蚁群寻优选择智能行为，克服了需要基于状态空间进行启发式搜索的缺陷，提高了调度优化的计算效率.最后应用蚁群优化时间Petri网模型，对柔性制造系统的区间Job Shop调度问题进行建模和优化求解.实验结果进一步验证了所提模型和方法的有效性.

Abstract

Heuristic algorithms based on state search are usually used to solve scheduling problems of Petri nets.Suffering from the state space explosion

their executions are often not efficient for large-scale problems.This paper proposes a time Petri net with ant colony mechanism to address this problem.We introduce pheromones and foraging rules of ants into transitions and evolution rules of a time Petri net.The proposed model can work out scheduling problems during the run of a Petri net without building reachability tree.We use this model to describe and solve an interval job shop scheduling problem.The experimental results further verify the effectiveness of the proposed model.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Method of Ant Colony Optimization and Quasi-Real-Time Key Pool Based on Survivability Virtual Network Embedding

Ant Colony for Wireless Sensor Networks Self-Organization

Related Author

LIU Huan-lin

LIU Bo

CHEN Yong

MA Bing

QIU Yan

CHEN Hao-nan

WANG Rui

LIANG Yan

Related Institution

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

Chongqing Institute of Engineering

College of Automation,Northwestern Polytechnic University

Institute of Computing Technology, Chinese Academy of Sciences

College of AutomationNorthwestern Polytechnic UniversityXi’an Shaanxi 710072China

⁰