A parsimonious heuristic for the discrete network design problem

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