An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified.
Saved in:
| Title: | An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified. |
|---|---|
| Authors: | Zhou, Lijun1 (AUTHOR), Xie, Fanrong1,2,3 (AUTHOR) fanrongxie@sina.com |
| Source: | RAIRO: Operations Research (2804-7303). 2026, Vol. 60 Issue 3, p1757-1791. 35p. |
| Subjects: | Transportation problems (Programming), Mathematical models, Iterative methods (Mathematics), Logistics, Mathematical optimization |
| Abstract: | Because of realistic necessity for timely satisfying destination-stage demand, capacitated two-stage time minimization transportation problem with destination-stage demand specified (C2SD) is crucial and important optimization problem with no research report in literature due to its super intractability. In this paper, by creating C2SD's mathematical model named C2SDM (i.e., the main model systematically formulating C2SD problem) along with auxiliary models and constructing network, C2SD is reduced to a series of search for feasible flow in the constructed network, and consequently four iterative algorithms, with two derived respectively from other two by applying binary search, are developed to solve C2SD. It is proved that the optimum solution is found for C2SD by each of the four algorithms in a polynomial time. Owing to sufficient exploitation of the network structure of C2SD, the proposed algorithms exhibit high computational efficiency and avoid memory overflow. They are also easy to implement computationally and can be readily extended to capacitated multistage time minimization transportation problems with destination-stage demand specified. Distinct size examples are presented to showcase the application value and practical performance difference of the four algorithms compared to generic solver LINGO applied to C2SDM model, and the causes for incurring the performance difference are analyzed. Computation experiments on different size instances produced at random are conducted to further validate the practical performance of the four iterative algorithms compared with LINGO. It is validated that all the four algorithms overwhelmingly excel LINGO in solving quality and rival LINGO in computation time when applied to C2SD instances, successfully overcoming the defect of LINGO with poor optimization effect. It is indicated that the developed four algorithms are robust and efficient exact solution approach to C2SD, and they are able to serve as a powerful tool to tackle other relevant complex optimization problems. [ABSTRACT FROM AUTHOR] |
| Copyright of RAIRO: Operations Research (2804-7303) is the property of EDP Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 195343413 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Zhou%2C+Lijun%22">Zhou, Lijun</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Xie%2C+Fanrong%22">Xie, Fanrong</searchLink><relatesTo>1,2,3</relatesTo> (AUTHOR)<i> fanrongxie@sina.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22RAIRO%3A+Operations+Research+%282804-7303%29%22">RAIRO: Operations Research (2804-7303)</searchLink>. 2026, Vol. 60 Issue 3, p1757-1791. 35p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Transportation+problems+%28Programming%29%22">Transportation problems (Programming)</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Iterative+methods+%28Mathematics%29%22">Iterative methods (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Logistics%22">Logistics</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Because of realistic necessity for timely satisfying destination-stage demand, capacitated two-stage time minimization transportation problem with destination-stage demand specified (C2SD) is crucial and important optimization problem with no research report in literature due to its super intractability. In this paper, by creating C2SD's mathematical model named C2SDM (i.e., the main model systematically formulating C2SD problem) along with auxiliary models and constructing network, C2SD is reduced to a series of search for feasible flow in the constructed network, and consequently four iterative algorithms, with two derived respectively from other two by applying binary search, are developed to solve C2SD. It is proved that the optimum solution is found for C2SD by each of the four algorithms in a polynomial time. Owing to sufficient exploitation of the network structure of C2SD, the proposed algorithms exhibit high computational efficiency and avoid memory overflow. They are also easy to implement computationally and can be readily extended to capacitated multistage time minimization transportation problems with destination-stage demand specified. Distinct size examples are presented to showcase the application value and practical performance difference of the four algorithms compared to generic solver LINGO applied to C2SDM model, and the causes for incurring the performance difference are analyzed. Computation experiments on different size instances produced at random are conducted to further validate the practical performance of the four iterative algorithms compared with LINGO. It is validated that all the four algorithms overwhelmingly excel LINGO in solving quality and rival LINGO in computation time when applied to C2SD instances, successfully overcoming the defect of LINGO with poor optimization effect. It is indicated that the developed four algorithms are robust and efficient exact solution approach to C2SD, and they are able to serve as a powerful tool to tackle other relevant complex optimization problems. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of RAIRO: Operations Research (2804-7303) is the property of EDP Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=195343413 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1051/ro/2026045 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 35 StartPage: 1757 Subjects: – SubjectFull: Transportation problems (Programming) Type: general – SubjectFull: Mathematical models Type: general – SubjectFull: Iterative methods (Mathematics) Type: general – SubjectFull: Logistics Type: general – SubjectFull: Mathematical optimization Type: general Titles: – TitleFull: An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Zhou, Lijun – PersonEntity: Name: NameFull: Xie, Fanrong IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 28047303 Numbering: – Type: volume Value: 60 – Type: issue Value: 3 Titles: – TitleFull: RAIRO: Operations Research (2804-7303) Type: main |
| ResultId | 1 |
