A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization

A technique for improving particle swarm and scheduling algorithms, applied in computing, computing models, instruments, etc.

Active Publication Date: 2016-12-14
SUN YAT SEN UNIV
View PDF6 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, there are many kinds of existing automated factory design algorithms, and there are still areas to be improved in term

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
  • A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization
  • A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization
  • A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] Below in conjunction with the accompanying drawings, the specific embodiments of the present invention will be further described in detail, so as to make the technical solution of the present invention easier to understand and grasp.

[0036] In order to further understand this scheme, first, a brief description of the ant algorithm is given.

[0037] 1. Research on Ant Algorithm

[0038] figure 1 , assuming that point A is the ant's cave, point D is the food source, and EF is a big obstacle. Ants have two paths ABECD and ABFCD connecting the burrow and food due to obstacles. The distance between BE and EC is 1, while the distance between BF and FC is 0.5. It can be seen that the path ABFCD is the shortest path. Assume that in each time unit, there are 30 ants from point A to point D, and 30 ants from D to point A, and the amount of information left by the ants is 1. For the sake of simplicity, let the pheromone only stay 1 on the path. At the initial time, there i...

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 provides a total tardiness transport plan scheduling algorithm based on improved particle swarm optimization. The algorithm comprises the steps of firstly, establishing a total tardiness value mathematic model based on input variables and defining the number n of to-be-processed works and the number m of machines, and the time pj required for processing of each to-be-processed work and the delivery term dj; secondly, solving a construction drawing according to the total tardiness value mathematic model; thirdly, based on the construction drawing and according to state transition rules and pheromone update rules, completing search and acquiring a solution making the total tardiness T minimum. Based on the ant colony algorithm and according to the characteristics of the total tardiness transport plan scheduling problem (P//T) of parallel machines, the improved Heuristic Ant Colony Optimization (hACO) is proposed and performance optimization research is performed on the algorithm to improve the determination accuracy of optimal solutions of events and guarantee the internal data processing and screening efficiency.

Description

technical field [0001] The invention relates to a scheduling algorithm for total delayed transport planning based on improved particle swarm optimization. Background technique [0002] The total delay transportation planning problem (TTP) is a classic problem in the scheduling problem, which contains many different sub-problems, and can be generally divided into single machine (single machine) total delay and multimachines (multimachines) total delay according to the configuration of the machine. Delayed transportation planning scheduling problem. Among them, the different situations of the single machine total delay transportation planning scheduling problem are divided into the same arrival time (equal release time), different arrival time (unequal release time) and the single machine total delay transportation planning scheduling problem with weights (the single machine total weighted tardiness problem, SMTWTP). The multi-machine total delay transportation planning sche...

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
CPCG06N3/006G06Q10/04
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