File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tre.2023.103193
- Scopus: eid_2-s2.0-85162876417
- WOS: WOS:001057806000001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Scenario-based Distributionally Robust Optimization for the Stochastic Inventory Routing Problem
Title | Scenario-based Distributionally Robust Optimization for the Stochastic Inventory Routing Problem |
---|---|
Authors | |
Keywords | Column generation Decision rule Distributionally robust optimization Inventory routing Scenario-based |
Issue Date | 1-Aug-2023 |
Publisher | Elsevier |
Citation | Transportation Research Part E: Logistics and Transportation Review, 2023, v. 176 How to Cite? |
Abstract | We consider a class of the inventory routing problem in a discrete and finite time horizon, where the demand for homogeneous products at retail stores is uncertain and varies across different scenarios. The supplier is required to determine the times to visit retailers, the replenishment quantities to each retailer, and the routing of a vehicle so as to minimize the sum of stockout, holding, and transportation costs. We propose a scenario-based distributionally robust optimization framework to tackle this problem. We transform the distributionally robust optimization model into a mixed-integer problem, which can be solved efficiently by our proposed algorithm. We adopt a warm-start procedure that utilizes the solution to the nominal model in our methodological framework. Then we apply a Tabu search algorithm, integrated with column generation, to solve a set-partitioning-like integer linear programming model so that a better route set can be identified. By doing so, a large-scale scenario-based distributionally robust optimization model can be solved. We conduct a case study of a fuel company and construct realistic instances to demonstrate the performance of our proposed method. Computational results suggest that the model taking into account various scenarios is more effective when random demands can be classified; the model with a linear decision rule outperforms a non-adaptive model; and the model with the route set identified by an improved algorithm can deliver a better solution than the original route set. |
Persistent Identifier | http://hdl.handle.net/10722/331217 |
ISSN | 2023 Impact Factor: 8.3 2023 SCImago Journal Rankings: 2.884 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, R | - |
dc.contributor.author | Cui, Z | - |
dc.contributor.author | Kuo, YH | - |
dc.contributor.author | Zhang, L | - |
dc.date.accessioned | 2023-09-21T06:53:47Z | - |
dc.date.available | 2023-09-21T06:53:47Z | - |
dc.date.issued | 2023-08-01 | - |
dc.identifier.citation | Transportation Research Part E: Logistics and Transportation Review, 2023, v. 176 | - |
dc.identifier.issn | 1366-5545 | - |
dc.identifier.uri | http://hdl.handle.net/10722/331217 | - |
dc.description.abstract | We consider a class of the inventory routing problem in a discrete and finite time horizon, where the demand for homogeneous products at retail stores is uncertain and varies across different scenarios. The supplier is required to determine the times to visit retailers, the replenishment quantities to each retailer, and the routing of a vehicle so as to minimize the sum of stockout, holding, and transportation costs. We propose a scenario-based distributionally robust optimization framework to tackle this problem. We transform the distributionally robust optimization model into a mixed-integer problem, which can be solved efficiently by our proposed algorithm. We adopt a warm-start procedure that utilizes the solution to the nominal model in our methodological framework. Then we apply a Tabu search algorithm, integrated with column generation, to solve a set-partitioning-like integer linear programming model so that a better route set can be identified. By doing so, a large-scale scenario-based distributionally robust optimization model can be solved. We conduct a case study of a fuel company and construct realistic instances to demonstrate the performance of our proposed method. Computational results suggest that the model taking into account various scenarios is more effective when random demands can be classified; the model with a linear decision rule outperforms a non-adaptive model; and the model with the route set identified by an improved algorithm can deliver a better solution than the original route set. | - |
dc.language | eng | - |
dc.publisher | Elsevier | - |
dc.relation.ispartof | Transportation Research Part E: Logistics and Transportation Review | - |
dc.subject | Column generation | - |
dc.subject | Decision rule | - |
dc.subject | Distributionally robust optimization | - |
dc.subject | Inventory routing | - |
dc.subject | Scenario-based | - |
dc.title | Scenario-based Distributionally Robust Optimization for the Stochastic Inventory Routing Problem | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.tre.2023.103193 | - |
dc.identifier.scopus | eid_2-s2.0-85162876417 | - |
dc.identifier.volume | 176 | - |
dc.identifier.isi | WOS:001057806000001 | - |
dc.identifier.issnl | 1366-5545 | - |