A time‐staged multi‐objective network‐design model |
| |
Authors: | Ali El‐Aroud Yupo Chan |
| |
Institution: | 1. Elfateh University , Libya;2. Air Force Institute of Technology , USA;3. Professor and Deputy Head, Department of Operational Sciences , School of Engineering, Air Force Institute of Technology , Wright‐Patterson, OH, 45433–6583 |
| |
Abstract: | A multi‐objective, time‐staged network‐design problem is formulated. Through transformation, the problem is decomposed into a set of single‐period, single‐objective problems. Lexicographic ordering is instrumental in effecting this transformation; it also allows a backward‐recursion algorithm to be applied using strong pruning criteria. Furthermore, monotonicity properties enable us to solve the problem using the familiar tree‐search algorithms. The solution method has several desirable properties — as shown by an example and a case study of Tripoli Province, Libya. First, the algorithm ensures continuity of project implementation over the multi time‐periods and provides optimality in later computational stages irrespective of the decision at an interim stage. Second, the algorithm tends to provide accessibility to unconnected regions in the study area at low user‐cost without employing weights to the two objective functions of accessibility and user‐cost efficiency. Such a property is deemed advantageous for suggesting transportation investments based purely on purchasing the greatest benefit for each dollar, with political neutrality strictly maintained. |
| |
Keywords: | Tree searching network design time‐staged design accessibility user‐cost efficiency |
|
|