A parsimonious heuristic for the discrete network design problem

Inbal Haas, Shlomo Bekhor

Research output: Contribution to journalArticlepeer-review

Abstract

The problem of selecting the optimal set of transportation projects out of a given set of projects, known as the network design problem (NDP), has been researched for many years. Typical transportation projects are interdependent in their nature, which turns the problem into a very complex one. When a certain objective is sought, an exact solution of the problem can be derived only by enumerating each possible project combination. Therefore, when a large set of possible combinations is involved an alternative approach must be taken. Meta-heuristic methods usually used for this purpose do not make use of the special properties of the given problem. This paper proposes an alternative heuristic that simplifies significantly the solution process. The benefit of a certain combination of projects is inferred based on a subset (pairs or triplets) of projects. The proposed heuristic is tested on simple networks and applied for a real-size network. The paper also discusses the trade-offs between solution accuracy and computation time.

Original languageEnglish
Pages (from-to)43-64
Number of pages22
JournalTransportmetrica A: Transport Science
Volume12
Issue number1
DOIs
StatePublished - 2 Jan 2016

Keywords

  • network design problem
  • project interdependencies
  • project selection
  • traffic assignment

All Science Journal Classification (ASJC) codes

  • General Engineering
  • Transportation

Fingerprint

Dive into the research topics of 'A parsimonious heuristic for the discrete network design problem'. Together they form a unique fingerprint.

Cite this