IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2019i1p97-d301360.html
   My bibliography  Save this article

Capacitated Multicommodity Flow Problem for Heterogeneous Smart Electricity Metering Communications Using Column Generation

Author

Listed:
  • Esteban Inga

    (Smart Grid Research Group, Universidad Politécnica Salesiana, Quito 170525, Ecuador)

  • Roberto Hincapié

    (School of Telecommunications Engineering, Universidad Pontificia Bolivariana, Medellín 050031, Colombia)

  • Sandra Céspedes

    (Department of Electrical Engineering, Universidad de Chile, Av. Tupper 2007, Santiago 8370451, Chile
    Faculty of Engineering, Universidad ICESI, Calle 18, 122-135 Pance, Cali, Colombia
    Current address: Postgraduate Department, Girón Campus, Av. 12 de Octubre N 23-52, Quito 170525, Ecuador.)

Abstract

This paper addresses the planning and deployment of wireless heterogeneous networks (WHNs) for smart metering, based on a cross-layer solution. We combine the constraints of the network layer that considers routing and flow demands at each link in the WHN, while at the same time, we account for the restrictions of the physical layer referred to the capacity of a short range technology when used in a multi-hop fashion. We propose a model based on a column generation approach to solve the capacitated multicommodity flow problem (CMCF); the model includes wireless links capacities, coverage, and cost. The work integrates the multi-hop routing of packets in a mesh network formed by smart meters and concentrators connected to a cellular network via base stations. The traffic of each link is represented in a multigraph with the occupation percentage, and we build a scalable routing tree on a georeferenced map to represent a real deployment. The results describe the behavior of the proposed model in terms of the traffic load per concentrator, the network coverage, and the reduction of energy consumption. We demonstrate that an infrastructure cost reduction is achieved with the inclusion of multi-hop short range technology, which reduces the number of smart meters that require a direct connection to cellular technology. The model guarantees 100% coverage of the smart meters analyzed in each scenario. The calculation time of the CMCF for advanced metering infrastructure (CMCF-AMI) based on the column generation algorithm as the population increases is reduced by 10%, and this is the expected return when the population is considerable.

Suggested Citation

  • Esteban Inga & Roberto Hincapié & Sandra Céspedes, 2019. "Capacitated Multicommodity Flow Problem for Heterogeneous Smart Electricity Metering Communications Using Column Generation," Energies, MDPI, vol. 13(1), pages 1-21, December.
    • Handle: RePEc:gam:jeners:v:13:y:2019:i:1:p:97-:d:301360
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/1/97/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/13/1/97/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    2. Akbalik, A. & Pochet, Y., 2009. "Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs," European Journal of Operational Research, Elsevier, vol. 198(2), pages 412-434, October.
    3. Letchford, Adam N. & Salazar-González, Juan-José, 2015. "Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 730-738.
    4. Ilfat Ghamlouche & Teodor Crainic & Michel Gendreau, 2004. "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design," Annals of Operations Research, Springer, vol. 131(1), pages 109-133, October.
    5. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    6. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    7. Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
    8. Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    9. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, 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. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    2. Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
    3. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
    4. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    5. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    6. Dayarian, Iman & Rocco, Adolfo & Erera, Alan & Savelsbergh, Martin, 2022. "Operations design for high-velocity intra-city package service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 150-168.
    7. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    8. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    9. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    10. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    11. Mike Hewitt & George Nemhauser & Martin W. P. Savelsbergh, 2013. "Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 302-316, May.
    12. Tobias Harks & Felix G. König & Jannik Matuschke & Alexander T. Richter & Jens Schulz, 2016. "An Integrated Approach to Tactical Transportation Planning in Logistics Networks," Transportation Science, INFORMS, vol. 50(2), pages 439-460, May.
    13. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    14. Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić, 2013. "A cutting plane algorithm for the Capacitated Connected Facility Location Problem," Computational Optimization and Applications, Springer, vol. 55(3), pages 647-674, July.
    15. Bai, Ruibin & Wallace, Stein W. & Li, Jingpeng & Chong, Alain Yee-Loong, 2014. "Stochastic service network design with rerouting," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 50-65.
    16. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    17. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    18. Gendron, Bernard & Hanafi, Saïd & Todosijević, Raca, 2018. "Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design," European Journal of Operational Research, Elsevier, vol. 268(1), pages 70-81.
    19. Teodor Gabriel Crainic & Nicoletta Ricciardi & Giovanni Storchi, 2009. "Models for Evaluating and Planning City Logistics Systems," Transportation Science, INFORMS, vol. 43(4), pages 432-454, November.
    20. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.

    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:gam:jeners:v:13:y:2019:i:1:p:97-:d:301360. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.