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

A perturbation-based heuristic for the capacitated multisource Weber problem

Author

Listed:
  • Zainuddin, Z.M.
  • Salhi, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Zainuddin, Z.M. & Salhi, S., 2007. "A perturbation-based heuristic for the capacitated multisource Weber problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1194-1207, June.
    • Handle: RePEc:eee:ejores:v:179:y:2007:i:3:p:1194-1207
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00083-X
    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. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    2. Leon Cooper, 1972. "The Transportation-Location Problem," Operations Research, INFORMS, vol. 20(1), pages 94-108, February.
    3. Domschke, Wolfgang & Drexl, Andreas, 1985. "ADD-heuristics' starting procedures for capacitated plant location models," European Journal of Operational Research, Elsevier, vol. 21(1), pages 47-53, July.
    4. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    5. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    6. S. Salhi & M.D.H. Gamal, 2003. "A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem," Annals of Operations Research, Springer, vol. 123(1), pages 203-222, October.
    7. Domschke, Wolfgang & Drexl, Andreas, 1985. "ADD – heuristics' starting procedures for capacitated plant location models," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 39287, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Jacobsen, Soren Kruse, 1983. "Heuristics for the capacitated plant location model," European Journal of Operational Research, Elsevier, vol. 12(3), pages 253-261, March.
    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. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    2. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    3. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
    4. 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.
    5. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    6. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    7. M. Akyüz & İ. Altınel & Temel Öncan, 2014. "Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 222(1), pages 45-71, 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. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    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. 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.
    5. 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.
    6. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    7. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    8. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    9. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    10. 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.
    11. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
    12. 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.
    13. Shiripour, Saber & Mahdavi-Amiri, Nezam, 2019. "Optimal distribution of the injured in a multi-type transportation network with damage-dependent travel times: Two metaheuristic approaches," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    14. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    15. Yang, Lili & Jones, Bryan F. & Yang, Shuang-Hua, 2007. "A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms," European Journal of Operational Research, Elsevier, vol. 181(2), pages 903-915, September.
    16. Bülent Çatay & Ş. Selçuk Erengüç & Asoo J. Vakharia, 2005. "Capacity allocation with machine duplication in semiconductor manufacturing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 659-667, October.
    17. Jean-Paul Arnaout & John Khoury, 2022. "Adaptation of WO to the Euclidean location-allocation with unknown number of facilities," Annals of Operations Research, Springer, vol. 315(1), pages 57-72, August.
    18. Sheu, Jiuh Biing & Kundu, Tanmoy, 2018. "Forecasting time-varying logistics distribution flows in the One Belt-One Road strategic context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 5-22.
    19. Abdolsalam Ghaderi & Mohammad Jabalameli & Farnaz Barzinpour & Ragheb Rahmaniani, 2012. "An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem," Networks and Spatial Economics, Springer, vol. 12(3), pages 421-439, September.
    20. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.

    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:179:y:2007:i:3:p:1194-1207. 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.