IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/62371.html
   My bibliography  Save this paper

A Hybrid GRASPxVNS Algorithm with Effective Depot Reduction Mechanism for the Capacitated Location Routing Problem

Author

Listed:
  • Stenger, A.
  • Schneider, M.
  • Enz, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Stenger, A. & Schneider, M. & Enz, S., 2011. "A Hybrid GRASPxVNS Algorithm with Effective Depot Reduction Mechanism for the Capacitated Location Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 62371, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  • Handle: RePEc:dar:wpaper:62371
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/62371/
    as

    Download full text from publisher

    File URL: http://www.is-frankfurt.de/fileadmin/user_upload/publicationsNew/AHybridGRASPxVNSAlgorithmwithE4262.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Barreto, Sergio & Ferreira, Carlos & Paixao, Jose & Santos, Beatriz Sousa, 2007. "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 968-977, June.
    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. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).

    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. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    2. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    3. Hashemi Doulabi, Seyed Hossein & Seifi, Abbas, 2013. "Lower and upper bounds for location-arc routing problems with vehicle capacity constraints," European Journal of Operational Research, Elsevier, vol. 224(1), pages 189-208.
    4. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    5. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    6. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    7. 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.
    8. Longlong Leng & Jingling Zhang & Chunmiao Zhang & Yanwei Zhao & Wanliang Wang & Gongfa Li, 2020. "A novel bi-objective model of cold chain logistics considering location-routing decision and environmental effects," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-29, April.
    9. Stenger, Andreas & Schneider, Michael & Schwind, Michael & Vigo, Daniele, 2012. "Location routing for small package shippers with subcontracting options," International Journal of Production Economics, Elsevier, vol. 140(2), pages 702-712.
    10. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    11. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    12. Tobias Harks & Felix G König & Jannik Matuschke, 2013. "Approximation Algorithms for Capacitated Location Routing," Transportation Science, INFORMS, vol. 47(1), pages 3-22, February.
    13. Carrasco Heine, Oscar F. & Demleitner, Antonia & Matuschke, Jannik, 2023. "Bifactor approximation for location routing with vehicle and facility capacities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 429-442.
    14. Kocaman, Ayse Selin & Huh, Woonghee Tim & Modi, Vijay, 2012. "Initial layout of power distribution systems for rural electrification: A heuristic algorithm for multilevel network design," Applied Energy, Elsevier, vol. 96(C), pages 302-315.
    15. Nadizadeh, Ali & Hosseini Nasab, Hasan, 2014. "Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 458-470.
    16. Ling Shen & Fengming Tao & Yuhe Shi & Ruiru Qin, 2019. "Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions," IJERPH, MDPI, vol. 16(16), pages 1-18, August.
    17. Longlong Leng & Yanwei Zhao & Jingling Zhang & Chunmiao Zhang, 2019. "An Effective Approach for the Multiobjective Regional Low-Carbon Location-Routing Problem," IJERPH, MDPI, vol. 16(11), pages 1-28, June.
    18. Walid Klibi & Francis Lasalle & Alain Martel & Soumia Ichoua, 2010. "The Stochastic Multiperiod Location Transportation Problem," Transportation Science, INFORMS, vol. 44(2), pages 221-237, May.
    19. Hunkar Toyoglu & Oya Karasan & Bahar Kara, 2012. "A New Formulation Approach for Location-Routing Problems," Networks and Spatial Economics, Springer, vol. 12(4), pages 635-659, December.
    20. Frank Plastria, 2010. "Comments on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 34-35, 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:dar:wpaper:62371. 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: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.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.