Self-adaptive ant colony optimization based flexible workshop dispatching technology

A workshop scheduling and adaptive technology, applied in data processing applications, instruments, computing models, etc., can solve problems such as low efficiency and high complexity of FJSP, and achieve the effect of improving optimization efficiency

Inactive Publication Date: 2013-08-14
SUN YAT SEN UNIV
View PDF3 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Nevertheless, the vast majority of existing integration met

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Self-adaptive ant colony optimization based flexible workshop dispatching technology
  • Self-adaptive ant colony optimization based flexible workshop dispatching technology
  • Self-adaptive ant colony optimization based flexible workshop dispatching technology

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] Based on the definition of the solution construction graph in the content of the invention, the ant colony optimization algorithm proposed by the present invention uses a set S containing M sequences to represent a scheduling scheme, that is, a solution to the problem. where each sequence S k Records those nodes that assign operations to machine k, k = 1, 2, . . . , M. The deconstruction process of each ant consists of the following steps:

[0021] Step 1) Use S k =(v 0 ), k=1, 2, ..., each node sequence in the M initialization solution. Select a candidate set C of nodes from the structure graph such that C contains all possible assignments of the first operations of the N jobs.

[0022] Step 2) For each node v in C l ,search to find a way to allow v without violating the priority constraints and without delaying the start time of other operations in S l Insert the first node v after it w , we call v w for v l the optimal predecessor of . Ants choose v l Th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a self-adaptive ant colony optimization based flexible workshop dispatching technology. According to the technology, the ant colony optimization algorithm is applied to the flexible workshop dispatching problem. In order to always obtain ideal performance of the algorithm on different problem instances, a self-adaptive strategy, which can automatically select heuristic information and guidance force control parameters according to the problem instances to be solved and the current search state, is introduced into the ant colony optimization algorithm, which greatly improves the algorithm optimization efficiency and provides a new path for solving the flexible workshop dispatching problem. Based on experiment of standard test library for the flexible workshop dispatching problems, the technology provided by the invention can efficiently find a dispatching scheme with shortest construction period or nearly shortest construction period.

Description

Technical field: [0001] The invention relates to the field of intelligent computing and production management, and mainly discloses an elastic workshop scheduling technology based on adaptive ant colony optimization, which can effectively shorten the construction period and improve production efficiency. Background technique: [0002] The flexible job shop scheduling problem (FJSP) contains two sets J and E, set J is composed of N jobs, and set E is composed of M machines. Each job contains a sequence consisting of N with priority constraints i operation (O i1 , O i2 ,...,O Ni ) form, that is, an operation O ij+1 cannot start until its predecessor O ij Done, i=1, 2, ..., N, j = 1, 2, ..., N i -1. Each operation can be executed by its set of feasible machines E ij Execute on any one of the machines, where If for all operations, E ij are equal to E, then the problem is said to be fully elastic, otherwise it is said to be partially elastic. The goal of the problem i...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q10/04G06N3/00
Inventor 张军林盈张宇辉
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap