From strategic to tactical carriers’ selection: A new SDDP algorithm to handle dynamic stochastic demand
This paper addresses a Carrier’s Selection and Shipment Assignment Problem (CSSAP) in a distribution network where a set of products need to be shipped from warehouses to distribution centers to satisfy the demand at each distribution center at each period of a tactical planning horizon. The demand...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part C, Emerging technologies Jg. 177; S. 105174 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Ltd
01.08.2025
|
| Schlagworte: | |
| ISSN: | 0968-090X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper addresses a Carrier’s Selection and Shipment Assignment Problem (CSSAP) in a distribution network where a set of products need to be shipped from warehouses to distribution centers to satisfy the demand at each distribution center at each period of a tactical planning horizon. The demand at distribution centers is uncertain and back-ordering is permitted but penalized. Shipments are ensured by external carriers either strategic or spot ones. Strategic carriers are long-term contracts carriers with commitments to respect when solving the CSSAP. The problem is formulated as a multi-stage dynamic stochastic model. New variants of the Stochastic Dual Dynamic Programming (SDDP) algorithm are proposed to solve it. They consider novel cut removal techniques and new stopping criterion inspired by the concept of regret from the field of reinforcement learning. The concept of regret additionally enables evaluating the quality of the SDDP decisions, rarely addressed in the literature. We carried out experiments and evaluated our results against other cut removal strategies and stopping criteria reported in the literature. Our results first show that the SDDP algorithm is a good approach to solve the CSSAP under different contexts yielding good-quality solutions in a reasonable time. Second, some of the new variants we propose outperform existing ones and this is mostly due to the new techniques we propose to remove what we call the detrimental cuts. The new SDDP variants can be easily adapted to be used for any other problem to which a standard SDDP algorithm may apply.
•SDDP is appropriate for tactical planning of transport decisions under uncertainty.•The standard SDDP algorithm may generate detrimental cuts resulting in bad results.•Detecting and removing detrimental cuts improve the SDDP performance.•The novel concept of regret helps better analyze the quality of the SDDP solutions.•A stopping criterion using the concept of regret deteriorates the SDDP performance. |
|---|---|
| AbstractList | This paper addresses a Carrier’s Selection and Shipment Assignment Problem (CSSAP) in a distribution network where a set of products need to be shipped from warehouses to distribution centers to satisfy the demand at each distribution center at each period of a tactical planning horizon. The demand at distribution centers is uncertain and back-ordering is permitted but penalized. Shipments are ensured by external carriers either strategic or spot ones. Strategic carriers are long-term contracts carriers with commitments to respect when solving the CSSAP. The problem is formulated as a multi-stage dynamic stochastic model. New variants of the Stochastic Dual Dynamic Programming (SDDP) algorithm are proposed to solve it. They consider novel cut removal techniques and new stopping criterion inspired by the concept of regret from the field of reinforcement learning. The concept of regret additionally enables evaluating the quality of the SDDP decisions, rarely addressed in the literature. We carried out experiments and evaluated our results against other cut removal strategies and stopping criteria reported in the literature. Our results first show that the SDDP algorithm is a good approach to solve the CSSAP under different contexts yielding good-quality solutions in a reasonable time. Second, some of the new variants we propose outperform existing ones and this is mostly due to the new techniques we propose to remove what we call the detrimental cuts. The new SDDP variants can be easily adapted to be used for any other problem to which a standard SDDP algorithm may apply.
•SDDP is appropriate for tactical planning of transport decisions under uncertainty.•The standard SDDP algorithm may generate detrimental cuts resulting in bad results.•Detecting and removing detrimental cuts improve the SDDP performance.•The novel concept of regret helps better analyze the quality of the SDDP solutions.•A stopping criterion using the concept of regret deteriorates the SDDP performance. |
| ArticleNumber | 105174 |
| Author | Hajji, Adnène Boujemaa, Rania Schmiedel, Simon Rekik, Monia |
| Author_xml | – sequence: 1 givenname: Simon surname: Schmiedel fullname: Schmiedel, Simon – sequence: 2 givenname: Rania surname: Boujemaa fullname: Boujemaa, Rania – sequence: 3 givenname: Monia orcidid: 0000-0002-8731-1965 surname: Rekik fullname: Rekik, Monia email: monia.rekik@fsa.ulaval.ca – sequence: 4 givenname: Adnène orcidid: 0000-0002-1689-0939 surname: Hajji fullname: Hajji, Adnène |
| BookMark | eNp9kM9KAzEQh3OoYFt9AG95ga2T3e4_PZXWqlBQUMFbyE5m25TdjSRB8eZr-Ho-iSn17GmYGb4fM9-EjQY7EGMXAmYCRHG5nwWHsxTSPPa5KOcjNoa6qBKo4fWUTbzfA4Co83LM9mtne-6DU4G2BnmwPCgMBlXHUTlnyPmfr2_uqaM4tsMVX_CBPvjTavXIVbe1zoRdf-B2atAdcf05qD4m-WBxp3yM4pr6uDtjJ63qPJ3_1Sl7Wd88L--SzcPt_XKxSTDNRUh0oauywrJJdZ4iQJtmBVW6boiyom1KbLQCBIENKcoItK5BpBpEKdS8wjybMnHMRWe9d9TKN2d65T6lAHkQJPcyCpIHQfIoKDLXR4biYe_xaenR0ICkjYt_S23NP_QvzXJ1HQ |
| Cites_doi | 10.1007/BF01582895 10.3141/1854-18 10.1257/jel.20221679 10.1016/j.trb.2019.03.017 10.1016/j.cam.2015.04.048 10.1061/(ASCE)WR.1943-5452.0000713 10.1016/j.tre.2019.09.011 10.1016/j.trc.2008.03.001 10.1287/opre.2013.1182 10.1109/TPWRS.2023.3246724 10.1016/j.orl.2020.06.005 10.1007/s12667-011-0024-y 10.1080/13675567.2020.1751807 10.1016/j.orl.2021.06.019 10.1287/trsc.2019.0966 10.1016/j.ejor.2010.08.007 10.1007/s11067-013-9214-6 10.1109/TSTE.2017.2764065 10.1061/(ASCE)WR.1943-5452.0001050 10.1007/s10287-021-00411-x 10.1016/j.trb.2015.03.019 10.1016/j.trb.2021.04.010 10.1080/10556788.2020.1811705 10.1287/ijoc.2022.1215 10.1016/j.eswa.2022.118801 10.1016/S0019-9958(58)80003-0 10.1016/j.ejor.2018.05.025 10.1016/j.ejor.2022.11.051 10.1287/ijoc.2021.1118 10.1016/j.tre.2015.11.011 10.1007/s10107-015-0884-3 10.1007/s11081-020-09558-z 10.1007/s10107-020-01569-z 10.1016/j.trc.2013.07.006 10.1016/j.cor.2022.105982 10.1111/jbl.12333 10.1016/j.ejor.2007.08.018 10.1016/j.ejor.2016.10.047 |
| ContentType | Journal Article |
| Copyright | 2025 The Authors |
| Copyright_xml | – notice: 2025 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.trc.2025.105174 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| ExternalDocumentID | 10_1016_j_trc_2025_105174 S0968090X25001780 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AAEDT AAEDW AAFJI AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABLJU ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFS ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADJOM ADMUD ADNMO ADTZH AEBSH AECPX AEIPS AEKER AFJKZ AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIIUN AIKHN AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM APXCP ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HMY HVGLF HZ~ H~9 IHE J1W JJJVA KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDS SES SET SEW SPC SPCBC SSB SSD SSH SSO SSS SST SSV SSZ T5K TN5 WUQ XPP ~G- 9DU AAYXX ACLOT CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c251t-d6d878c7b2d52c00f236e8d9bee36fb7cbda0c01cbeae3e0dd9012d0171a48c53 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001502405300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0968-090X |
| IngestDate | Sat Nov 29 07:46:59 EST 2025 Sat Jul 05 17:13:11 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Transportation services procurement Shipment assignment Stochastic dual dynamic programming Carriers’ selection Uncertain demand Multistage model |
| Language | English |
| License | This is an open access article under the CC BY-NC license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c251t-d6d878c7b2d52c00f236e8d9bee36fb7cbda0c01cbeae3e0dd9012d0171a48c53 |
| ORCID | 0000-0002-8731-1965 0000-0002-1689-0939 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.trc.2025.105174 |
| ParticipantIDs | crossref_primary_10_1016_j_trc_2025_105174 elsevier_sciencedirect_doi_10_1016_j_trc_2025_105174 |
| PublicationCentury | 2000 |
| PublicationDate | August 2025 2025-08-00 |
| PublicationDateYYYYMMDD | 2025-08-01 |
| PublicationDate_xml | – month: 08 year: 2025 text: August 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Transportation research. Part C, Emerging technologies |
| PublicationYear | 2025 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Guigues, Shapiro, Cheng (b26) 2023; 308 Ávila, Papavasiliou, Löhndorf (b5) 2023; 39 Boujemma, Rekik, Hajji (b10) 2022 Bae, Lee, Kim, Lee (b6) 2023 Löhndorf, Wozabal, Minner (b32) 2013; 61 Kantari, Pujawan, Arvitrida, Hilletofth (b29) 2021; 24 Guigues, Bandarra (b25) 2019 Ávila, Papavasiliou, Löhndorf (b4) 2022; 19 Figliozzi, Mahmassani, Jaillet (b22) 2003; 1854 Remli, Amrouss, El Hallaoui, Rekik (b44) 2019; 123 Zhang, Ding, Li, Wang, Yao (b52) 2014; 14 Hammami, Rekik, Coelho (b27) 2021; 149 Yıldız, Sütçü (b51) 2023; 212 Pereira, Pinto (b39) 1991; 52 Delgado, Trincado, Pagnoncelli (b18) 2019; 131 Defourny, Ernst, Wehenkel (b17) 2012 Acocella, Caplice (b1) 2023; 44 Beltrán, Finardi, Fredo, de Oliveira (b8) 2022; 23 Shapiro (b46) 2011; 209 Tong, Yang, Luo, Rao (b50) 2020; 35 Garrido (b23) 2003; 9 Homem-de Mello, De Matos, Finardi (b36) 2011; 2 De Matos, Philpott, Finardi (b16) 2015; 290 Budak, Ustundag, Guloglu (b11) 2017; 97 Hammami, Rekik, Coelho (b28) 2022; 148 Lucchi, Caplice, Correll, Sheffi (b34) 2024 Agralı, Tan, Karaesmen (b2) 2008; 191 Rebennack (b43) 2016; 156 Feki, Hajji, Rekik (b21) 2016; 85 Plummer (b40) 2003 Poorsepahy-Samian, Espanmanesh, Zahraie (b41) 2016; 142 Kim, Park, Bae, Kim (b30) 2024 Lopez (b33) 2021 Zhang, Yao, Friesz, Sun (b53) 2015; 78 Shapiro, Cheng (b47) 2021; 49 Carpentier, Chancelier, Leclère, Pacaud (b13) 2018; 270 Côté, Arsenault (b15) 2019; 145 Fatouros, Konstantelos, Papadaskalopoulos, Strbac (b20) 2017; 10 Lindsey, Mahmassani (b31) 2017; 102 Quezada, Gicquel, Kedad-Sidhoum (b42) 2022; 34 Caplice, Sheffi (b12) 2006 Palacios-Huerta, Parkes, Steinberg (b38) 2024; 62 Guigues (b24) 2017; 258 Taheri (b48) 2024 Mes, van der Heijden, Schuur (b37) 2009; 17 Bellman (b7) 1958; 1 Ahmed, Cabral, Freitas Paulo da Costa (b3) 2022; 191 Thevenin, Adulyasak, Cordeau (b49) 2022; 34 Dowson, Morton, Pagnoncelli (b19) 2020; 48 Mbeutcha, Gendreau, Emiel (b35) 2021; 147 Collado, Chopra, Smilowitz (b14) 2020; 54 Berger, Bierwirth (b9) 2010; 46 Remli, Rekik (b45) 2013; 35 Caplice (10.1016/j.trc.2025.105174_b12) 2006 Plummer (10.1016/j.trc.2025.105174_b40) 2003 Poorsepahy-Samian (10.1016/j.trc.2025.105174_b41) 2016; 142 Shapiro (10.1016/j.trc.2025.105174_b47) 2021; 49 Feki (10.1016/j.trc.2025.105174_b21) 2016; 85 Garrido (10.1016/j.trc.2025.105174_b23) 2003; 9 Guigues (10.1016/j.trc.2025.105174_b24) 2017; 258 Carpentier (10.1016/j.trc.2025.105174_b13) 2018; 270 Bellman (10.1016/j.trc.2025.105174_b7) 1958; 1 Fatouros (10.1016/j.trc.2025.105174_b20) 2017; 10 Yıldız (10.1016/j.trc.2025.105174_b51) 2023; 212 Shapiro (10.1016/j.trc.2025.105174_b46) 2011; 209 Quezada (10.1016/j.trc.2025.105174_b42) 2022; 34 Beltrán (10.1016/j.trc.2025.105174_b8) 2022; 23 Côté (10.1016/j.trc.2025.105174_b15) 2019; 145 Agralı (10.1016/j.trc.2025.105174_b2) 2008; 191 Boujemma (10.1016/j.trc.2025.105174_b10) 2022 Taheri (10.1016/j.trc.2025.105174_b48) 2024 Collado (10.1016/j.trc.2025.105174_b14) 2020; 54 Pereira (10.1016/j.trc.2025.105174_b39) 1991; 52 Ávila (10.1016/j.trc.2025.105174_b4) 2022; 19 Mbeutcha (10.1016/j.trc.2025.105174_b35) 2021; 147 Guigues (10.1016/j.trc.2025.105174_b26) 2023; 308 Mes (10.1016/j.trc.2025.105174_b37) 2009; 17 Berger (10.1016/j.trc.2025.105174_b9) 2010; 46 Delgado (10.1016/j.trc.2025.105174_b18) 2019; 131 Guigues (10.1016/j.trc.2025.105174_b25) 2019 Remli (10.1016/j.trc.2025.105174_b45) 2013; 35 Thevenin (10.1016/j.trc.2025.105174_b49) 2022; 34 Zhang (10.1016/j.trc.2025.105174_b53) 2015; 78 Kim (10.1016/j.trc.2025.105174_b30) 2024 Löhndorf (10.1016/j.trc.2025.105174_b32) 2013; 61 Budak (10.1016/j.trc.2025.105174_b11) 2017; 97 Remli (10.1016/j.trc.2025.105174_b44) 2019; 123 Dowson (10.1016/j.trc.2025.105174_b19) 2020; 48 Figliozzi (10.1016/j.trc.2025.105174_b22) 2003; 1854 Ahmed (10.1016/j.trc.2025.105174_b3) 2022; 191 Hammami (10.1016/j.trc.2025.105174_b28) 2022; 148 Acocella (10.1016/j.trc.2025.105174_b1) 2023; 44 De Matos (10.1016/j.trc.2025.105174_b16) 2015; 290 Lucchi (10.1016/j.trc.2025.105174_b34) 2024 Defourny (10.1016/j.trc.2025.105174_b17) 2012 Kantari (10.1016/j.trc.2025.105174_b29) 2021; 24 Tong (10.1016/j.trc.2025.105174_b50) 2020; 35 Homem-de Mello (10.1016/j.trc.2025.105174_b36) 2011; 2 Palacios-Huerta (10.1016/j.trc.2025.105174_b38) 2024; 62 Zhang (10.1016/j.trc.2025.105174_b52) 2014; 14 Ávila (10.1016/j.trc.2025.105174_b5) 2023; 39 Hammami (10.1016/j.trc.2025.105174_b27) 2021; 149 Lindsey (10.1016/j.trc.2025.105174_b31) 2017; 102 Lopez (10.1016/j.trc.2025.105174_b33) 2021 Bae (10.1016/j.trc.2025.105174_b6) 2023 Rebennack (10.1016/j.trc.2025.105174_b43) 2016; 156 |
| References_xml | – volume: 1854 start-page: 162 year: 2003 end-page: 170 ident: b22 article-title: Framework for study of carrier strategies in auction-based transportation marketplace publication-title: Transp. Res. Rec. – start-page: 97 year: 2012 end-page: 143 ident: b17 article-title: Multistage stochastic programming: A scenario tree based approach to planning under uncertainty publication-title: Decision Theory Models for Applications in Artificial Intelligence: Concepts and Solutions – volume: 131 start-page: 292 year: 2019 end-page: 307 ident: b18 article-title: A multistage stochastic programming model for the network air cargo allocation under capacity uncertainty publication-title: Transp. Res. Part E: Logist. Transp. Rev. – volume: 97 start-page: 55 year: 2017 end-page: 68 ident: b11 article-title: A forecasting approach for truckload spot market pricing publication-title: Transp. Res. Part A – year: 2003 ident: b40 article-title: Bidder Response to Combinatorial Auctions in Truckload Procurement – volume: 62 start-page: 517 year: 2024 end-page: 553 ident: b38 article-title: Combinatorial auctions in practice publication-title: J. Econ. Lit. – volume: 102 start-page: 261 year: 2017 end-page: 273 ident: b31 article-title: Sourcing truckload capacity in the transportation spot market: A framework for third party providers publication-title: Transp. Res. Part A – volume: 34 start-page: 1024 year: 2022 end-page: 1041 ident: b42 article-title: Combining polyhedral approaches and stochastic dual dynamic integer programming for solving the uncapacitated lot-sizing problem under uncertainty publication-title: INFORMS J. Comput. – volume: 123 start-page: 127 year: 2019 end-page: 148 ident: b44 article-title: A robust optimization approach for the winner determination problem with uncertainty on shipment volumes and carriers’ capacity publication-title: Transp. Res. Part B: Methodol. – volume: 19 start-page: 199 year: 2022 end-page: 226 ident: b4 article-title: Parallel and distributed computing for stochastic dual dynamic programming publication-title: Comput. Manag. Sci. – volume: 149 start-page: 204 year: 2021 end-page: 229 ident: b27 article-title: Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions publication-title: Transp. Res. Part B: Methodol. – volume: 54 start-page: 588 year: 2020 end-page: 605 ident: b14 article-title: Partial demand information and commitment in dynamic transportation procurement publication-title: Transp. Sci. – volume: 142 year: 2016 ident: b41 article-title: Improved inflow modeling in stochastic dual dynamic programming publication-title: J. Water Resour. Plan. Manag. – volume: 212 year: 2023 ident: b51 article-title: A variant SDDP approach for periodic-review approximately optimal pricing of a slow-moving a item in a duopoly under price protection with end-of-life return and retail fixed markdown policy publication-title: Expert Syst. Appl. – start-page: 11267 year: 2023 end-page: 11287 ident: b6 article-title: Deep value function networks for large-scale multistage stochastic programs publication-title: International Conference on Artificial Intelligence and Statistics – volume: 39 start-page: 614 year: 2023 end-page: 627 ident: b5 article-title: Batch learning SDDP for long-term hydrothermal planning publication-title: IEEE Trans. Power Syst. – volume: 85 start-page: 149 year: 2016 end-page: 165 ident: b21 article-title: A hedging policy for carriers’ selection under availability and demand uncertainty publication-title: Transp. Res. Part E – volume: 52 start-page: 359 year: 1991 end-page: 375 ident: b39 article-title: Multistage stochastic optimization applied to energy planning publication-title: Math. Program. – year: 2021 ident: b33 article-title: Multi-Period Distribution Network Problems with Minimum Commitment Contracts – volume: 156 start-page: 343 year: 2016 end-page: 389 ident: b43 article-title: Combining sampling-based and scenario-based nested benders decomposition methods: application to stochastic dual dynamic programming publication-title: Math. Program. – volume: 23 start-page: 147 year: 2022 end-page: 168 ident: b8 article-title: Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers publication-title: Optim. Eng. – volume: 258 start-page: 47 year: 2017 end-page: 57 ident: b24 article-title: Dual dynamic programing with cut selection: Convergence proof and numerical experiments publication-title: European J. Oper. Res. – year: 2024 ident: b48 article-title: Accounting for Uncertainty: An Empirical Analysis of Truckload Budgeting – year: 2019 ident: b25 article-title: Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments – volume: 209 start-page: 63 year: 2011 end-page: 72 ident: b46 article-title: Analysis of stochastic dual programming method publication-title: European J. Oper. Res. – volume: 35 start-page: 1002 year: 2020 end-page: 1021 ident: b50 article-title: A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems publication-title: Optim. Methods Softw. – volume: 17 start-page: 208 year: 2009 end-page: 223 ident: b37 article-title: Dynamic threshold policy for delaying and breaking commitments in transportation auctions publication-title: Transp. Res. Part C – volume: 35 start-page: 204 year: 2013 end-page: 217 ident: b45 article-title: A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes publication-title: Transp. Res. Part C: Emerg. Technol. – volume: 14 start-page: 159 year: 2014 end-page: 181 ident: b52 article-title: A sampling-based stochastic winner determination model for truckload service procurement publication-title: Netw. Spat. Econ. – volume: 46 start-page: 627 year: 2010 end-page: 638 ident: b9 article-title: Solutions to the request reassignment problem in collaborative carrier networks publication-title: European J. Oper. Res. – start-page: 539 year: 2006 end-page: 571 ident: b12 article-title: Combinatorial auctions publication-title: Combinatorial Auctions – volume: 2 start-page: 1 year: 2011 end-page: 31 ident: b36 article-title: Sampling strategies and stopping criteria for stochastic dual dynamic programming: a case study in long-term hydrothermal scheduling publication-title: Energy Syst. – volume: 145 year: 2019 ident: b15 article-title: Efficient implementation of sampling stochastic dynamic programming algorithm for multireservoir management in the hydropower sector publication-title: J. Water Resour. Plan. Manag. – year: 2024 ident: b30 article-title: Transformer-based stagewise decomposition for large-scale multistage stochastic optimization – volume: 191 start-page: 755 year: 2022 end-page: 793 ident: b3 article-title: Stochastic Lipschitz dynamic programming publication-title: Math. Program. – year: 2024 ident: b34 article-title: Truckload Procurement: From State-of-the-Practice to State-of-the-Art – volume: 148 year: 2022 ident: b28 article-title: An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization publication-title: Comput. Oper. Res. – volume: 24 start-page: 280 year: 2021 end-page: 302 ident: b29 article-title: Investigating the mix of contract-based and on-demand sourcing for transportation services under fluctuate and seasonal demand publication-title: Int. J. Logist. Res. Appl. – volume: 34 start-page: 3151 year: 2022 end-page: 3169 ident: b49 article-title: Stochastic dual dynamic programming for multiechelon lot sizing with component substitution publication-title: INFORMS J. Comput. – year: 2022 ident: b10 article-title: Operationalizing Auction-based Strategic Carriers’ Selection in Distribution Networks – volume: 44 start-page: 228 year: 2023 end-page: 256 ident: b1 article-title: Research on truckload transportation procurement: A review, framework, and future research agenda publication-title: J. Bus. Logist. – volume: 49 start-page: 676 year: 2021 end-page: 681 ident: b47 article-title: Central limit theorem and sample complexity of stationary stochastic programs publication-title: Oper. Res. Lett. – volume: 9 start-page: 1067 year: 2003 end-page: 1078 ident: b23 article-title: Procurement of transportation services in spot markets under a double-auction scheme with elastic demand publication-title: Transp. Res. Part B – volume: 270 start-page: 1086 year: 2018 end-page: 1098 ident: b13 article-title: Stochastic decomposition applied to large-scale hydro valleys management publication-title: European J. Oper. Res. – volume: 147 year: 2021 ident: b35 article-title: Benefit of PARMA modeling for long-term hydroelectric scheduling using stochastic dual dynamic programming publication-title: IEEE Trans. Sustain. Energy – volume: 48 start-page: 505 year: 2020 end-page: 512 ident: b19 article-title: Partially observable multistage stochastic programming publication-title: Oper. Res. Lett. – volume: 10 start-page: 459 year: 2017 end-page: 469 ident: b20 article-title: Stochastic dual dynamic programming for operation of DER aggregators under multi-dimensional uncertainty publication-title: IEEE Trans. Sustain. Energy – volume: 61 start-page: 810 year: 2013 end-page: 823 ident: b32 article-title: Optimizing trading decisions for hydro storage systems using approximate dual dynamic programming publication-title: Oper. Res. – volume: 308 start-page: 752 year: 2023 end-page: 767 ident: b26 article-title: Duality and sensitivity analysis of multistage linear stochastic programs publication-title: European J. Oper. Res. – volume: 78 start-page: 16 year: 2015 end-page: 31 ident: b53 article-title: A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions publication-title: Transp. Res. Part B: Methodol. – volume: 1 start-page: 228 year: 1958 end-page: 239 ident: b7 article-title: Dynamic programming and stochastic control processes publication-title: Inf. Control – volume: 191 start-page: 272 year: 2008 end-page: 294 ident: b2 article-title: Modeling and analysis of an auction-based logistics market publication-title: European J. Oper. Res. – volume: 290 start-page: 196 year: 2015 end-page: 208 ident: b16 article-title: Improving the performance of stochastic dual dynamic programming publication-title: J. Comput. Appl. Math. – volume: 52 start-page: 359 year: 1991 ident: 10.1016/j.trc.2025.105174_b39 article-title: Multistage stochastic optimization applied to energy planning publication-title: Math. Program. doi: 10.1007/BF01582895 – volume: 1854 start-page: 162 year: 2003 ident: 10.1016/j.trc.2025.105174_b22 article-title: Framework for study of carrier strategies in auction-based transportation marketplace publication-title: Transp. Res. Rec. doi: 10.3141/1854-18 – volume: 62 start-page: 517 issue: 2 year: 2024 ident: 10.1016/j.trc.2025.105174_b38 article-title: Combinatorial auctions in practice publication-title: J. Econ. Lit. doi: 10.1257/jel.20221679 – volume: 123 start-page: 127 year: 2019 ident: 10.1016/j.trc.2025.105174_b44 article-title: A robust optimization approach for the winner determination problem with uncertainty on shipment volumes and carriers’ capacity publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/j.trb.2019.03.017 – volume: 290 start-page: 196 year: 2015 ident: 10.1016/j.trc.2025.105174_b16 article-title: Improving the performance of stochastic dual dynamic programming publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2015.04.048 – year: 2024 ident: 10.1016/j.trc.2025.105174_b30 – volume: 142 issue: 12 year: 2016 ident: 10.1016/j.trc.2025.105174_b41 article-title: Improved inflow modeling in stochastic dual dynamic programming publication-title: J. Water Resour. Plan. Manag. doi: 10.1061/(ASCE)WR.1943-5452.0000713 – volume: 131 start-page: 292 year: 2019 ident: 10.1016/j.trc.2025.105174_b18 article-title: A multistage stochastic programming model for the network air cargo allocation under capacity uncertainty publication-title: Transp. Res. Part E: Logist. Transp. Rev. doi: 10.1016/j.tre.2019.09.011 – volume: 17 start-page: 208 year: 2009 ident: 10.1016/j.trc.2025.105174_b37 article-title: Dynamic threshold policy for delaying and breaking commitments in transportation auctions publication-title: Transp. Res. Part C doi: 10.1016/j.trc.2008.03.001 – volume: 61 start-page: 810 issue: 4 year: 2013 ident: 10.1016/j.trc.2025.105174_b32 article-title: Optimizing trading decisions for hydro storage systems using approximate dual dynamic programming publication-title: Oper. Res. doi: 10.1287/opre.2013.1182 – volume: 46 start-page: 627 year: 2010 ident: 10.1016/j.trc.2025.105174_b9 article-title: Solutions to the request reassignment problem in collaborative carrier networks publication-title: European J. Oper. Res. – volume: 39 start-page: 614 issue: 1 year: 2023 ident: 10.1016/j.trc.2025.105174_b5 article-title: Batch learning SDDP for long-term hydrothermal planning publication-title: IEEE Trans. Power Syst. doi: 10.1109/TPWRS.2023.3246724 – volume: 48 start-page: 505 issue: 4 year: 2020 ident: 10.1016/j.trc.2025.105174_b19 article-title: Partially observable multistage stochastic programming publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2020.06.005 – volume: 2 start-page: 1 issue: 1 year: 2011 ident: 10.1016/j.trc.2025.105174_b36 article-title: Sampling strategies and stopping criteria for stochastic dual dynamic programming: a case study in long-term hydrothermal scheduling publication-title: Energy Syst. doi: 10.1007/s12667-011-0024-y – volume: 24 start-page: 280 year: 2021 ident: 10.1016/j.trc.2025.105174_b29 article-title: Investigating the mix of contract-based and on-demand sourcing for transportation services under fluctuate and seasonal demand publication-title: Int. J. Logist. Res. Appl. doi: 10.1080/13675567.2020.1751807 – year: 2022 ident: 10.1016/j.trc.2025.105174_b10 – year: 2003 ident: 10.1016/j.trc.2025.105174_b40 – volume: 49 start-page: 676 issue: 5 year: 2021 ident: 10.1016/j.trc.2025.105174_b47 article-title: Central limit theorem and sample complexity of stationary stochastic programs publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2021.06.019 – year: 2024 ident: 10.1016/j.trc.2025.105174_b34 – volume: 54 start-page: 588 year: 2020 ident: 10.1016/j.trc.2025.105174_b14 article-title: Partial demand information and commitment in dynamic transportation procurement publication-title: Transp. Sci. doi: 10.1287/trsc.2019.0966 – volume: 209 start-page: 63 year: 2011 ident: 10.1016/j.trc.2025.105174_b46 article-title: Analysis of stochastic dual programming method publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2010.08.007 – volume: 14 start-page: 159 issue: 2 year: 2014 ident: 10.1016/j.trc.2025.105174_b52 article-title: A sampling-based stochastic winner determination model for truckload service procurement publication-title: Netw. Spat. Econ. doi: 10.1007/s11067-013-9214-6 – volume: 10 start-page: 459 issue: 1 year: 2017 ident: 10.1016/j.trc.2025.105174_b20 article-title: Stochastic dual dynamic programming for operation of DER aggregators under multi-dimensional uncertainty publication-title: IEEE Trans. Sustain. Energy doi: 10.1109/TSTE.2017.2764065 – volume: 145 issue: 4 year: 2019 ident: 10.1016/j.trc.2025.105174_b15 article-title: Efficient implementation of sampling stochastic dynamic programming algorithm for multireservoir management in the hydropower sector publication-title: J. Water Resour. Plan. Manag. doi: 10.1061/(ASCE)WR.1943-5452.0001050 – volume: 19 start-page: 199 issue: 2 year: 2022 ident: 10.1016/j.trc.2025.105174_b4 article-title: Parallel and distributed computing for stochastic dual dynamic programming publication-title: Comput. Manag. Sci. doi: 10.1007/s10287-021-00411-x – volume: 78 start-page: 16 year: 2015 ident: 10.1016/j.trc.2025.105174_b53 article-title: A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/j.trb.2015.03.019 – start-page: 539 year: 2006 ident: 10.1016/j.trc.2025.105174_b12 article-title: Combinatorial auctions – volume: 149 start-page: 204 year: 2021 ident: 10.1016/j.trc.2025.105174_b27 article-title: Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/j.trb.2021.04.010 – volume: 35 start-page: 1002 issue: 5 year: 2020 ident: 10.1016/j.trc.2025.105174_b50 article-title: A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems publication-title: Optim. Methods Softw. doi: 10.1080/10556788.2020.1811705 – volume: 34 start-page: 3151 issue: 6 year: 2022 ident: 10.1016/j.trc.2025.105174_b49 article-title: Stochastic dual dynamic programming for multiechelon lot sizing with component substitution publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2022.1215 – start-page: 11267 year: 2023 ident: 10.1016/j.trc.2025.105174_b6 article-title: Deep value function networks for large-scale multistage stochastic programs – volume: 212 year: 2023 ident: 10.1016/j.trc.2025.105174_b51 article-title: A variant SDDP approach for periodic-review approximately optimal pricing of a slow-moving a item in a duopoly under price protection with end-of-life return and retail fixed markdown policy publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2022.118801 – year: 2024 ident: 10.1016/j.trc.2025.105174_b48 – volume: 1 start-page: 228 issue: 3 year: 1958 ident: 10.1016/j.trc.2025.105174_b7 article-title: Dynamic programming and stochastic control processes publication-title: Inf. Control doi: 10.1016/S0019-9958(58)80003-0 – volume: 97 start-page: 55 year: 2017 ident: 10.1016/j.trc.2025.105174_b11 article-title: A forecasting approach for truckload spot market pricing publication-title: Transp. Res. Part A – year: 2019 ident: 10.1016/j.trc.2025.105174_b25 – volume: 270 start-page: 1086 issue: 3 year: 2018 ident: 10.1016/j.trc.2025.105174_b13 article-title: Stochastic decomposition applied to large-scale hydro valleys management publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.05.025 – volume: 308 start-page: 752 issue: 2 year: 2023 ident: 10.1016/j.trc.2025.105174_b26 article-title: Duality and sensitivity analysis of multistage linear stochastic programs publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2022.11.051 – volume: 34 start-page: 1024 issue: 2 year: 2022 ident: 10.1016/j.trc.2025.105174_b42 article-title: Combining polyhedral approaches and stochastic dual dynamic integer programming for solving the uncapacitated lot-sizing problem under uncertainty publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2021.1118 – volume: 85 start-page: 149 year: 2016 ident: 10.1016/j.trc.2025.105174_b21 article-title: A hedging policy for carriers’ selection under availability and demand uncertainty publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2015.11.011 – volume: 102 start-page: 261 year: 2017 ident: 10.1016/j.trc.2025.105174_b31 article-title: Sourcing truckload capacity in the transportation spot market: A framework for third party providers publication-title: Transp. Res. Part A – volume: 9 start-page: 1067 year: 2003 ident: 10.1016/j.trc.2025.105174_b23 article-title: Procurement of transportation services in spot markets under a double-auction scheme with elastic demand publication-title: Transp. Res. Part B – volume: 147 year: 2021 ident: 10.1016/j.trc.2025.105174_b35 article-title: Benefit of PARMA modeling for long-term hydroelectric scheduling using stochastic dual dynamic programming publication-title: IEEE Trans. Sustain. Energy – volume: 156 start-page: 343 year: 2016 ident: 10.1016/j.trc.2025.105174_b43 article-title: Combining sampling-based and scenario-based nested benders decomposition methods: application to stochastic dual dynamic programming publication-title: Math. Program. doi: 10.1007/s10107-015-0884-3 – volume: 23 start-page: 147 year: 2022 ident: 10.1016/j.trc.2025.105174_b8 article-title: Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers publication-title: Optim. Eng. doi: 10.1007/s11081-020-09558-z – start-page: 97 year: 2012 ident: 10.1016/j.trc.2025.105174_b17 article-title: Multistage stochastic programming: A scenario tree based approach to planning under uncertainty – volume: 191 start-page: 755 issue: 2 year: 2022 ident: 10.1016/j.trc.2025.105174_b3 article-title: Stochastic Lipschitz dynamic programming publication-title: Math. Program. doi: 10.1007/s10107-020-01569-z – volume: 35 start-page: 204 year: 2013 ident: 10.1016/j.trc.2025.105174_b45 article-title: A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes publication-title: Transp. Res. Part C: Emerg. Technol. doi: 10.1016/j.trc.2013.07.006 – year: 2021 ident: 10.1016/j.trc.2025.105174_b33 – volume: 148 year: 2022 ident: 10.1016/j.trc.2025.105174_b28 article-title: An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105982 – volume: 44 start-page: 228 issue: 2 year: 2023 ident: 10.1016/j.trc.2025.105174_b1 article-title: Research on truckload transportation procurement: A review, framework, and future research agenda publication-title: J. Bus. Logist. doi: 10.1111/jbl.12333 – volume: 191 start-page: 272 year: 2008 ident: 10.1016/j.trc.2025.105174_b2 article-title: Modeling and analysis of an auction-based logistics market publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2007.08.018 – volume: 258 start-page: 47 issue: 1 year: 2017 ident: 10.1016/j.trc.2025.105174_b24 article-title: Dual dynamic programing with cut selection: Convergence proof and numerical experiments publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2016.10.047 |
| SSID | ssj0001957 |
| Score | 2.4385715 |
| Snippet | This paper addresses a Carrier’s Selection and Shipment Assignment Problem (CSSAP) in a distribution network where a set of products need to be shipped from... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 105174 |
| SubjectTerms | Carriers’ selection Multistage model Shipment assignment Stochastic dual dynamic programming Transportation services procurement Uncertain demand |
| Title | From strategic to tactical carriers’ selection: A new SDDP algorithm to handle dynamic stochastic demand |
| URI | https://dx.doi.org/10.1016/j.trc.2025.105174 |
| Volume | 177 |
| WOSCitedRecordID | wos001502405300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0968-090X databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001957 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LbtNAFB2FFAlYICggykuzYIXlamIn9phd6EPAoqpIkbKz5pXGprErx6265Dfg8_gS7rzsUEACJDZWZGnG1tyjO8eTc89F6CWVXBKp0pDHlIdjThchA9iEakxZJiORUS5Ns4n06IjO59nxYPDV18JcnqVVRa-usvP_Gmq4B8HWpbN_Ee5uUrgBvyHocIWww_WPAn-oC0bWznRWGG5pCqG0EQhrGtP62ikcsmBt2uA4fcdU9xcPZvv7xwE7O62bol2u9HjrxBBI27we5q7Fkml_50Cqle0A0hHczizdAst5CS13gao2bbBnUq-u-DRVWv5Yf0PIOBPLFbBiqx2YFateJfCmvijhcZbssqro9pMP6lNhcrrOT6xPqWVplApTWRk1AHUCAnfEAUjxAjt37uZrb3qhkznATLRwg8x_yOW2J8xP-4I9oih320bbVkYT3d54ZNsDXbPbnul59bTADSFbUXIDbUXpJKNDtDV9dzB_3-3zo8z6yPr38P-ZG_XgtQf9mvVsMJmTe-iu-wTBUwud-2igqm10y1eor7fRnQ2Tygeo1IDCHaBwW2MPKOwB9e3zF9xB6TWeYgAS1kDCHZD0OAsk7ICEeyBhC6SH6OPhwcne29B16AgF8OI2lImkKRUpj-QkEoQsojhRVGZcqThZ8FRwyYggI8EVU7EiUgL9jKT2aGJjKibxIzSs6ko9RlgXTPNEMCaTeKxIyhLJJ2oUkTSF4YTuoFd-BfNza8SSe4VimcNy53q5c7vcO2js1zh3TNIyxBwA8fthT_5t2FN0u0ftMzRsmwv1HN0Ul22xbl442HwHRoqbUQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=From+strategic+to+tactical+carriers%E2%80%99+selection%3A+A+new+SDDP+algorithm+to+handle+dynamic+stochastic+demand&rft.jtitle=Transportation+research.+Part+C%2C+Emerging+technologies&rft.au=Schmiedel%2C+Simon&rft.au=Boujemaa%2C+Rania&rft.au=Rekik%2C+Monia&rft.au=Hajji%2C+Adn%C3%A8ne&rft.date=2025-08-01&rft.pub=Elsevier+Ltd&rft.issn=0968-090X&rft.volume=177&rft_id=info:doi/10.1016%2Fj.trc.2025.105174&rft.externalDocID=S0968090X25001780 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0968-090X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0968-090X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0968-090X&client=summon |