Multiobjective integer programming model for the combined region aggregation and *leveling problem
Abstract
The region aggregation and leveling problem is one of selecting, from a region of interest, a continuous subregion that satisfies area, compactness, and configuration constraints, and that is the cheapest to acquire and make level. A multiobjective nonlinear integer programming model is proposed, in which the discrete and multiobjective nature, the region compactness and contiguity issues are addressed explicitly. A heuristic algorithm based on tabu search is developed to solve the problem of practical size. Numerical results are presented to demonstrate the effectiveness and efficiency of the heuristic to generate a set of noninferior solutions from the most compact case to the lest compact case. The performance of the heuristic algorithm is evaluated through extensive numerical experiments, with the impacts of problem size, acquisition area, tabu list, move definition, move selection, iteration number, initial solution as well as some data control parameters are systematically investigated.
Degree
Ph.D.
Advisors
Wright, Purdue University.
Subject Area
Civil engineering|Urban planning|Area planning & development
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.