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

A review of extensive facility location in networks

Author

Listed:
  • Mesa, Juan A.
  • Brian Boffey, T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    • Handle: RePEc:eee:ejores:v:95:y:1996:i:3:p:592-603
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00321-5
    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. Current, John & Pirkul, Hasan, 1991. "Theory and methodologyThe hierarchical network design problem with transshipment facilities," European Journal of Operational Research, Elsevier, vol. 51(3), pages 338-347, April.
    2. Richard Church & John Current, 1993. "Maximal covering tree problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 129-142, February.
    3. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    4. Hasan Pirkul & John Current & V. Nagarajan, 1991. "The Hierarchical Network Design Problem: A New Formulation and Solution Procedures," Transportation Science, INFORMS, vol. 25(3), pages 175-182, August.
    5. Charles ReVelle & Jared Cohon & Donald Shobrys, 1991. "Simultaneous Siting and Routing in the Disposal of Hazardous Wastes," Transportation Science, INFORMS, vol. 25(2), pages 138-145, May.
    6. Oded Berman & Gabriel Y. Handler, 1987. "Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations," Transportation Science, INFORMS, vol. 21(2), pages 115-122, May.
    7. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    8. Jacobsen, S. K. & Madsen, O. B. G., 1980. "A comparative study of heuristics for a two-level routing-location problem," European Journal of Operational Research, Elsevier, vol. 5(6), pages 378-387, December.
    9. Current, John & Min, HoKey, 1986. "Multiobjective design of transportation networks: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 26(2), pages 187-201, August.
    10. George F. List & Pitu B. Mirchandani & Mark A. Turnquist & Konstantinos G. Zografos, 1991. "Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location," Transportation Science, INFORMS, vol. 25(2), pages 100-114, May.
    11. Duin, Cees & Volgenant, Anton, 1989. "Reducing the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 39(3), pages 332-344, April.
    12. Oded Berman & Mina Rasty Rahnama, 1983. "Optimal Path of a Single Service Unit on a Network to a “Nonemergency” Destination," Transportation Science, INFORMS, vol. 17(2), pages 218-232, May.
    13. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    14. Current, John R. & ReVelle, Charles S. & Cohon, Jared L., 1986. "The hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 27(1), pages 57-66, October.
    15. John R. Current, 1988. "The Design of a Hierarchical Transportation Network with Transshipment Facilities," Transportation Science, INFORMS, vol. 22(4), pages 270-277, November.
    16. Laurel Lindner-Dutton & Rajan Batta & Mark H. Karwan, 1991. "Equitable Sequencing of a Given Set of Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 25(2), pages 124-137, May.
    17. Wijeratne, Ajith B. & Turnquist, Mark A. & Mirchandani, Pitu B., 1993. "Multiobjective routing of hazardous materials in stochastic networks," European Journal of Operational Research, Elsevier, vol. 65(1), pages 33-43, February.
    18. Hutson, Vicki Aaronson & ReVelle, Charles, 1993. "Indirect covering tree problems on spanning tree networks," European Journal of Operational Research, Elsevier, vol. 65(1), pages 20-32, February.
    19. George List & Pitu Mirchandani, 1991. "An Integrated Network/Planar Multiobjective Model for Routing and Siting for Hazardous Materials and Wastes," Transportation Science, INFORMS, vol. 25(2), pages 146-156, May.
    20. Rajan Batta & Samuel S. Chiu, 1988. "Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials," Operations Research, INFORMS, vol. 36(1), pages 84-92, February.
    21. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    22. Curtis L. Stowers & Udatta S. Palekar, 1993. "Location Models with Routing Considerations for a Single Obnoxious Facility," Transportation Science, INFORMS, vol. 27(4), pages 350-362, November.
    23. John Current & Hasan Pirkul & Erik Rolland, 1994. "Efficient Algorithms for Solving the Shortest Covering Path Problem," Transportation Science, INFORMS, vol. 28(4), pages 317-327, November.
    24. Peter J. Slater, 1982. "Locating Central Paths in a Graph," Transportation Science, INFORMS, vol. 16(1), pages 1-18, February.
    25. 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. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    2. Martins de Sá, Elisangela & Contreras, Ivan & Cordeau, Jean-François, 2015. "Exact and heuristic algorithms for the design of hub networks with multiple lines," European Journal of Operational Research, Elsevier, vol. 246(1), pages 186-198.
    3. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    4. Becker, Ronald I. & Lari, Isabella & Scozzari, Andrea, 2007. "Algorithms for central-median paths with bounded length on trees," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1208-1220, June.
    5. Federico Perea & Mozart B. C. Menezes & Juan A. Mesa & Fernando Rubio-Del-Rey, 2020. "Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 442-474, July.
    6. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    7. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    8. Ángel Marín & Patricia Jaramillo, 2009. "Urban rapid transit network design: accelerated Benders decomposition," Annals of Operations Research, Springer, vol. 169(1), pages 35-53, July.
    9. Marie Schmidt & Anita Schöbel, 2014. "Location of speed-up subnetworks," Annals of Operations Research, Springer, vol. 223(1), pages 379-401, December.
    10. Pablo A. Miranda-Gonzalez & Javier Maturana-Ross & Carola A. Blazquez & Guillermo Cabrera-Guerrero, 2021. "Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem," Mathematics, MDPI, vol. 9(21), pages 1-33, October.
    11. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    12. Trung Kien Nguyen & Nguyen Thanh Hung & Huong Nguyen-Thu, 2020. "A linear time algorithm for the p-maxian problem on trees with distance constraint," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1030-1043, November.
    13. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    14. Laporte, Gilbert & Mesa, Juan A. & Ortega, Francisco A., 2000. "Optimization methods for the planning of rapid transit systems," European Journal of Operational Research, Elsevier, vol. 122(1), pages 1-10, April.
    15. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    16. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    17. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    18. 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.
    19. Mark Rozanov & Arie Tamir, 2018. "The nestedness property of location problems on the line," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 257-282, July.
    20. Francisco Saldanha-da-Gama, 2018. "Comments on: Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 229-232, July.

    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. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    2. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    3. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    4. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    5. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    6. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    7. Gollowitzer, Stefan & Gouveia, Luis & Ljubić, Ivana, 2013. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities," European Journal of Operational Research, Elsevier, vol. 225(2), pages 211-222.
    8. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    9. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    10. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Liping Liu & Jiaming Li & Lei Zhou & Tijun Fan & Shuxia Li, 2021. "Research on Route Optimization of Hazardous Materials Transportation Considering Risk Equity," Sustainability, MDPI, vol. 13(16), pages 1-19, August.
    12. Masashi Miyagawa, 2014. "Optimal allocation of area in hierarchical road networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(2), pages 617-630, September.
    13. Bahar Y. Kara & Vedat Verter, 2004. "Designing a Road Network for Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 38(2), pages 188-196, May.
    14. Hunkar Toyoglu & Oya Ekin Karasan & Bahar Yetis Kara, 2011. "Distribution network design on the battlefield," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 188-209, April.
    15. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    16. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    17. B. Boffey & Francisco García & Gilbert Laporte & Juan Mesa & Blas Pelegrín, 1995. "Multiobjective routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 3(2), pages 167-220, December.
    18. Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
    19. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2016. "The maxisum and maximin-maxisum HAZMAT routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 316-333.
    20. 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.

    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:95:y:1996:i:3:p:592-603. 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.