IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i1p131-144.html
   My bibliography  Save this article

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

Author

Listed:
  • Bianchi, Leonora
  • Campbell, Ann Melissa

Abstract

No abstract is available for this item.

Suggested Citation

  • Bianchi, Leonora & Campbell, Ann Melissa, 2007. "Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 131-144, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:1:p:131-144
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00578-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gilbert Laporte & François V. Louveaux & Hélène Mercure, 1994. "A Priori Optimization of the Probabilistic Traveling Salesman Problem," Operations Research, INFORMS, vol. 42(3), pages 543-549, June.
    2. Oded Berman & David Simchi-Levi, 1988. "Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers," Transportation Science, INFORMS, vol. 22(2), pages 148-154, May.
    3. Bianchi, Leonora & Knowles, Joshua & Bowler, Neill, 2005. "Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms," European Journal of Operational Research, Elsevier, vol. 162(1), pages 206-219, April.
    4. Dimitris Bertsimas & Philippe Chervi & Michael Peterson, 1995. "Computational Approaches to Stochastic Vehicle Routing Problems," Transportation Science, INFORMS, vol. 29(4), pages 342-352, November.
    5. Bertsimas, Dimitris & Howell, Louis H., 1993. "Further results on the probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 65(1), pages 68-95, February.
    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. Liu, Yu-Hsin, 2008. "Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 332-346, December.
    2. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    3. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    4. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    5. Balaprakash, Prasanna & Birattari, Mauro & Stützle, Thomas & Dorigo, Marco, 2009. "Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 98-110, November.
    6. Klapp, Mathias A. & Erera, Alan L. & Toriello, Alejandro, 2018. "The Dynamic Dispatch Waves Problem for same-day delivery," European Journal of Operational Research, Elsevier, vol. 271(2), pages 519-534.
    7. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    8. Mauro Birattari & Prasanna Balaprakash & Thomas Stützle & Marco Dorigo, 2008. "Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 644-658, November.

    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. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    2. Liu, Yu-Hsin, 2008. "Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 332-346, December.
    3. Wen-Huei Yang & Kamlesh Mathur & Ronald H. Ballou, 2000. "Stochastic Vehicle Routing Problem with Restocking," Transportation Science, INFORMS, vol. 34(1), pages 99-112, February.
    4. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    5. Si Chen & Bruce Golden & Richard Wong & Hongsheng Zhong, 2009. "Arc-Routing Models for Small-Package Local Routing," Transportation Science, INFORMS, vol. 43(1), pages 43-55, February.
    6. Bianchi, Leonora & Knowles, Joshua & Bowler, Neill, 2005. "Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms," European Journal of Operational Research, Elsevier, vol. 162(1), pages 206-219, April.
    7. Karels, Vincent C.G. & Rei, Walter & Veelenturf, Lucas P. & Van Woensel, Tom, 2024. "A vehicle routing problem with multiple service agreements," European Journal of Operational Research, Elsevier, vol. 313(1), pages 129-145.
    8. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    9. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    10. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    11. repec:dgr:rugsom:02a11 is not listed on IDEAS
    12. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    13. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    14. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    15. Albareda-Sambola, Maria & van der Vlerk, Maarten H. & Fernandez, Elena, 2006. "Exact solutions to a class of stochastic generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 173(2), pages 465-487, September.
    16. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
    17. 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).
    18. Marlin W. Ulmer & Barrett W. Thomas & Dirk C. Mattfeld, 2019. "Preemptive depot returns for dynamic same-day delivery," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 327-361, December.
    19. 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.
    20. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    21. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.

    More about this item

    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:eee:ejores:v:176:y:2007:i:1:p:131-144. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.