Essec\Faculty\Model\Contribution {#2216
  #_index: "academ_contributions"
  #_id: "10528"
  #_source: array:26 [
    "id" => "10528"
    "slug" => "a-mip-based-heuristic-approach-to-solve-a-prize-collecting-local-access-network-design-problem"
    "yearMonth" => "2014-06"
    "year" => "2014"
    "title" => "A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem"
    "description" => "LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2014). A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem. <i>European Journal of Operational Research</i>, 235(3), pp. 727-739."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      1 => array:1 [
        "name" => "PUTZ Peter"
      ]
      2 => array:1 [
        "name" => "SALAZAR-GONZALEZ Juan-José"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:4 [
      0 => "Network loading"
      1 => "Local access"
      2 => "Prize-collecting"
      3 => "Matheuristic algorithm"
    ]
    "updatedAt" => "2021-07-13 14:31:37"
    "publicationUrl" => "https://doi.org/10.1016/j.ejor.2013.11.003"
    "publicationInfo" => array:3 [
      "pages" => "727-739"
      "volume" => "235"
      "number" => "3"
    ]
    "type" => array:2 [
      "fr" => "Articles"
      "en" => "Journal articles"
    ]
    "support_type" => array:2 [
      "fr" => "Revue scientifique"
      "en" => "Scientific journal"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => """
        This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of end-customers. In this capacitated network design problem the installation of optical fiber cables with sufficient capacity is required to carry the traffic from the central office to the end-customers at minimum cost. In the situation motivating this research the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the Prize-Collecting Local Access Network Design problem (PC-LAN).\n
        \n
        We propose a branch-and-cut approach for solving small instances. For large instances of practical importance, our approach turns into a mixed integer programming (MIP) based heuristic procedure which combines the cutting-plane algorithm with a multi-start heuristic algorithm. The multi-start heuristic algorithm starts with fractional values of the LP-solutions and creates feasible solutions that are later improved using a local improvement strategy.\n
        \n
        Computational experiments are conducted on small instances from the literature. In addition, we introduce a new benchmark set of real-world instances with up to 86,000 nodes, 116,000 edges and 1500 potential customers. Using our MIP-based approach we are able to solve most of the small instances to proven optimality. For more difficult instances, we are not only able to provide high-quality feasible solutions, but also to provide certificate on their quality by calculating lower bounds to the optimal solution values.
        """
      "en" => """
        This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of end-customers. In this capacitated network design problem the installation of optical fiber cables with sufficient capacity is required to carry the traffic from the central office to the end-customers at minimum cost. In the situation motivating this research the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the Prize-Collecting Local Access Network Design problem (PC-LAN).\n
        \n
        We propose a branch-and-cut approach for solving small instances. For large instances of practical importance, our approach turns into a mixed integer programming (MIP) based heuristic procedure which combines the cutting-plane algorithm with a multi-start heuristic algorithm. The multi-start heuristic algorithm starts with fractional values of the LP-solutions and creates feasible solutions that are later improved using a local improvement strategy.\n
        \n
        Computational experiments are conducted on small instances from the literature. In addition, we introduce a new benchmark set of real-world instances with up to 86,000 nodes, 116,000 edges and 1500 potential customers. Using our MIP-based approach we are able to solve most of the small instances to proven optimality. For more difficult instances, we are not only able to provide high-quality feasible solutions, but also to provide certificate on their quality by calculating lower bounds to the optimal solution values.
        """
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-12-21T17:21:43.000Z"
    "docTitle" => "A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, PUTZ Peter, SALAZAR-GONZALEZ Juan-José"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, PUTZ Peter, SALAZAR-GONZALEZ Juan-José</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2014</span>"
    "keywordList" => "<a href="#">Network loading</a>, <a href="#">Local access</a>, <a href="#">Prize-collecting</a>, <a href="#">Matheuristic algorithm</a>"
    "docPreview" => "<b>A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem</b><br><span>2014-06 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.ejor.2013.11.003" target="_blank">A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.695239
  +"parent": null
}