Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Imperialism-competition-based algorithm for solving problem of workshop worker dispatching

A technology for imperialism and scheduling problems, which is applied in the field of using algorithms to solve the problem of workshop personnel scheduling. It can solve the problems of inflexible scheduling optimization and low solution accuracy, and achieve the effects of high calculation accuracy, changing calculation methods, and reducing running time.

Inactive Publication Date: 2017-05-03
SICHUAN YONGLIAN INFORMATION TECH CO LTD
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to overcome existing in the prior art: there is not an algorithm linking the dispatching of job and machine and the dispatching of worker and machine in workshop dispatching; Optimization problems solve problems with low precision

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
  • Imperialism-competition-based algorithm for solving problem of workshop worker dispatching
  • Imperialism-competition-based algorithm for solving problem of workshop worker dispatching
  • Imperialism-competition-based algorithm for solving problem of workshop worker dispatching

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] This algorithm first uses an improved imperialist algorithm to optimize the scheduling between jobs and machines, and then uses the optimal result of the algorithm, such as the imperial array, as some parameters to solve the scheduling problem between workers and machines. Processing capacity, geographical distance between machines and workers, etc. parameters to establish a new imperialist competition algorithm model to solve the scheduling problem of workers and machines.

[0038] In order to make the object, technical solution and advantages of the present invention clearer, the following in conjunction with the attached figure 1 , attached figure 2 The present invention will be described in detail.

[0039] 1. Imperialist Competition Algorithm

[0040] In the imperialist competition algorithm, each country is represented by an array or vector of real numbers. for a N var dimension optimization problem, the array is defined as follows:

[0041]

[0042] The ...

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 proposes an imperialism-competition-based algorithm for solving the problem of workshop worker dispatching. The algorithm comprises the steps that an improved imperialist algorithm is used to optimize dispatching of job and machines; the imperial data and the like of the optimal result of the algorithm are used as parameters to solve the dispatching problem of workers and machines; and the parameters of the machine processing capacity, the geographical distance between machines and workers and the like are combined to establish a new imperialism competition algorithm model to solve the dispatching problem of workers and machines. According to the invention, workers are directly defined as an empire, and machines are defined as a colony; uncertainties caused by a randomly produced initial solution are avoided; the algorithm running time is reduced; and the distance between machines and workers to describe the relative force of imperialist countries, which is simple and convenient.

Description

[0001] Field [0002] The invention relates to the field of job shop scheduling, in particular to using an algorithm to solve the job shop personnel scheduling problem. Background technique [0003] In the past few decades, various algorithms have been applied to solve the job shop scheduling problem, such as: imperialist competition algorithm, genetic algorithm, particle swarm algorithm, etc., each has its advantages and disadvantages. There are also some comprehensive methods to solve the job shop scheduling problem. However, there are still problems that cannot satisfy the exact solution and short running time at the same time, and the proposed methods are only based on solving the job and machine scheduling problem. However, today's job shop scheduling problem is not only a problem of scheduling jobs and machines on the production line, because of the scarcity of workers, it is also necessary to consider the allocation and management of workers and machines. Contents of ...

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/06
CPCG06Q10/06311
Inventor 姜艾佳胡成华
Owner SICHUAN YONGLIAN INFORMATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com