Learn More
Constraint handling is one of the major concerns when applying genetic algorithms (GAs) to solve constrained optimization problems. This paper proposes to use the gradient information derived from the constraint set to systematically repair infeasible solutions. The proposed repair procedure is embedded into a simple GA as a special operator. Experiments(More)
—Ongoing, rapid advances in three-dimensional (3D) printing technology are making it inexpensive for lay people to manufacture 3D objects. However, the lack of tools to help non-technical users design interesting, complex objects represents a significant barrier preventing the public from benefiting from 3D printers. Previous work has shown that an(More)
To the memory of John Reeves Hall—the best of friends, yet an even brighter mind. Acknowledgements It is often the case—and certainly so in mine—that a Ph.D. is the work of many hands. The seed of the scientist sprouts from the soil of three loves: love of truth, love of nature and love of humanity. My parents, in both word and action, embodied these three(More)
Improved diagnosis and treatment of traumatic brain injury (TBI) and posttraumatic stress disorder (PTSD) are needed for our military and veterans, their families, and society at large. Advances in brain imaging offer important biomarkers of structural, functional, and metabolic information concerning the brain. This article reviews the application of(More)
Recent research has demonstrated and established the viability of applying path-based algorithms to the traffic equilibrium problem in reasonably large networks. Much of the attention has been focused on two particular algorithms: the disaggregate simplicial decomposition (DSD) algorithm and the gradient projection (GP) algorithm. The purpose of this paper(More)
Keywords: User equilibrium Traffic assignment Network design Bi-level program Stochastic program Multi-objective Genetic algorithm a b s t r a c t Transportation network design problem (NDP) is inherently multi-objective in nature, because it involves a number of stakeholders with different needs. In addition, the decision-making process sometimes has to be(More)
Keywords: Network design Multi-objective Goal programming Expected value model Chance-constrained model Dependent-chance model a b s t r a c t The transportation network design problem (NDP) with multiple objectives and demand uncertainty was originally formulated as a spectrum of stochastic multi-objective programming models in a bi-level programming(More)
Keywords: Traffic equilibrium problem Nonadditive route cost Gradient projection algorithm Self-adaptive scheme a b s t r a c t Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic(More)