東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Robust Inventory Induction Under Dem...

Robin, Arnaud,

Linked to FindBook

Google Book

Amazon

博客來

Robust Inventory Induction Under Demand Uncertainty /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Robust Inventory Induction Under Demand Uncertainty // Arnaud Robin.
Author:	Robin, Arnaud,
Description:	1 electronic resource (65 pages)
Notes:	Source: Masters Abstracts International, Volume: 86-05.
Contained By:	Masters Abstracts International86-05.
Subject:	Optimization techniques. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31652279
ISBN:	9798346380580

Robust Inventory Induction Under Demand Uncertainty /
Robin, Arnaud,

Robust Inventory Induction Under Demand Uncertainty /Arnaud Robin. - 1 electronic resource (65 pages)

Source: Masters Abstracts International, Volume: 86-05.

E-commerce retailers need to meet growing demand and rising customer expectations while efficiently managing operating costs across global supply chains. This thesis addresses the tactical problem of inventory induction under demand uncertainty, which involves determining where the position incoming inventory to serve future customer demand. We formulate the problem via two-stage adaptive robust optimization with right-hand side uncertainty. First-stage variables characterize initial induction and positioning and second-stage variables capture subsequent rebalancing and order fulfillment. Demand is modeled via an uncertainty set based on an aggregate forecast-at the nation-wide and monthly level-to protect against spatiotemporal deviations-at the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding strategies-including a novel simplicial relaxation. We also propose a cut-learning strategy from offline instances to warm-start the Benders decomposition scheme. We conduct extensive computational experiments, leveraging an experimental setup build on real-world data and developed in collaboration with a major e-commerce provider. From a computational standpoint, results show the benefits of the acceleration strategies for the subproblem and the master problem which, together, outperform state-of-the-art benchmarks in terms of optimality gaps, solution quality, and computational times. From a practical standpoint, results suggest that the adaptive robust solution can provide significant benefits on average against the deterministic benchmark, by mitigating operating costs by up to 5-10% and improving delivery speeds by up to 1%.

English

ISBN: 9798346380580Subjects--Topical Terms:

3681622
Optimization techniques.

Robust Inventory Induction Under Demand Uncertainty /
LDR:03097nmm a22003853i 4500 001 2430181
005 20250519114948.5
006 m o d
007 cr|nu||||||||
008 261011s2024 miu||||||m |||||||eng d
020 $a 9798346380580
035 $a (MiAaPQD)AAI31652279
035 $a (MiAaPQD)MIT1721_1_153669
035 $a AAI31652279
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Robin, Arnaud, $e author. $3 3818386
245 1 0 $a Robust Inventory Induction Under Demand Uncertainty / $c Arnaud Robin.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2024
300 $a 1 electronic resource (65 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 86-05.
500 $a Advisors: Jacquillat, Alexandre.
502 $b M.S. $c Massachusetts Institute of Technology $d 2024.
520 $a E-commerce retailers need to meet growing demand and rising customer expectations while efficiently managing operating costs across global supply chains. This thesis addresses the tactical problem of inventory induction under demand uncertainty, which involves determining where the position incoming inventory to serve future customer demand. We formulate the problem via two-stage adaptive robust optimization with right-hand side uncertainty. First-stage variables characterize initial induction and positioning and second-stage variables capture subsequent rebalancing and order fulfillment. Demand is modeled via an uncertainty set based on an aggregate forecast-at the nation-wide and monthly level-to protect against spatiotemporal deviations-at the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding strategies-including a novel simplicial relaxation. We also propose a cut-learning strategy from offline instances to warm-start the Benders decomposition scheme. We conduct extensive computational experiments, leveraging an experimental setup build on real-world data and developed in collaboration with a major e-commerce provider. From a computational standpoint, results show the benefits of the acceleration strategies for the subproblem and the master problem which, together, outperform state-of-the-art benchmarks in terms of optimality gaps, solution quality, and computational times. From a practical standpoint, results suggest that the adaptive robust solution can provide significant benefits on average against the deterministic benchmark, by mitigating operating costs by up to 5-10% and improving delivery speeds by up to 1%.
546 $a English
590 $a School code: 0753
650 4 $a Optimization techniques. $3 3681622
650 4 $a Planning. $3 552734
650 4 $a Decision making. $3 517204
650 4 $a Decomposition. $3 3561186
650 4 $a Shipments. $3 3706220
650 4 $a Order quantity. $3 3563945
690 $a 0505
690 $a 0454
690 $a 0796
710 2 $a Massachusetts Institute of Technology. $b Operations Research Center. $e degree granting institution. $3 3818387
720 1 $a Jacquillat, Alexandre $e degree supervisor.
773 0 $t Masters Abstracts International $g 86-05.
790 $a 0753
791 $a M.S.
792 $a 2024
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31652279