This presentation discusses an extension to the network design model where there in addition to the flow conservation constraints also are constraints that require design conservation. This means that the number of arcs entering and leaving a node must be the same. As will be shown the model has applications within the design of transportation networks. The model is solved using a Tabu Search heuristic using a hybrid of the add/drop procedure and cycle-based neighbourhoods.
|Published - 2005
|Optimization Days 2005 - Montréal, Canada
Duration: 9 May 2005 → 11 May 2005
|Optimization Days 2005
|09/05/2005 → 11/05/2005