Comparison of single and multi objective highway alignment optimization algorithms
A. Maji, M.K. Jha
Pages: 5-16
Abstract:
The available Highway Alignment Optimization (HAO) algorithms use either single-objective or multiobjective approaches. These algorithms consider different highway alignment costs along with restricted land use information such as forests, wetland, etc. as the primary objectives which are minimized in the process of highway alignment optimization. In single-objective HAO approaches, different highway alignment sensitive costs are formulated and added to obtain the total highway alignment cost in monetary value. The total highway alignment cost is used as the primary objective function in the single-objective HAO. This method, upon optimal search, yields a highway alignment with minimum total highway alignment cost. As part of the total highway alignment cost, the restricted land use is expected to be minimized in the optimization process. Whereas in the multi-objective optimization approach the highway alignment cost and restricted land use information are maintained separate and optimized simultaneously. This way, the multi-objective HAO helps to yield a set of Pareto-optimal solution with trade-off between highway alignment cost and the restricted land use information. The restricted land use information used in both optimization processes is derived from a geographical information system (GIS) database. It is cumbersome to express the highway alignment and associated objectives in mathematical formulations as required in classical optimization techniques. Hence, both methods use unconventional genetic algorithm (GA) based optimization approach. This paper compares single-objective HAO with multi-objective HAO and discusses their merits and demerits in a real-world example application.
Keywords: multi-objective optimization; single-objective optimization; highway alignment optimization; genetic algorithms; restricted land use; geographical information system (GIS) database
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES