<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5286</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2014-10-21</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods</title>
    <abstract language="eng">We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network capacity installation as in a canonical CNDP, also considers a planning horizon made up of multiple time periods and protection against fluctuations in traffic volumes. As a remedy against traffic volume uncertainty, we propose a Robust Optimization model based on Multiband Robustness (Büsing and D'Andreagiovanni, 2012), a refinement of classical Gamma-Robustness by Bertsimas and Sim (2004) that uses a system of multiple deviation bands. Since the resulting optimization problem may prove very challenging even for instances of moderate size solved by a state-of-the-art optimization solver, we propose a hybrid primal heuristic that combines a randomized fixing strategy inspired by ant colony optimization and an exact large neighbourhood search. Computational experiments on a set of realistic instances from the SNDlib (2010) show that our original heuristic can run fast and produce solutions of extremely high quality associated with low optimality gaps.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52862</identifier>
    <identifier type="doi">10.1016/j.asoc.2014.10.016</identifier>
    <enrichment key="PeerReviewed">Yes</enrichment>
    <enrichment key="SourceTitle">A rev. vers. appeared in: Applied Soft Computing, 26 (2015) pp. 497-507</enrichment>
    <author>Fabio D'Andreagiovanni</author>
    <submitter>Fabio D'Andreagiovanni</submitter>
    <author>Jonatan Krolikowski</author>
    <author>Jonad Pulaj</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-40</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Capacitated Network Design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multiperiod Design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multiband Robust Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Traffic Uncertainty</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Metaheuristic</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Ant Colony Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Exact Large Neighborhood Search</value>
    </subject>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="pulaj">Pulaj, Jonad</collection>
    <collection role="projects" number="MultiNO">MultiNO</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5286/ZR-14-40_AppSoftComputing.pdf</file>
  </doc>
</export-example>
