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

Solving a continuous local access network design problem with a stabilized central column generation approach

Author

Listed:
  • Trampont, M.
  • Destré, C.
  • Faye, A.

Abstract

In this paper, we focus on a variant of the multi-source Weber problem. In the multi-source Weber problem, the location of a fixed number of concentrators, and the allocation of terminals to them, must be chosen to minimize the total cost of links between terminals and concentrators. In our variant, we have a third hierarchical level, two categories of link costs, and the number of concentrators is unknown. To solve this difficult problem, we propose several heuristics, and use a new stabilized column generation approach, based on a central cutting plane method, to provide lower bounds.

Suggested Citation

  • Trampont, M. & Destré, C. & Faye, A., 2011. "Solving a continuous local access network design problem with a stabilized central column generation approach," European Journal of Operational Research, Elsevier, vol. 214(3), pages 546-558, November.
    • Handle: RePEc:eee:ejores:v:214:y:2011:i:3:p:546-558
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711004462
    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. J Brimberg & N Mladenovic & S Salhi, 2004. "The multi-source Weber problem with constant opening cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 640-646, June.
    2. Zvi Drezner & Avram Mehrez & George O. Wesolowsky, 1991. "The Facility Location Problem with Limited Distances," Transportation Science, INFORMS, vol. 25(3), pages 183-187, August.
    3. François Baccelli & Sergei Zuyev, 1999. "Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks," Operations Research, INFORMS, vol. 47(4), pages 619-631, August.
    Full references (including those not matched with items on IDEAS)

    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. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    2. Zvi Drezner & Vladimir Marianov & George O. Wesolowsky, 2016. "Maximizing the minimum cover probability by emergency facilities," Annals of Operations Research, Springer, vol. 246(1), pages 349-362, November.
    3. Leise Kelli de Oliveira & Isabela Kopperschmidt de Oliveira & João Guilherme da Costa Braga França & Gustavo Wagner Nunes Balieiro & Jean Francisco Cardoso & Tiago Bogo & Diego Bogo & Marco Adriano Li, 2022. "Integrating Freight and Public Transport Terminals Infrastructure by Locating Lockers: Analysing a Feasible Solution for a Medium-Sized Brazilian Cities," Sustainability, MDPI, vol. 14(17), pages 1-16, August.
    4. Zvi Drezner & George O. Wesolowsky & Tammy Drezner, 2004. "The gradual covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 841-855, September.
    5. Chandra Ade Irawan & Said Salhi & Kusmaningrum Soemadi, 2020. "The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods," Journal of Global Optimization, Springer, vol. 78(2), pages 271-294, October.
    6. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    7. Tammy Drezner & Zvi Drezner & Zvi Goldstein, 2010. "A stochastic gradual cover location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(4), pages 367-372, June.
    8. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    9. He, Shawei & Marc Kilgour, D. & Hipel, Keith W., 2017. "A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China," European Journal of Operational Research, Elsevier, vol. 257(3), pages 919-932.
    10. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    11. 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.
    12. 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.
    13. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    14. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    15. 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.

    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:214:y:2011:i:3:p:546-558. 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.