二次型交通网络算法

Proceedings of the 28th IEEE Conference on Decision and Control, Pub Date : 1989-12-13 DOI:10.1109/CDC.1989.70310

J. A. Ventura

{"title":"二次型交通网络算法","authors":"J. A. Ventura","doi":"10.1109/CDC.1989.70310","DOIUrl":null,"url":null,"abstract":"Two dual algorithms for solving quadratic transportation problems are discussed and compared. Both algorithms include a similar line search subproblem. The performance of the algorithms is improved by combining two known line search techniques, the Bitran-Hax line search algorithm and the sequential line search algorithm. Results of a computational study carried out to identify the best method to solve quadratic transportation problems are presented.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Algorithms for quadratic transportation networks\",\"authors\":\"J. A. Ventura\",\"doi\":\"10.1109/CDC.1989.70310\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two dual algorithms for solving quadratic transportation problems are discussed and compared. Both algorithms include a similar line search subproblem. The performance of the algorithms is improved by combining two known line search techniques, the Bitran-Hax line search algorithm and the sequential line search algorithm. Results of a computational study carried out to identify the best method to solve quadratic transportation problems are presented.<<ETX>>\",\"PeriodicalId\":156565,\"journal\":{\"name\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1989.70310\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

讨论并比较了求解二次运输问题的两种对偶算法。这两种算法都包含一个相似的线搜索子问题。通过结合Bitran-Hax线搜索算法和顺序线搜索算法两种已知的线搜索技术，提高了算法的性能。本文给出了求解二次运输问题的最佳方法的计算研究结果。

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

查看原文本刊更多论文

Algorithms for quadratic transportation networks

Two dual algorithms for solving quadratic transportation problems are discussed and compared. Both algorithms include a similar line search subproblem. The performance of the algorithms is improved by combining two known line search techniques, the Bitran-Hax line search algorithm and the sequential line search algorithm. Results of a computational study carried out to identify the best method to solve quadratic transportation problems are presented.<>

求助全文

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

来源期刊

Proceedings of the 28th IEEE Conference on Decision and Control,

自引率

0.00%

发文量