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

A simple tabu search for warehouse location

Author

Listed:
  • Michel, Laurent
  • Van Hentenryck, Pascal

Abstract

No abstract is available for this item.

Suggested Citation

  • Michel, Laurent & Van Hentenryck, Pascal, 2004. "A simple tabu search for warehouse location," European Journal of Operational Research, Elsevier, vol. 157(3), pages 576-591, September.
    • Handle: RePEc:eee:ejores:v:157:y:2004:i:3:p:576-591
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00247-9
    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. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    2. Guignard, Monique, 1988. "A Lagrangean dual ascent algorithm for simple plant location problems," European Journal of Operational Research, Elsevier, vol. 35(2), pages 193-200, May.
    3. Gao, Li-Lian & Robinson, E. Powell, 1994. "Uncapacitated facility location: General solution procedure and computational experience," European Journal of Operational Research, Elsevier, vol. 76(3), pages 410-427, August.
    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. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    3. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    4. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    5. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2012. "A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon," International Journal of Production Economics, Elsevier, vol. 136(1), pages 218-230.
    6. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    7. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    8. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Ge, Houtian & Goetz, Stephan & Canning, Patrick & Perez, Agnes, 2018. "Optimal locations of fresh produce aggregation facilities in the United States with scale economies," International Journal of Production Economics, Elsevier, vol. 197(C), pages 143-157.
    10. Aksen, Deniz & Aras, Necati & Karaarslan, Ayse Gönül, 2009. "Design and analysis of government subsidized collection systems for incentive-dependent returns," International Journal of Production Economics, Elsevier, vol. 119(2), pages 308-327, June.
    11. Cordeau, Jean-François & Laporte, Gilbert & Pasin, Federico, 2008. "An iterated local search heuristic for the logistics network design problem with single assignment," International Journal of Production Economics, Elsevier, vol. 113(2), pages 626-640, June.
    12. Aras, Necati & Aksen, Deniz, 2008. "Locating collection centers for distance- and incentive-dependent returns," International Journal of Production Economics, Elsevier, vol. 111(2), pages 316-333, February.
    13. Jesica Armas & Angel A. Juan & Joan M. Marquès & João Pedro Pedroso, 2017. "Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1161-1176, October.
    14. Jaroslav Janáček & Ľuboš Buzna, 2008. "An acceleration of Erlenkotter-Körkel’s algorithms for the uncapacitated facility location problem," Annals of Operations Research, Springer, vol. 164(1), pages 97-109, November.
    15. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    16. Keskin, Burcu B. & Uster, Halit, 2007. "Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 663-682, October.
    17. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.

    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. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso, 2012. "Semi-Lagrangian relaxation applied to the uncapacitated facility location problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 387-409, January.
    3. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    4. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    5. Resende, Mauricio G.C. & Werneck, Renato F., 2006. "A hybrid multistart heuristic for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 54-68, October.
    6. Vaithyanathan, Shivakumar & Burke, Laura I. & Magent, Michael A., 1996. "Massively parallel analog tabu search using neural networks applied to simple plant location problems," European Journal of Operational Research, Elsevier, vol. 93(2), pages 317-330, September.
    7. Marin, Alfredo, 2007. "Lower bounds for the two-stage uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1126-1142, June.
    8. Dong Liang & Wilbert E. Wilhelm, 2013. "Dual‐ascent and primal heuristics for production‐assembly‐distribution system design," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 1-18, February.
    9. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    10. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    11. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.
    12. Syam, Siddhartha S. & Côté, Murray J., 2010. "A location-allocation model for service providers with application to not-for-profit health care organizations," Omega, Elsevier, vol. 38(3-4), pages 157-166, June.
    13. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    14. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    15. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    16. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    17. Oded Berman & Dmitry Krass, 2005. "An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure," Annals of Operations Research, Springer, vol. 136(1), pages 21-34, April.
    18. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
    19. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    20. Sabyasachi Mitra & Ishwar Murthy, 1998. "A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 40-55, February.

    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:157:y:2004:i:3:p:576-591. 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.