IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2256.html
   My bibliography  Save this paper

The dynamic traveling repairman problem

Author

Listed:
  • Bertsimas, Dimitris
  • Van Ryzin, Garrett.

Abstract

Includes bibliographical references (p. 30-32).

Suggested Citation

  • Bertsimas, Dimitris & Van Ryzin, Garrett., 1989. "The dynamic traveling repairman problem," Working papers 3036-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2256
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2256
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Patrick Jaillet, 1988. "A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited," Operations Research, INFORMS, vol. 36(6), pages 929-936, December.
    2. Averill M. Law & John S. Carson, 1979. "A Sequential Procedure for Determining the Length of a Steady-State Simulation," Operations Research, INFORMS, vol. 27(5), pages 1011-1025, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ha-Bang Ban, 2021. "A metaheuristic for the delivery man problem with time windows," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 794-816, May.
    2. Bertsimas, Dimitris. & Jaillet, Patrick. & Odoni, Amedeo R., 1989. "A priori optimization," Working papers 3059-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Mauricio Varas & Franco Basso & Armin Lüer-Villagra & Alejandro Mac Cawley & Sergio Maturana, 2019. "Managing premium wines using an $$(s - 1,s)$$ ( s - 1 , s ) inventory policy: a heuristic solution approach," Annals of Operations Research, Springer, vol. 280(1), pages 351-376, September.
    4. da Costa, Paulo & Verleijsdonk, Peter & Voorberg, Simon & Akcay, Alp & Kapodistria, Stella & van Jaarsveld, Willem & Zhang, Yingqian, 2023. "Policies for the dynamic traveling maintainer problem with alerts," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1141-1152.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Lada, Emily K. & Wilson, James R., 2006. "A wavelet-based spectral procedure for steady-state simulation analysis," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1769-1801, November.
    3. Enver Yücesan, 1993. "Randomization tests for initialization bias in simulation output," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 643-663, August.
    4. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    5. Souza, Gilvan C. & Wagner, Harvey M. & Whybark, D. Clay, 2001. "Evaluating focused factory benefits with queuing theory," European Journal of Operational Research, Elsevier, vol. 128(3), pages 597-610, February.
    6. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    7. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    8. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.
    9. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    10. Hall, Randolph W., 1992. "Pickup and Delivery Systems For Overnight Carriers," University of California Transportation Center, Working Papers qt5j97q5xc, University of California Transportation Center.
    11. Ripplinger, David, 2005. "The Stochastic School Transportation Problem," 46th Annual Transportation Research Forum, Washington, D.C., March 6-8, 2005 208214, Transportation Research Forum.
    12. Edward Kim, M. & Schonfeld, Paul & Roche, Austin & Raleigh, Chelsie, 2022. "Optimal service zones and frequencies for flexible-route freight deliveries," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 182-199.
    13. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    14. Ali Tafazzoli & James R. Wilson & Emily K. Lada & Natalie M. Steiger, 2011. "Performance of Skart: A Skewness- and Autoregression-Adjusted Batch Means Procedure for Simulation Analysis," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 297-314, May.
    15. Jabali, Ola & Gendreau, Michel & Laporte, Gilbert, 2012. "A continuous approximation model for the fleet composition problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1591-1606.
    16. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    17. Borenstein, Denis, 2000. "A directed acyclic graph representation of routing manufacturing flexibility," European Journal of Operational Research, Elsevier, vol. 127(1), pages 78-93, November.
    18. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    19. Pages, Laia & Jayakrishnan, R. & Cortes, Cristian E., 2005. "Real-Time Mass Passenger Transport Network Optimization Problems," University of California Transportation Center, Working Papers qt7w88d089, University of California Transportation Center.
    20. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.

    More about this item

    Keywords

    HD28 .M414 no.3036-; 89;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2256. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.