發(fā)布時(shí)間：2018-05-12 20:26

  本文選題：整數(shù)規(guī)劃 + Petri網(wǎng)��； 參考：《計(jì)算機(jī)集成制造系統(tǒng)》2017年05期

【摘要】：為了求解一類特殊的整數(shù)規(guī)劃問(wèn)題以對(duì)工作流網(wǎng)進(jìn)行可達(dá)性分析和不變量計(jì)算,將該類問(wèn)題進(jìn)行歸納和抽象,提出向量目標(biāo)整數(shù)線性規(guī)劃問(wèn)題的概念和標(biāo)準(zhǔn)模型;在傳統(tǒng)整數(shù)規(guī)劃問(wèn)題求解方法的基礎(chǔ)上,針對(duì)一類正定的向量目標(biāo)整數(shù)線性規(guī)劃問(wèn)題設(shè)計(jì)了一種新的分支定界算法,以求取全部最優(yōu)解;將工作流網(wǎng)不變量分解與恰當(dāng)終結(jié)性驗(yàn)證等問(wèn)題轉(zhuǎn)換為前述向量目標(biāo)整數(shù)規(guī)劃問(wèn)題,結(jié)合實(shí)例說(shuō)明了該方法在工作流網(wǎng)性質(zhì)分析中的應(yīng)用。
[Abstract]:In order to solve a special integer programming problem to analyze the reachability of workflow net and calculate the invariant, the concept and standard model of vector objective integer linear programming problem are proposed. Based on the traditional integer programming method, a new branch and bound algorithm is designed for a class of positive definite vector object integer linear programming problems to obtain all the optimal solutions. The problems of invariant decomposition and proper summative verification of workflow net are transformed into the vector objective integer programming problem mentioned above. The application of this method in the property analysis of workflow net is illustrated by an example.
【作者單位】： 山東科技大學(xué)計(jì)算機(jī)科學(xué)與工程學(xué)院;山東科技大學(xué)數(shù)學(xué)與系統(tǒng)科學(xué)學(xué)院;同濟(jì)大學(xué)嵌入式系統(tǒng)與服務(wù)計(jì)算教育部重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61602279,61472229) 山東省科技發(fā)展計(jì)劃資助項(xiàng)目(2014GGX101035,2016ZDJS02A11) 山東省自然科學(xué)基金資助項(xiàng)目(BS2014DX013,ZR2015FM013) 同濟(jì)大學(xué)嵌入式系統(tǒng)與服務(wù)計(jì)算教育部重點(diǎn)實(shí)驗(yàn)室開(kāi)放課題資助項(xiàng)目(ESSCKF201403) 山東省博士后創(chuàng)新專項(xiàng)資金資助項(xiàng)目(201603056) 山東科技大學(xué)領(lǐng)軍人才與優(yōu)秀科研團(tuán)隊(duì)計(jì)劃資助項(xiàng)目(2015TDJH102)~~
【分類號(hào)】：O221;TP301.1

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 王劍,魏生民,何衛(wèi)平,唐邦治;基于隨機(jī)Petri網(wǎng)的產(chǎn)品任務(wù)平均完成時(shí)間算法研究[J];中國(guó)制造業(yè)信息化;2005年04期

，

本文編號(hào)：1880038