IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v11y2011i1p83-99.html
   My bibliography  Save this article

New Genetic Algorithms Based Approaches to Continuous p-Median Problem

Author

Listed:
  • M. Neema
  • K. Maniruzzaman
  • A. Ohgai

Abstract

No abstract is available for this item.

Suggested Citation

  • M. Neema & K. Maniruzzaman & A. Ohgai, 2011. "New Genetic Algorithms Based Approaches to Continuous p-Median Problem," Networks and Spatial Economics, Springer, vol. 11(1), pages 83-99, March.
    • Handle: RePEc:kap:netspa:v:11:y:2011:i:1:p:83-99
    DOI: 10.1007/s11067-008-9084-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-008-9084-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-008-9084-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    2. Osman Alp & Erhan Erkut & Zvi Drezner, 2003. "An Efficient Genetic Algorithm for the p-Median Problem," Annals of Operations Research, Springer, vol. 122(1), pages 21-42, September.
    3. 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.
    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. 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).

    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. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    2. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    3. Junming Liu & Weiwei Chen & Jingyuan Yang & Hui Xiong & Can Chen, 2022. "Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 769-789, March.
    4. Rafael Pastor & Albert Corominas, 2004. "Branch and win: OR tree search algorithms for solving combinatorial optimisation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 169-191, June.
    5. Mariano Gallo, 2019. "An Optimisation Model to Consider the NIMBY Syndrome within the Landfill Siting Problem," Sustainability, MDPI, vol. 11(14), pages 1-18, July.
    6. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    7. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    8. Chandra Irawan & Said Salhi, 2015. "Solving large $$p$$ p -median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search," Journal of Global Optimization, Springer, vol. 63(3), pages 537-554, November.
    9. Medal, Hugh R. & Pohl, Edward A. & Rossetti, Manuel D., 2014. "A multi-objective integrated facility location-hardening model: Analyzing the pre- and post-disruption tradeoff," European Journal of Operational Research, Elsevier, vol. 237(1), pages 257-270.
    10. 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).
    11. Jafar Fathali & Hossein Kakhki & Rainer Burkard, 2006. "An ant colony algorithm for the pos/neg weighted p-median problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 229-246, September.
    12. Xiang Zhao & Xiaoya Ma & Kun Wang & Yuqing Long & Dongjie Zhang & Zhanchun Xiao, 2017. "A Spatially Explicit Optimization Model for Agricultural Straw-Based Power Plant Site Selection: A Case Study in Hubei Province, China," Sustainability, MDPI, vol. 9(5), pages 1-19, May.
    13. Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
    14. Irawan, Chandra Ade & Salhi, Said & Scaparra, Maria Paola, 2014. "An adaptive multiphase approach for large unconditional and conditional p-median problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 590-605.
    15. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    16. Richard L. Church & Zvi Drezner & Pawel Kalczynski, 2023. "Extensions to the planar p-median problem," Annals of Operations Research, Springer, vol. 326(1), pages 115-135, July.
    17. 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.
    18. B. Jayalakshmi & Alok Singh, 2017. "A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 67-93, March.
    19. Emel Aktaş & Özay Özaydın & Burçin Bozkaya & Füsun Ülengin & Şule Önsel, 2013. "Optimizing Fire Station Locations for the Istanbul Metropolitan Municipality," Interfaces, INFORMS, vol. 43(3), pages 240-255, May-June.
    20. Wangshu Mu & Daoqin Tong, 2020. "On solving large p-median problems," Environment and Planning B, , vol. 47(6), pages 981-996, July.

    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:kap:netspa:v:11:y:2011:i:1:p:83-99. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.