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

Variable neighborhood tabu search and its application to the median cycle problem

Author

Listed:
  • Moreno Perez, Jose A.
  • Marcos Moreno-Vega, J.
  • Rodriguez Martin, Inmaculada

Abstract

No abstract is available for this item.

Suggested Citation

  • Moreno Perez, Jose A. & Marcos Moreno-Vega, J. & Rodriguez Martin, Inmaculada, 2003. "Variable neighborhood tabu search and its application to the median cycle problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 365-378, December.
    • Handle: RePEc:eee:ejores:v:151:y:2003:i:2:p:365-378
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00831-7
    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. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    2. Vicki Aaronson Hutson & Charles S. ReVelle, 1989. "Maximal Direct Covering Tree Problems," Transportation Science, INFORMS, vol. 23(4), pages 288-299, November.
    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. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    2. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    3. Naji-Azimi, Z. & Renaud, J. & Ruiz, A. & Salari, M., 2012. "A covering tour approach to the location of satellite distribution centers to supply humanitarian aid," European Journal of Operational Research, Elsevier, vol. 222(3), pages 596-605.
    4. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    5. Ahmed Kouider & Hacène Ait Haddadène & Samia Ourari & Ammar Oulamara, 2017. "Mixed graph colouring for unit-time scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1720-1729, March.
    6. Corman, Francesco & D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2010. "A tabu search algorithm for rerouting trains during rail operations," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 175-192, January.
    7. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    8. Kaarthik Sundar & Sivakumar Rathinam, 2017. "Multiple depot ring star problem: a polyhedral study and an exact algorithm," Journal of Global Optimization, Springer, vol. 67(3), pages 527-551, March.
    9. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    10. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 0. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-25.
    11. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.
    12. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    13. Burkart, Wolfgang R. & Klein, Robert & Mayer, Stefan, 2012. "Product line pricing for services with capacity constraints and dynamic substitution," European Journal of Operational Research, Elsevier, vol. 219(2), pages 347-359.
    14. Lari, Isabella & Ricca, Federica & Scozzari, Andrea, 2008. "Comparing different metaheuristic approaches for the median path problem with bounded length," European Journal of Operational Research, Elsevier, vol. 190(3), pages 587-597, November.
    15. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2016. "MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 377-388.
    16. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 2021. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 499-523, October.
    17. Jose Carlos Molina & Ignacio Eguia & Jesus Racero, 2019. "Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 253-287, July.
    18. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.

    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. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    2. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    3. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    4. T. Boffey, 1998. "Efficient solution methods for covering tree problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 205-221, December.
    5. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    6. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    7. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    8. Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    9. Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong, 2018. "Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 117-142, June.
    10. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
    11. Leticia Vargas & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2017. "A dynamic programming operator for tour location problems applied to the covering tour problem," Journal of Heuristics, Springer, vol. 23(1), pages 53-80, February.
    12. Afshartous, David & Guan, Yongtao & Mehrotra, Anuj, 2009. "US Coast Guard air station location with respect to distress calls: A spatial statistics and optimization based methodology," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1086-1096, August.
    13. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    14. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    15. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    16. Peter Mullarkey & Grant Butler & Srinagesh Gavirneni & Douglas Morrice, 2007. "Schlumberger Uses Simulation in Bidding and Executing Land Seismic Surveys," Interfaces, INFORMS, vol. 37(2), pages 120-132, April.
    17. Christian Burkart & Pamela C. Nolz & Walter J. Gutjahr, 2017. "Modelling beneficiaries’ choice in disaster relief logistics," Annals of Operations Research, Springer, vol. 256(1), pages 41-61, September.
    18. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    19. Walton Pereira Coutinho & Roberto Quirino do Nascimento & Artur Alves Pessoa & Anand Subramanian, 2016. "A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 752-765, November.
    20. R Baldacci & E Bartolini & G Laporte, 2010. "Some applications of the generalized vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1072-1077, July.

    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:151:y:2003:i:2:p:365-378. 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.