Stochastic programming models for a fleet sizing and appointment scheduling problem with random service and travel times
We propose a new stochastic mixed-integer linear programming model for a home service fleet sizing and appointment scheduling problem (HFASP) with random service and travel times. Specifically, given a set of providers and a set of geographically distributed customers within a service region, our mo...
Saved in:
| Published in: | Transportation research. Part C, Emerging technologies Vol. 165; p. 104692 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.08.2024
|
| Subjects: | |
| ISSN: | 0968-090X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We propose a new stochastic mixed-integer linear programming model for a home service fleet sizing and appointment scheduling problem (HFASP) with random service and travel times. Specifically, given a set of providers and a set of geographically distributed customers within a service region, our model solves the following problems simultaneously: (i) a fleet sizing problem that determines the number of providers required to serve customers; (ii) an assignment problem that assigns customers to providers; and (iii) a sequencing and scheduling problem that decides the sequence of appointment times of customers assigned to each provider. The objective is to minimize the fixed cost of hiring providers plus the expectation of a weighted sum of customers’ waiting time and providers’ travel time, overtime, and idle time. We compare our proposed model with an extension of an existing model for a closely related problem in the literature, theoretically and empirically. Specifically, we show that our newly proposed model is more compact (i.e., has fewer variables and constraints) and provides a tighter linear programming relaxation. Furthermore, to handle large instances observed in other application domains, we propose two optimization-based heuristics that decompose the HFASP decision process into two steps. The first step involves determining fleet sizing and assignment decisions, and the second constructs a routing plan and a schedule for each provider. We present extensive computational results to show the size and characteristics of HFASP instances that can be solved with our proposed model, demonstrating its computational efficiency over the extension. Results also show that the proposed heuristics can quickly produce high-quality solutions to large instances with an optimality gap not exceeding 5% on tested instances. Finally, we use a case study based on a service region in Lehigh County to derive insights into the HFASP.
•We study a fleet sizing and scheduling problem with random travel and service times.•We propose a new sequencing-based stochastic mixed-integer linear programming model.•Our model is more compact and has a tighter relaxation than the routing-based model.•Our model has superior computational efficiency compared to the routing-based model.•We propose optimization-based heuristics that produce high-quality solutions. |
|---|---|
| AbstractList | We propose a new stochastic mixed-integer linear programming model for a home service fleet sizing and appointment scheduling problem (HFASP) with random service and travel times. Specifically, given a set of providers and a set of geographically distributed customers within a service region, our model solves the following problems simultaneously: (i) a fleet sizing problem that determines the number of providers required to serve customers; (ii) an assignment problem that assigns customers to providers; and (iii) a sequencing and scheduling problem that decides the sequence of appointment times of customers assigned to each provider. The objective is to minimize the fixed cost of hiring providers plus the expectation of a weighted sum of customers’ waiting time and providers’ travel time, overtime, and idle time. We compare our proposed model with an extension of an existing model for a closely related problem in the literature, theoretically and empirically. Specifically, we show that our newly proposed model is more compact (i.e., has fewer variables and constraints) and provides a tighter linear programming relaxation. Furthermore, to handle large instances observed in other application domains, we propose two optimization-based heuristics that decompose the HFASP decision process into two steps. The first step involves determining fleet sizing and assignment decisions, and the second constructs a routing plan and a schedule for each provider. We present extensive computational results to show the size and characteristics of HFASP instances that can be solved with our proposed model, demonstrating its computational efficiency over the extension. Results also show that the proposed heuristics can quickly produce high-quality solutions to large instances with an optimality gap not exceeding 5% on tested instances. Finally, we use a case study based on a service region in Lehigh County to derive insights into the HFASP.
•We study a fleet sizing and scheduling problem with random travel and service times.•We propose a new sequencing-based stochastic mixed-integer linear programming model.•Our model is more compact and has a tighter relaxation than the routing-based model.•Our model has superior computational efficiency compared to the routing-based model.•We propose optimization-based heuristics that produce high-quality solutions. |
| ArticleNumber | 104692 |
| Author | Li, Shutian Shehadeh, Karmel S. Tsang, Man Yiu |
| Author_xml | – sequence: 1 givenname: Shutian orcidid: 0009-0005-9294-7326 surname: Li fullname: Li, Shutian email: shl919@lehigh.edu – sequence: 2 givenname: Karmel S. orcidid: 0000-0001-7842-0951 surname: Shehadeh fullname: Shehadeh, Karmel S. email: kas720@lehigh.edu – sequence: 3 givenname: Man Yiu orcidid: 0000-0002-0965-118X surname: Tsang fullname: Tsang, Man Yiu email: mat420@lehigh.edu |
| BookMark | eNp9kMlOwzAQhn0oEm3hAbj5BVJsJ00ccUIVS6VKHACJm-Xa49ZVHEe2KcvT41DOnEYz_6LRN0OT3veA0BUlC0pofX1YpKAWjLAq71XdsgmakrbmBWnJ2zmaxXgghNB22UzR53Pyai9jsgoPwe-CdM72O-y8hi5i4wOW2HQACUf7PSqy11gOg7d9ctDns9qDfu9GKRdsO3D4w6Y9DtnoHY4QjlbBbywFeYQOJ-sgXqAzI7sIl39zjl7v715Wj8Xm6WG9ut0UilVtKmoJEnhjlNnmf0sjjWGNKUsOpNIlEMmY4TXRTNXQGEOBZCOX22XLS8WNLOeInnpV8DEGMGII1snwJSgRIy5xEBmXGHGJE66cuTllMgI4WggiKgu9Am0DqCS0t_-kfwATPntG |
| Cites_doi | 10.1016/j.cor.2014.04.007 10.1080/07408170802165880 10.1016/j.cor.2016.07.019 10.1016/j.trc.2023.104023 10.1016/j.cie.2021.107255 10.1080/01605682.2020.1750311 10.1287/trsc.2019.0956 10.1080/0740817X.2011.635174 10.1016/j.omega.2019.03.015 10.1016/j.eswa.2018.02.025 10.1137/S1052623499363220 10.1287/serv.2021.0277 10.1287/trsc.1030.0046 10.1287/trsc.26.3.161 10.1016/j.ejor.2019.07.009 10.1080/00207543.2015.1082041 10.1287/trsc.2022.1153 10.1016/j.cor.2018.07.006 10.1016/j.ejor.2016.06.064 10.1287/inte.20.5.61 10.1007/s10729-006-9005-4 10.1007/s10696-019-09351-w 10.1016/j.ejor.2020.06.040 10.1016/j.cor.2018.08.002 10.1287/trsc.37.1.69.12820 10.1007/s10288-009-0097-9 10.1016/j.ejor.2020.05.037 10.1016/j.ejor.2019.06.023 10.1016/j.ejor.2017.03.060 10.1016/j.ejor.2022.09.020 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Ltd |
| Copyright_xml | – notice: 2024 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.trc.2024.104692 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| ExternalDocumentID | 10_1016_j_trc_2024_104692 S0968090X24002134 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXKI AAXUO AAYFN ABBOA ABLJU ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFS ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADJOM ADMUD ADNMO ADTZH AEBSH AECPX AEIPS AEKER AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC 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 SSO SSS SST SSV SSZ T5K TN5 WUQ XPP ~G- 9DU AATTM AAYWO AAYXX ACLOT AGQPQ AIIUN ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c249t-6aeae87fcfb9573faff27f338e04d3e0a22f860d2c6e7ff1e0fb98ab5983c8fa3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001261125600001&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 03:01:11 EST 2025 Sat Feb 01 16:09:47 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Routing Home services Scheduling Fleet sizing Stochastic programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c249t-6aeae87fcfb9573faff27f338e04d3e0a22f860d2c6e7ff1e0fb98ab5983c8fa3 |
| ORCID | 0000-0002-0965-118X 0009-0005-9294-7326 0000-0001-7842-0951 |
| ParticipantIDs | crossref_primary_10_1016_j_trc_2024_104692 elsevier_sciencedirect_doi_10_1016_j_trc_2024_104692 |
| PublicationCentury | 2000 |
| PublicationDate | August 2024 2024-08-00 |
| PublicationDateYYYYMMDD | 2024-08-01 |
| PublicationDate_xml | – month: 08 year: 2024 text: August 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Transportation research. Part C, Emerging technologies |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Gupta, Denton (b14) 2008; 40 Mancilla, Storer (b24) 2012; 44 Cinar, Salman, Bozkaya (b7) 2021; 289 Campbell, Savelsbergh (b6) 2004; 38 NAHC (b26) 2010 Tsang, Shehadeh (b34) 2023; 307 Laporte, Louveaux, Mercure (b21) 1992; 26 Kenyon, Morton (b17) 2003; 37 Toth, Vigo (b33) 2014 Liu, Tao, Xie (b23) 2019; 101 Di Mascolo, Martinez, Espinouse (b11) 2021; 158 Shapiro, Dentcheva, Ruszczynski (b29) 2021 Denton, Viapiano, Vogl (b10) 2007; 10 Zhan, Wan (b37) 2018; 100 Ahmadi-Javid, Jalali, Klassen (b1) 2017; 258 Cissé, Yalçındağ, Kergosien, Şahin, Lenté, Matta (b8) 2017; 13 Kim, Pasupathy, Henderson (b18) 2015 Camm, Raturi, Tsubakitani (b5) 1990; 20 Fikar, Hirsch (b12) 2017; 77 Shehadeh (b30) 2023; 57 Yu, Shen, Wang (b35) 2021; 13 Anderluh, Larsen, Hemmelmayr, Nolz (b3) 2020; 32 Lecluyse, Van Woensel, Peremans (b22) 2009; 7 Cook (b9) 2011 Han, Zhao, Chen, Luo, Mishra (b15) 2017; 262 Grieco, Utley, Crowe (b13) 2021; 72 Alkaabneh, Shehadeh, Diabat (b2) 2023; 149 Yuan, Liu, Jiang (b36) 2015; 53 Klotz, Newman (b20) 2013; 18 Berg, Denton, Erdogan, Rohleder, Huschka (b4) 2014; 50 Kleywegt, Shapiro, Homem-de Mello (b19) 2002; 12 Restrepo, Rousseau, Vallée (b28) 2020; 95 Nikzad, Bashiri, Abbasi (b27) 2021; 288 Homem-de Mello, Bayraksan (b25) 2014; 19 Shehadeh, Cohn, Epelman (b31) 2019; 279 Shi, Boudouh, Grunder, Wang (b32) 2018; 102 Hashemi Doulabi, Pesant, Rousseau (b16) 2020; 54 Zhan, Wang, Wan (b38) 2021; 288 Kenyon (10.1016/j.trc.2024.104692_b17) 2003; 37 Shapiro (10.1016/j.trc.2024.104692_b29) 2021 Grieco (10.1016/j.trc.2024.104692_b13) 2021; 72 Nikzad (10.1016/j.trc.2024.104692_b27) 2021; 288 Zhan (10.1016/j.trc.2024.104692_b38) 2021; 288 Liu (10.1016/j.trc.2024.104692_b23) 2019; 101 Berg (10.1016/j.trc.2024.104692_b4) 2014; 50 Toth (10.1016/j.trc.2024.104692_b33) 2014 Gupta (10.1016/j.trc.2024.104692_b14) 2008; 40 Han (10.1016/j.trc.2024.104692_b15) 2017; 262 Lecluyse (10.1016/j.trc.2024.104692_b22) 2009; 7 Yuan (10.1016/j.trc.2024.104692_b36) 2015; 53 Cook (10.1016/j.trc.2024.104692_b9) 2011 Yu (10.1016/j.trc.2024.104692_b35) 2021; 13 Alkaabneh (10.1016/j.trc.2024.104692_b2) 2023; 149 Di Mascolo (10.1016/j.trc.2024.104692_b11) 2021; 158 Fikar (10.1016/j.trc.2024.104692_b12) 2017; 77 Mancilla (10.1016/j.trc.2024.104692_b24) 2012; 44 Shehadeh (10.1016/j.trc.2024.104692_b31) 2019; 279 Hashemi Doulabi (10.1016/j.trc.2024.104692_b16) 2020; 54 Cissé (10.1016/j.trc.2024.104692_b8) 2017; 13 Shi (10.1016/j.trc.2024.104692_b32) 2018; 102 Zhan (10.1016/j.trc.2024.104692_b37) 2018; 100 Laporte (10.1016/j.trc.2024.104692_b21) 1992; 26 Camm (10.1016/j.trc.2024.104692_b5) 1990; 20 Cinar (10.1016/j.trc.2024.104692_b7) 2021; 289 Kleywegt (10.1016/j.trc.2024.104692_b19) 2002; 12 Ahmadi-Javid (10.1016/j.trc.2024.104692_b1) 2017; 258 Denton (10.1016/j.trc.2024.104692_b10) 2007; 10 Restrepo (10.1016/j.trc.2024.104692_b28) 2020; 95 Anderluh (10.1016/j.trc.2024.104692_b3) 2020; 32 Homem-de Mello (10.1016/j.trc.2024.104692_b25) 2014; 19 Campbell (10.1016/j.trc.2024.104692_b6) 2004; 38 NAHC (10.1016/j.trc.2024.104692_b26) 2010 Tsang (10.1016/j.trc.2024.104692_b34) 2023; 307 Klotz (10.1016/j.trc.2024.104692_b20) 2013; 18 Kim (10.1016/j.trc.2024.104692_b18) 2015 Shehadeh (10.1016/j.trc.2024.104692_b30) 2023; 57 |
| References_xml | – volume: 288 start-page: 753 year: 2021 end-page: 774 ident: b27 article-title: A matheuristic algorithm for stochastic home health care planning publication-title: European J. Oper. Res. – volume: 10 start-page: 13 year: 2007 end-page: 24 ident: b10 article-title: Optimization of surgery sequencing and scheduling decisions under uncertainty publication-title: Health Care Manag. Sci. – volume: 77 start-page: 86 year: 2017 end-page: 95 ident: b12 article-title: Home health care routing and scheduling: A review publication-title: Comput. Oper. Res. – volume: 307 start-page: 48 year: 2023 end-page: 63 ident: b34 article-title: Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times publication-title: European J. Oper. Res. – volume: 279 start-page: 721 year: 2019 end-page: 731 ident: b31 article-title: Analysis of models for the stochastic outpatient procedure scheduling problem publication-title: European J. Oper. Res. – volume: 100 start-page: 1 year: 2018 end-page: 11 ident: b37 article-title: Vehicle routing and appointment scheduling with team assignment for home services publication-title: Comput. Oper. Res. – volume: 12 start-page: 479 year: 2002 end-page: 502 ident: b19 article-title: The sample average approximation method for stochastic discrete optimization publication-title: SIAM J. Optim. – volume: 57 start-page: 197 year: 2023 end-page: 229 ident: b30 article-title: Distributionally robust optimization approaches for a stochastic mobile facility fleet sizing, routing, and scheduling problem publication-title: Transp. Sci. – volume: 158 year: 2021 ident: b11 article-title: Routing and scheduling in home health care: A literature survey and bibliometric analysis publication-title: Comput. Ind. Eng. – volume: 54 start-page: 1053 year: 2020 end-page: 1072 ident: b16 article-title: Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare publication-title: Transp. Sci. – volume: 262 start-page: 966 year: 2017 end-page: 980 ident: b15 article-title: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior publication-title: European J. Oper. Res. – volume: 258 start-page: 3 year: 2017 end-page: 34 ident: b1 article-title: Outpatient appointment systems in healthcare: A review of optimization studies publication-title: European J. Oper. Res. – volume: 289 start-page: 867 year: 2021 end-page: 878 ident: b7 article-title: Prioritized single nurse routing and scheduling for home healthcare services publication-title: European J. Oper. Res. – volume: 32 start-page: 806 year: 2020 end-page: 828 ident: b3 article-title: Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization publication-title: Flex. Serv. Manuf. J. – start-page: 207 year: 2015 end-page: 243 ident: b18 article-title: A guide to sample average approximation publication-title: Handbook of Simulation Optimization – year: 2014 ident: b33 article-title: Vehicle Routing: Problems, Methods, and Applications – volume: 37 start-page: 69 year: 2003 end-page: 82 ident: b17 article-title: Stochastic vehicle routing with random travel times publication-title: Transp. Sci. – volume: 288 start-page: 98 year: 2021 end-page: 110 ident: b38 article-title: Home service routing and appointment scheduling with stochastic service times publication-title: European J. Oper. Res. – volume: 40 start-page: 800 year: 2008 end-page: 819 ident: b14 article-title: Appointment scheduling in health care: Challenges and opportunities publication-title: IIE Trans. – volume: 95 year: 2020 ident: b28 article-title: Home healthcare integrated staffing and scheduling publication-title: Omega – volume: 13 start-page: 172 year: 2021 end-page: 191 ident: b35 article-title: Integrated vehicle routing and service scheduling under time and cancellation uncertainties with application in nonemergency medical transportation publication-title: Serv. Sci. – volume: 102 start-page: 218 year: 2018 end-page: 233 ident: b32 article-title: Modeling and solving simultaneous delivery and pick-up problem with stochastic travel and service times in home health care publication-title: Expert Syst. Appl. – volume: 7 start-page: 363 year: 2009 end-page: 377 ident: b22 article-title: Vehicle routing with stochastic time-dependent travel times publication-title: 4OR – year: 2011 ident: b9 article-title: In Pursuit of the Traveling Salesman – year: 2021 ident: b29 article-title: Lectures on Stochastic Programming: Modeling and Theory – volume: 38 start-page: 369 year: 2004 end-page: 378 ident: b6 article-title: Efficient insertion heuristics for vehicle routing and scheduling problems publication-title: Transp. Sci. – year: 2010 ident: b26 article-title: Basic statistics about home care – volume: 20 start-page: 61 year: 1990 end-page: 66 ident: b5 article-title: Cutting big M down to size publication-title: Interfaces – volume: 18 start-page: 18 year: 2013 end-page: 32 ident: b20 article-title: Practical guidelines for solving difficult mixed integer linear programs publication-title: Surv. Oper. Res. Manag. Sci. – volume: 101 start-page: 250 year: 2019 end-page: 262 ident: b23 article-title: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits publication-title: Comput. Oper. Res. – volume: 44 start-page: 655 year: 2012 end-page: 670 ident: b24 article-title: A sample average approximation approach to stochastic appointment sequencing and scheduling publication-title: IIE Trans. – volume: 50 start-page: 24 year: 2014 end-page: 37 ident: b4 article-title: Optimal booking and scheduling in outpatient procedure centers publication-title: Comput. Oper. Res. – volume: 19 start-page: 56 year: 2014 end-page: 85 ident: b25 article-title: Monte Carlo sampling-based methods for stochastic optimization publication-title: Surv. Oper. Res. Manag. Sci. – volume: 149 year: 2023 ident: b2 article-title: Routing and resource allocation in non-profit settings with equity and efficiency measures under demand uncertainty publication-title: Transp. Res. C – volume: 26 start-page: 161 year: 1992 end-page: 170 ident: b21 article-title: The vehicle routing problem with stochastic travel times publication-title: Transp. Sci. – volume: 13 start-page: 1 year: 2017 end-page: 22 ident: b8 article-title: OR problems related to Home Health Care: A review of relevant routing and scheduling problems publication-title: Oper. Res. Health Care – volume: 72 start-page: 1960 year: 2021 end-page: 1991 ident: b13 article-title: Operational research applied to decisions in home health care: A systematic literature review publication-title: J. Oper. Res. Soc. – volume: 53 start-page: 7450 year: 2015 end-page: 7464 ident: b36 article-title: A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements publication-title: Int. J. Prod. Res. – volume: 50 start-page: 24 year: 2014 ident: 10.1016/j.trc.2024.104692_b4 article-title: Optimal booking and scheduling in outpatient procedure centers publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.04.007 – volume: 40 start-page: 800 issue: 9 year: 2008 ident: 10.1016/j.trc.2024.104692_b14 article-title: Appointment scheduling in health care: Challenges and opportunities publication-title: IIE Trans. doi: 10.1080/07408170802165880 – year: 2011 ident: 10.1016/j.trc.2024.104692_b9 – volume: 77 start-page: 86 year: 2017 ident: 10.1016/j.trc.2024.104692_b12 article-title: Home health care routing and scheduling: A review publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.07.019 – volume: 149 year: 2023 ident: 10.1016/j.trc.2024.104692_b2 article-title: Routing and resource allocation in non-profit settings with equity and efficiency measures under demand uncertainty publication-title: Transp. Res. C doi: 10.1016/j.trc.2023.104023 – volume: 158 year: 2021 ident: 10.1016/j.trc.2024.104692_b11 article-title: Routing and scheduling in home health care: A literature survey and bibliometric analysis publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2021.107255 – volume: 72 start-page: 1960 issue: 9 year: 2021 ident: 10.1016/j.trc.2024.104692_b13 article-title: Operational research applied to decisions in home health care: A systematic literature review publication-title: J. Oper. Res. Soc. doi: 10.1080/01605682.2020.1750311 – volume: 54 start-page: 1053 issue: 4 year: 2020 ident: 10.1016/j.trc.2024.104692_b16 article-title: Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare publication-title: Transp. Sci. doi: 10.1287/trsc.2019.0956 – volume: 44 start-page: 655 issue: 8 year: 2012 ident: 10.1016/j.trc.2024.104692_b24 article-title: A sample average approximation approach to stochastic appointment sequencing and scheduling publication-title: IIE Trans. doi: 10.1080/0740817X.2011.635174 – volume: 95 year: 2020 ident: 10.1016/j.trc.2024.104692_b28 article-title: Home healthcare integrated staffing and scheduling publication-title: Omega doi: 10.1016/j.omega.2019.03.015 – volume: 102 start-page: 218 year: 2018 ident: 10.1016/j.trc.2024.104692_b32 article-title: Modeling and solving simultaneous delivery and pick-up problem with stochastic travel and service times in home health care publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2018.02.025 – volume: 12 start-page: 479 issue: 2 year: 2002 ident: 10.1016/j.trc.2024.104692_b19 article-title: The sample average approximation method for stochastic discrete optimization publication-title: SIAM J. Optim. doi: 10.1137/S1052623499363220 – year: 2021 ident: 10.1016/j.trc.2024.104692_b29 – volume: 13 start-page: 172 issue: 3 year: 2021 ident: 10.1016/j.trc.2024.104692_b35 article-title: Integrated vehicle routing and service scheduling under time and cancellation uncertainties with application in nonemergency medical transportation publication-title: Serv. Sci. doi: 10.1287/serv.2021.0277 – volume: 38 start-page: 369 issue: 3 year: 2004 ident: 10.1016/j.trc.2024.104692_b6 article-title: Efficient insertion heuristics for vehicle routing and scheduling problems publication-title: Transp. Sci. doi: 10.1287/trsc.1030.0046 – volume: 26 start-page: 161 issue: 3 year: 1992 ident: 10.1016/j.trc.2024.104692_b21 article-title: The vehicle routing problem with stochastic travel times publication-title: Transp. Sci. doi: 10.1287/trsc.26.3.161 – volume: 289 start-page: 867 issue: 3 year: 2021 ident: 10.1016/j.trc.2024.104692_b7 article-title: Prioritized single nurse routing and scheduling for home healthcare services publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.07.009 – volume: 19 start-page: 56 issue: 1 year: 2014 ident: 10.1016/j.trc.2024.104692_b25 article-title: Monte Carlo sampling-based methods for stochastic optimization publication-title: Surv. Oper. Res. Manag. Sci. – volume: 53 start-page: 7450 issue: 24 year: 2015 ident: 10.1016/j.trc.2024.104692_b36 article-title: A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2015.1082041 – volume: 57 start-page: 197 issue: 1 year: 2023 ident: 10.1016/j.trc.2024.104692_b30 article-title: Distributionally robust optimization approaches for a stochastic mobile facility fleet sizing, routing, and scheduling problem publication-title: Transp. Sci. doi: 10.1287/trsc.2022.1153 – volume: 100 start-page: 1 year: 2018 ident: 10.1016/j.trc.2024.104692_b37 article-title: Vehicle routing and appointment scheduling with team assignment for home services publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.07.006 – volume: 258 start-page: 3 issue: 1 year: 2017 ident: 10.1016/j.trc.2024.104692_b1 article-title: Outpatient appointment systems in healthcare: A review of optimization studies publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2016.06.064 – volume: 13 start-page: 1 year: 2017 ident: 10.1016/j.trc.2024.104692_b8 article-title: OR problems related to Home Health Care: A review of relevant routing and scheduling problems publication-title: Oper. Res. Health Care – volume: 20 start-page: 61 issue: 5 year: 1990 ident: 10.1016/j.trc.2024.104692_b5 article-title: Cutting big M down to size publication-title: Interfaces doi: 10.1287/inte.20.5.61 – volume: 10 start-page: 13 issue: 1 year: 2007 ident: 10.1016/j.trc.2024.104692_b10 article-title: Optimization of surgery sequencing and scheduling decisions under uncertainty publication-title: Health Care Manag. Sci. doi: 10.1007/s10729-006-9005-4 – volume: 32 start-page: 806 issue: 4 year: 2020 ident: 10.1016/j.trc.2024.104692_b3 article-title: Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization publication-title: Flex. Serv. Manuf. J. doi: 10.1007/s10696-019-09351-w – volume: 288 start-page: 753 issue: 3 year: 2021 ident: 10.1016/j.trc.2024.104692_b27 article-title: A matheuristic algorithm for stochastic home health care planning publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.06.040 – volume: 101 start-page: 250 year: 2019 ident: 10.1016/j.trc.2024.104692_b23 article-title: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.08.002 – volume: 37 start-page: 69 issue: 1 year: 2003 ident: 10.1016/j.trc.2024.104692_b17 article-title: Stochastic vehicle routing with random travel times publication-title: Transp. Sci. doi: 10.1287/trsc.37.1.69.12820 – volume: 18 start-page: 18 issue: 1–2 year: 2013 ident: 10.1016/j.trc.2024.104692_b20 article-title: Practical guidelines for solving difficult mixed integer linear programs publication-title: Surv. Oper. Res. Manag. Sci. – start-page: 207 year: 2015 ident: 10.1016/j.trc.2024.104692_b18 article-title: A guide to sample average approximation – volume: 7 start-page: 363 issue: 4 year: 2009 ident: 10.1016/j.trc.2024.104692_b22 article-title: Vehicle routing with stochastic time-dependent travel times publication-title: 4OR doi: 10.1007/s10288-009-0097-9 – volume: 288 start-page: 98 issue: 1 year: 2021 ident: 10.1016/j.trc.2024.104692_b38 article-title: Home service routing and appointment scheduling with stochastic service times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.05.037 – volume: 279 start-page: 721 issue: 3 year: 2019 ident: 10.1016/j.trc.2024.104692_b31 article-title: Analysis of models for the stochastic outpatient procedure scheduling problem publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.06.023 – year: 2014 ident: 10.1016/j.trc.2024.104692_b33 – volume: 262 start-page: 966 issue: 3 year: 2017 ident: 10.1016/j.trc.2024.104692_b15 article-title: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2017.03.060 – year: 2010 ident: 10.1016/j.trc.2024.104692_b26 – volume: 307 start-page: 48 issue: 1 year: 2023 ident: 10.1016/j.trc.2024.104692_b34 article-title: Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2022.09.020 |
| SSID | ssj0001957 |
| Score | 2.408245 |
| Snippet | We propose a new stochastic mixed-integer linear programming model for a home service fleet sizing and appointment scheduling problem (HFASP) with random... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 104692 |
| SubjectTerms | Fleet sizing Home services Routing Scheduling Stochastic programming |
| Title | Stochastic programming models for a fleet sizing and appointment scheduling problem with random service and travel times |
| URI | https://dx.doi.org/10.1016/j.trc.2024.104692 |
| Volume | 165 |
| WOSCitedRecordID | wos001261125600001&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/eLvHCXMwtV3da9swEBdZOlj7ULZupe0-0MOeFhz8FUl-LKWjG10ZuBvZk5FtCSckToidEva-_3unr8TrNtgGezHGWLK5-6E7nX53h9BrGvNSxGXsBZyVXpxExMtDST3CiiD3iSgiXfHm8zW9uWHjcfKx1_vmcmHuZrSu2WaTLP-rquEZKFulzv6FureTwgO4B6XDFdQO1z9SfNouioqr8suOfDVX4QDd8qYxpMmBnKmj6Gby1aUo8uVyMakN4xz2u2B_bJq6bjdjorVg1crFfNCY1cVQL1XzolmnQf20YwG1Z6_hZSsKVUNwWFft4EIvwCrvU-dqueB-h854rTkGabVuO-hNK1GByiubwzaHD6fDbeShsYHvD7BgfZmsu9GMMN5y6WyIzaXZ7DhNOlZJFEfDH_-wbJseEz-ZABONmA7blapQGcb6FNv027tXWTtV86ppFY9WVbZ7gPZCOkpYH-2dv7scv9-a9CAxJWPdf7jjcU0UvPehXzs4Hafl9jE6tLsNfG5Q8gT1RH2EHrlk9OYIHXTqUT5Fmx12cAc72GAHA3Ywxxo72GAHAwhwBzt4hx1ssYMVdrDBDrbY0cMMdrDGzjP06e3l7cWVZ1tzeAXs11uPcMEFo7KQOYgmklzKkMooYsKPy0j4PAwlI34ZFkRQKQPhw4uM5yDcqGCSR8eoXy9qcYKwJHkeUOILsB1xPuIqICBpIDgV5agk_il64-SZLU0FlsxRE6cZCD9Tws-M8E9R7CSeWRfSuIYZwOP3w87-bdhztL_D8AvUb1dr8RI9LO7aSbN6ZUH0HbscnWw |
| 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=Stochastic+programming+models+for+a+fleet+sizing+and+appointment+scheduling+problem+with+random+service+and+travel+times&rft.jtitle=Transportation+research.+Part+C%2C+Emerging+technologies&rft.au=Li%2C+Shutian&rft.au=Shehadeh%2C+Karmel+S.&rft.au=Tsang%2C+Man+Yiu&rft.date=2024-08-01&rft.pub=Elsevier+Ltd&rft.issn=0968-090X&rft.volume=165&rft_id=info:doi/10.1016%2Fj.trc.2024.104692&rft.externalDocID=S0968090X24002134 |
| 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 |