A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow

• Published in: arXiv.org
• Main Authors: González, Pedro Henrique, Simonetti, Luidi, Michelon, Philippe, Martinhon, Carlos, Santos, Edcarllos
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 13.04.2015
• Subjects: Algorithms; Commodities; Computation; Computer Science - Data Structures and Algorithms; Economic models; Fixing; Network design; Perturbation; Shortest-path problems; Solution space

This paper presents an iterated local search for the fixed-charge uncapacitated network design problem with user-optimal flow (FCNDP-UOF), which concerns routing multiple commodities from its origin to its destination by signing a network through selecting arcs, with an objective of minimizing the s...