Search

This paper demonstrates the application of particle swarm optimization (PSO) to the programming of pavement maintenance activities at the network level. Furthermore, the application of the PSO technique and its relevance to solving the programming problem in a pavement management system (PMS) is discussed. The robustness and quick search capability of PSO enables it to effectively handle the highly constrained problem of pavement management activities programming, which has an extremely large solution space of astronomical scale. Examples are presented to highlight the versatility of PSO in accommodating different forms of objective functions and comparing the results with the genetic algorithm (GA). This paper compares PSO and GA with respect to rate of convergence and accuracy of modeling PMS using an example problem. The results of this paper confirmed the potential of PSO to successfully model the PMS. [ABSTRACT FROM AUTHOR]

This paper presents an enhanced design methodology for optimal mixture proportion of concrete composition with respect to accuracy in the case of using prediction models based on a limited database. In proposed methodology, the search space is constrained as the domain defined by a limited database instead of constructing the database covering the region represented by the possible ranges of all variables in the input space. A model for defining the search space which is expressed by the effective region in this paper and evaluating whether a mix proportion is effective is added to the optimization process, yielding highly reliable results. To demonstrate the proposed methodology, a genetic algorithm, an artificial neural network, and a convex hull were adopted as an optimum technique, a prediction model for material properties, and an evaluation model for the effective region, respectively. And then, it was applied to an optimization problem wherein the minimum cost should be obtained under a given strength requirement. Experimental test results show that the mix proportion obtained from the proposed methodology considering the regional characteristics of the database is found to be more accurate and feasible than that obtained from a general optimum technique that does not consider this aspect. [ABSTRACT FROM AUTHOR]

A cost effective channel section for a specified flow rate, roughness coefficients, longitudinal slope, and various cost parameters can be determined using an optimization technique. However, the derived optimal channel section may not be feasible for construction because of in situ conditions. The local soil conditions may not support the optimal side slope of the channel and if constructed, the slope may fail. It is therefore necessary to also incorporate the criteria for side slope stability in designing an optimal open channel section. In this paper, a new methodology has been developed to design a stable and optimal channel section using hybrid optimization techniques. A genetic algorithm based optimization model is developed initially to determine the factor of safety of a channel slope for given soil parameters. This optimization model is then externally linked with a separate sequential quadratic programming based optimization model to evaluate the parameters of the stable and optimal channel section. Solution for various example problems incorporating different soil parameters are illustrated to demonstrate the applicability of the developed methodology. [ABSTRACT FROM AUTHOR]

This paper presents a mathematical stochastic methodology for transit route network optimization. The goal is to provide an effective computational tool for the optimization of a large-scale transit route network to minimize transfers with reasonable route directness while maximizing service coverage. The methodology includes representation of transit route network solution search spaces, representation of transit route and network constraints, and a stochastic search scheme based on an integrated simulated annealing and genetic algorithm solution search method. The methodology has been implemented as a computer program, tested using previously published results, and applied to a large-scale realistic network optimization problem. [ABSTRACT FROM AUTHOR]

Many departments of transportation have recently started to utilize innovative contracting methods that provide new incentives for improving construction quality. These emerging contracts place an increasing pressure on decision makers in the construction industry to search for an optimal resource utilization plan that minimizes construction cost and time while maximizing its quality. This paper presents a multiobjective optimization model that supports decision makers in performing this challenging task. The model is designed to transform the traditional two-dimensional time-cost tradeoff analysis to an advanced three-dimensional time-cost-quality trade-off analysis. The model is developed as a multiobjective genetic algorithm to provide the capability of quantifying and considering quality in construction optimization. An application example is analyzed to illustrate the use of the model and demonstrate its capabilities in generating and visualizing optimal tradeoffs among construction time, cost, and quality. [ABSTRACT FROM AUTHOR]

This paper presents an augmented Lagrangian genetic algorithm model for resource scheduling. The algorithm considers scheduling characteristics that were ignored in prior research. Previous resource scheduling formulations have primarily focused on project duration minimization. Furthermore, resource leveling and resource-constrained scheduling have traditionally been solved independently. The model presented here considers all precedence relationships, multiple crew strategies, total project cost minimization, and time-cost trade-off. In the new formulation, resource leveling and resource-constrained scheduling are performed simultaneously. The model presented uses the quadratic penalty function to transform the resource-scheduling problem to an unconstrained one. The algorithm is general and can be applied to a broad class of optimization problems. An illustrative example is presented to demonstrate the performance of the proposed method. [ABSTRACT FROM AUTHOR]