Network Design with Node Degree Balance Constraints

Michael Berliner Pedersen; Teodor Gabriel Crainic

Network Design with Node Degree Balance Constraints

Michael Berliner Pedersen, Teodor Gabriel Crainic

Research output: Contribution to conference › Conference abstract for conference › Research

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 language	English
Publication date	2005
Publication status	Published - 2005
Event	Optimization Days 2005 - Montréal, Canada Duration: 9 May 2005 → 11 May 2005 http://www.gerad.ca/jopt2005/en/

Conference

Conference	Optimization Days 2005
Country	Canada
City	Montréal
Period	09/05/2005 → 11/05/2005
Internet address	http://www.gerad.ca/jopt2005/en/

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

Cite this

@conference{5b47d993659f4558ac2cfd40ef2f6be9,

title = "Network Design with Node Degree Balance Constraints",

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.",

author = "Pedersen, {Michael Berliner} and Crainic, {Teodor Gabriel}",

year = "2005",

language = "English",

note = "Optimization Days 2005 ; Conference date: 09-05-2005 Through 11-05-2005",

url = "http://www.gerad.ca/jopt2005/en/",

}

TY - ABST

T1 - Network Design with Node Degree Balance Constraints

AU - Pedersen, Michael Berliner

AU - Crainic, Teodor Gabriel

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Conference abstract for conference

T2 - Optimization Days 2005

Y2 - 9 May 2005 through 11 May 2005

ER -