Comparing Meta-Heuristic Algorithms for Solving Transportation Network Design Problem, M.Sc. Thesis Sharif University of Technology ; Zokaei Aashtiani, Hedayat (Supervisor)
Abstract
Discrete network design problem is selecting a set of feasible projects among a set of candidate projects, considering a budget constraint in which user's cost is being minimized. Network design problem is one of the complicated problems in transportation science, since it is a bi-level problem in which the lower level is a traffic assignment problem and the upper level is finding the best set of arcs. Meta-heuristic algorithms can be used to solve this problem. Although, there is no guarantee to find the optimal solution by Meta-heuristic algorithms, but they find good solutions in short times. The purpose of this study is comparing the efficiency of three Meta-heuristic algorithms for...
Cataloging briefComparing Meta-Heuristic Algorithms for Solving Transportation Network Design Problem, M.Sc. Thesis Sharif University of Technology ; Zokaei Aashtiani, Hedayat (Supervisor)
Abstract
Discrete network design problem is selecting a set of feasible projects among a set of candidate projects, considering a budget constraint in which user's cost is being minimized. Network design problem is one of the complicated problems in transportation science, since it is a bi-level problem in which the lower level is a traffic assignment problem and the upper level is finding the best set of arcs. Meta-heuristic algorithms can be used to solve this problem. Although, there is no guarantee to find the optimal solution by Meta-heuristic algorithms, but they find good solutions in short times. The purpose of this study is comparing the efficiency of three Meta-heuristic algorithms for...
Find in contentBookmark |
|