A logistics ratio-optimised inventory routing problem with lateral transhipment using mixed-integer robust fractional programming.
Saved in:
| Title: | A logistics ratio-optimised inventory routing problem with lateral transhipment using mixed-integer robust fractional programming. |
|---|---|
| Authors: | Xingyu, Man1 (AUTHOR) manxingyu@outlook.com, Daofang, Chang2 (AUTHOR), Peng, Zheng2 (AUTHOR), Wanke, Han3 (AUTHOR) |
| Source: | International Journal of Production Research. Dec2025, Vol. 63 Issue 24, p10381-10412. 32p. |
| Subjects: | Logistics, Fractional programming, Economic uncertainty, Scarcity, Optimization algorithms, Cross-docking (Logistics), Inventory control, Mixed integer linear programming |
| Abstract: | This study addresses a single-period multi-product inventory routing problem (IRP) considering reactive lateral transhipment with the optimisation objective of logistics ratio, defined as logistics cost per unit of product value. The problem is modelled in two stages: in the first stage, the distribution is planned based on imperfect forecasted demand. In the second stage, actual demand is revealed, and reactive lateral transhipment is executed based on first-stage decisions. We develop a basic fractional programming (BFP) model with deterministic demand for both stages. Considering demand uncertainty, we extend a robust fractional programming (RFP) model and a two-stage robust fractional programming (TSRFP) model for first-stage IRP and propose structural uncertainty sets. We apply Dinkelbach's algorithm and the robust counterpart transformation to tackle the RFP model. We employ the column and constraint generation algorithm to address the TSRFP model with Dinkelbach's algorithm. The results indicate that the proposed TSRFP is suits scenarios with high stockout penalties and at medium demand uncertainty levels. Managers can select between TSRFP, RFP, and BFP to optimise inventory management based on demand uncertainty and product attributes. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd 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 |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 189933547 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A logistics ratio-optimised inventory routing problem with lateral transhipment using mixed-integer robust fractional programming. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xingyu%2C+Man%22">Xingyu, Man</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> manxingyu@outlook.com</i><br /><searchLink fieldCode="AR" term="%22Daofang%2C+Chang%22">Daofang, Chang</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Peng%2C+Zheng%22">Peng, Zheng</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Wanke%2C+Han%22">Wanke, Han</searchLink><relatesTo>3</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Dec2025, Vol. 63 Issue 24, p10381-10412. 32p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Logistics%22">Logistics</searchLink><br /><searchLink fieldCode="DE" term="%22Fractional+programming%22">Fractional programming</searchLink><br /><searchLink fieldCode="DE" term="%22Economic+uncertainty%22">Economic uncertainty</searchLink><br /><searchLink fieldCode="DE" term="%22Scarcity%22">Scarcity</searchLink><br /><searchLink fieldCode="DE" term="%22Optimization+algorithms%22">Optimization algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Cross-docking+%28Logistics%29%22">Cross-docking (Logistics)</searchLink><br /><searchLink fieldCode="DE" term="%22Inventory+control%22">Inventory control</searchLink><br /><searchLink fieldCode="DE" term="%22Mixed+integer+linear+programming%22">Mixed integer linear programming</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This study addresses a single-period multi-product inventory routing problem (IRP) considering reactive lateral transhipment with the optimisation objective of logistics ratio, defined as logistics cost per unit of product value. The problem is modelled in two stages: in the first stage, the distribution is planned based on imperfect forecasted demand. In the second stage, actual demand is revealed, and reactive lateral transhipment is executed based on first-stage decisions. We develop a basic fractional programming (BFP) model with deterministic demand for both stages. Considering demand uncertainty, we extend a robust fractional programming (RFP) model and a two-stage robust fractional programming (TSRFP) model for first-stage IRP and propose structural uncertainty sets. We apply Dinkelbach's algorithm and the robust counterpart transformation to tackle the RFP model. We employ the column and constraint generation algorithm to address the TSRFP model with Dinkelbach's algorithm. The results indicate that the proposed TSRFP is suits scenarios with high stockout penalties and at medium demand uncertainty levels. Managers can select between TSRFP, RFP, and BFP to optimise inventory management based on demand uncertainty and product attributes. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd 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=189933547 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207543.2025.2551240 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 32 StartPage: 10381 Subjects: – SubjectFull: Logistics Type: general – SubjectFull: Fractional programming Type: general – SubjectFull: Economic uncertainty Type: general – SubjectFull: Scarcity Type: general – SubjectFull: Optimization algorithms Type: general – SubjectFull: Cross-docking (Logistics) Type: general – SubjectFull: Inventory control Type: general – SubjectFull: Mixed integer linear programming Type: general Titles: – TitleFull: A logistics ratio-optimised inventory routing problem with lateral transhipment using mixed-integer robust fractional programming. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xingyu, Man – PersonEntity: Name: NameFull: Daofang, Chang – PersonEntity: Name: NameFull: Peng, Zheng – PersonEntity: Name: NameFull: Wanke, Han IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 12 Text: Dec2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 63 – Type: issue Value: 24 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |