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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: YI YANG, LI FANG, TU GUANPING, CHEN XINGENG, WU SIYANG, ZHAO YONGXIAN
Format: Patent
Sprache:chi ; eng
Schlagworte:
CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator YI YANG
LI FANG
TU GUANPING
CHEN XINGENG
WU SIYANG
ZHAO YONGXIAN
description 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 det
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN106228265A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN106228265A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN106228265A3</originalsourceid><addsrcrecordid>eNqNyrEKwkAMgOEuDqK-Q3wAQSsW11IUJyd3idfYBu6S4xIVfHodfACn_xv-aRVacHWM4Fh6FjIDLyiWtTjkiAIWRuofkWUAjIMW9jHBDY16UAFOuejz64zFOUQCe2FJoNk58RudVebV5I7RaPHrrFoeD5futKKsV7KMgYT82p0366au93Wza7f_PB8I8D9o</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization</title><source>esp@cenet</source><creator>YI YANG ; LI FANG ; TU GUANPING ; CHEN XINGENG ; WU SIYANG ; ZHAO YONGXIAN</creator><creatorcontrib>YI YANG ; LI FANG ; TU GUANPING ; CHEN XINGENG ; WU SIYANG ; ZHAO YONGXIAN</creatorcontrib><description>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 det</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20161214&amp;DB=EPODOC&amp;CC=CN&amp;NR=106228265A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25568,76551</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20161214&amp;DB=EPODOC&amp;CC=CN&amp;NR=106228265A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>YI YANG</creatorcontrib><creatorcontrib>LI FANG</creatorcontrib><creatorcontrib>TU GUANPING</creatorcontrib><creatorcontrib>CHEN XINGENG</creatorcontrib><creatorcontrib>WU SIYANG</creatorcontrib><creatorcontrib>ZHAO YONGXIAN</creatorcontrib><title>A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization</title><description>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 det</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyrEKwkAMgOEuDqK-Q3wAQSsW11IUJyd3idfYBu6S4xIVfHodfACn_xv-aRVacHWM4Fh6FjIDLyiWtTjkiAIWRuofkWUAjIMW9jHBDY16UAFOuejz64zFOUQCe2FJoNk58RudVebV5I7RaPHrrFoeD5futKKsV7KMgYT82p0366au93Wza7f_PB8I8D9o</recordid><startdate>20161214</startdate><enddate>20161214</enddate><creator>YI YANG</creator><creator>LI FANG</creator><creator>TU GUANPING</creator><creator>CHEN XINGENG</creator><creator>WU SIYANG</creator><creator>ZHAO YONGXIAN</creator><scope>EVB</scope></search><sort><creationdate>20161214</creationdate><title>A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization</title><author>YI YANG ; LI FANG ; TU GUANPING ; CHEN XINGENG ; WU SIYANG ; ZHAO YONGXIAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN106228265A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>YI YANG</creatorcontrib><creatorcontrib>LI FANG</creatorcontrib><creatorcontrib>TU GUANPING</creatorcontrib><creatorcontrib>CHEN XINGENG</creatorcontrib><creatorcontrib>WU SIYANG</creatorcontrib><creatorcontrib>ZHAO YONGXIAN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>YI YANG</au><au>LI FANG</au><au>TU GUANPING</au><au>CHEN XINGENG</au><au>WU SIYANG</au><au>ZHAO YONGXIAN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization</title><date>2016-12-14</date><risdate>2016</risdate><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 det</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN106228265A
source esp@cenet
subjects CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
title A total tardiness transport plan scheduling algorithm based on improved particle swarm optimization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T07%3A56%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=YI%20YANG&rft.date=2016-12-14&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN106228265A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true