A comparative study on using meta-heuristic algorithms for road maintenance planning: Insights from field study in a developing country
Ali Gerami Matin, Reza Vatani Nezafat, Amir Golroo
Journal of Traffic and Transportation Engineering (English ed. Online) · 2017
doi:10.1016/j.jtte.2017.06.004 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Optimized road maintenance planning seeks for solutions that can minimize the life-cycle cost of a road network and concurrently maximize pavement condition. Aiming at proposing an optimal set of road maintenance solutions, robust meta-heuristic algorithms are used in research. Two main optimization techniques are applied including single-objective and multi-objective optimization. Genetic algorithms (GA), particle swarm optimization (PSO), and combination of genetic algorithm and particle swarm optimization (GAPSO) as single-objective techniques are used, while the non-domination sorting genetic algorithm II (NSGAII) and multi-objective particle swarm optimization (MOPSO) which are sufficient for solving computationally complex large-size optimization problems as multi-objective techniques are applied and compared. A real case study from the rural transportation network of Iran is employed to illustrate the sufficiency of the optimum algorithm. The formulation of the optimization model is carried out in such a way that a cost-effective maintenance strategy is reached by preserving the performance level of the road network at a desirable level. So, the objective functions are pavement performance maximization and maintenance cost minimization. It is concluded that multi-objective algorithms including non-domination sorting genetic algorithm II (NSGAII) and multi-objective particle swarm optimization performed better than the single objective algorithms due to the capability to balance between both objectives. And between multi-objective algorithms the NSGAII provides the optimum solution for the road maintenance planning.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.