一类具有成本约束的最短时限运输问题

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788) Pub Date : 2004-06-15 DOI:10.1109/WCICA.2004.1343060

Zhenning Dong, Jianhua Ma

{"title":"一类具有成本约束的最短时限运输问题","authors":"Zhenning Dong, Jianhua Ma","doi":"10.1109/WCICA.2004.1343060","DOIUrl":null,"url":null,"abstract":"This paper considers the shortest time limit transportation problem with storage cost upper limitation on bipartite graph. The authors prove that its feasible solution corresponds to that of transportation problem uniquely, the basic feasible solution of transportation problem corresponds to its basic solution, and the optimal solution of transportation problem is one of its optimal solutions. Then we revise the transportation cost of the edge with longer transportation time into /spl infin/ continuously, and get its optimal solution by solving the transportation problem. Finally, the authors present an example to show that the algorithm runs easily and quickly.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A kind of shortest time limit transportation problem with cost constraints\",\"authors\":\"Zhenning Dong, Jianhua Ma\",\"doi\":\"10.1109/WCICA.2004.1343060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the shortest time limit transportation problem with storage cost upper limitation on bipartite graph. The authors prove that its feasible solution corresponds to that of transportation problem uniquely, the basic feasible solution of transportation problem corresponds to its basic solution, and the optimal solution of transportation problem is one of its optimal solutions. Then we revise the transportation cost of the edge with longer transportation time into /spl infin/ continuously, and get its optimal solution by solving the transportation problem. Finally, the authors present an example to show that the algorithm runs easily and quickly.\",\"PeriodicalId\":331407,\"journal\":{\"name\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2004.1343060\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2004.1343060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究了二部图上具有存储成本上限的最短时限运输问题。证明了交通问题的可行解与交通问题的可行解唯一对应，交通问题的基本可行解与交通问题的基本可行解对应，交通问题的最优解是交通问题的最优解之一。然后将运输时间较长的边的运输成本连续修正为/spl / /，通过求解运输问题得到其最优解。最后给出了一个算例，表明该算法运行简单、快速。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A kind of shortest time limit transportation problem with cost constraints

This paper considers the shortest time limit transportation problem with storage cost upper limitation on bipartite graph. The authors prove that its feasible solution corresponds to that of transportation problem uniquely, the basic feasible solution of transportation problem corresponds to its basic solution, and the optimal solution of transportation problem is one of its optimal solutions. Then we revise the transportation cost of the edge with longer transportation time into /spl infin/ continuously, and get its optimal solution by solving the transportation problem. Finally, the authors present an example to show that the algorithm runs easily and quickly.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)

自引率

0.00%

发文量