Network Design with Node Degree Balance Constraints

Michael Berliner Pedersen, Teodor Gabriel Crainic

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    Abstract

    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.
    Original languageEnglish
    Publication date2005
    Publication statusPublished - 2005
    EventOptimization Days 2005 - Montréal, Canada
    Duration: 9 May 200511 May 2005
    http://www.gerad.ca/jopt2005/en/

    Conference

    ConferenceOptimization Days 2005
    CountryCanada
    CityMontréal
    Period09/05/200511/05/2005
    Internet address

    Fingerprint Dive into the research topics of 'Network Design with Node Degree Balance Constraints'. Together they form a unique fingerprint.

    Cite this