57,369 research outputs found
Optimization as an analysis tool for human complex decision making
We present a problem class of mixed-integer nonlinear programs (MINLPs) with nonconvex continuous relaxations which stem from economic test scenarios that are used in the analysis of human complex problem solving. In a round-based scenario participants hold an executive function. A posteriori a performance indicator is calculated and correlated to personal measures such as intelligence, working memory, or emotion regulation. Altogether, we investigate 2088 optimization problems that differ in size and initial conditions, based on real-world experimental data from 12 rounds of 174 participants. The goals are twofold. First, from the optimal solutions we gain additional insight into a complex system, which facilitates the analysis of a participant’s performance in the test. Second, we propose a methodology to automatize this process by providing a new criterion based on the solution of a series of optimization problems. By providing a mathematical optimization model and this methodology, we disprove the assumption that the “fruit fly of complex problem solving,” the Tailorshop scenario that has been used for dozens of published studies, is not mathematically accessible—although it turns out to be extremely challenging even for advanced state-of-the-art global optimization algorithms and we were not able to solve all instances to global optimality in reasonable time in this study. The publicly available computational tool Tobago [TOBAGO web site https://sourceforge.net/projects/tobago] can be used to automatically generate problem instances of various complexity, contains interfaces to AMPL and GAMS, and is hence ideally suited as a testbed for different kinds of algorithms and solvers. Computational practice is reported with respect to the influence of integer variables, problem dimension, and local versus global optimization with different optimization codes
Recommended from our members
Runway Operations Management: Models, Enhancements, and Decomposition Techniques
Air traffic loads have been on the rise over the last several decades and are expected to double, and possibly triple in some regions, over the coming decade. With the advent of larger aircraft and ever-increasing air traffic loads, aviation authorities are continually pressured to examine capacity expansions and to adopt better strategies for capacity utilization. However, this growth in air traffic volumes has not been accompanied by adequate capacity expansions in the air transport infrastructure. It is, therefore, predicted that flight delays costing multi-billion dollars will continue to negatively impact airline companies and consumers. In airport operations management, runways constitute a scarce resource and a key bottleneck that impacts system-wide capacity (Idris et al. 1999). Throughout the three essays that form this dissertation, enhanced optimization models and effective decomposition techniques are proposed for runway operations management, while taking into consideration safety and practical constraints that govern access to runways.
Essay One proposes a three-faceted approach for runway capacity management, based on the runway configuration, a chosen aircraft assignment/sequencing policy, and an aircraft separation standard as typically enforced by aviation authorities. With the objective of minimizing a fuel burn cost function, we propose optimization-based heuristics that are grounded in a classical mixed-integer programming formulation. By slightly altering the FCFS sequence, the proposed optimization-based heuristics not only preserve fairness among aircraft, but also consistently produce excellent (optimal or near optimal) solutions. Using real data and alternative runway settings, our computational study examines the transition from the (Old) Doha International Airport to the New Doha International Airport in light of our proposed optimization methodology.
Essay Two examines aircraft sequencing problems over multiple runways under mixed mode operations. To curtail the computational effort associated with classical mixed-integer formulations for aircraft sequencing problems, valid inequalities, pre-processing routines and symmetry-defeating hierarchical constraints are proposed. These enhancements yield computational savings over a base mixed-integer formulation when solved via branch-and-bound/cut techniques that are embedded in commercial optimization solvers such as CPLEX. To further enhance its computational tractability, the problem is alternatively reformulated as a set partitioning model (with a convexity constraint) that prompts the development of a specialized column generation approach. The latter is accelerated by incorporating several algorithmic features, including an interior point dual stabilization scheme (Rousseau et al. 2007), a complementary column generation routine (Ghoniem and Sherali, 2009), and a dynamic lower bounding feature. Empirical results using a set of computationally challenging simulated instances demonstrate the effectiveness and the relative merits of the strengthened mixed-integer formulation and the accelerated column generation approach.
Essay Three presents an effective dynamic programming algorithm for solving Elementary Shortest Path Problems with Resource Constraints (ESPPRC). This is particularly beneficial, because the ESPPRC structure arises in the column generation pricing sub-problem which, in turn, causes computational challenges as noted in Essay Two. Extending the work by Feillet et al. (2004), the proposed algorithm dynamically constructs optimal aircraft schedules based on the shortest path between operations while enforcing time-window restrictions and consecutive as well as nonconsecutive minimum separation times between aircraft. Using the aircraft separation standard by the Federal Aviation Administration (FAA), our computational study reports very promising results, whereby the proposed dynamic programming approach greatly outperforms the solution of the sub-problem as a mixed-integer programming formulation using commercial solvers such as CPLEX and paves the way for developing effective branch-and-price algorithms for multiple-runway aircraft sequencing problems
A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming
In this paper we deal with a network of agents seeking to solve in a
distributed way Mixed-Integer Linear Programs (MILPs) with a coupling
constraint (modeling a limited shared resource) and local constraints. MILPs
are NP-hard problems and several challenges arise in a distributed framework,
so that looking for suboptimal solutions is of interest. To achieve this goal,
the presence of a linear coupling calls for tailored decomposition approaches.
We propose a fully distributed algorithm based on a primal decomposition
approach and a suitable tightening of the coupling constraints. Agents
repeatedly update local allocation vectors, which converge to an optimal
resource allocation of an approximate version of the original problem. Based on
such allocation vectors, agents are able to (locally) compute a mixed-integer
solution, which is guaranteed to be feasible after a sufficiently large time.
Asymptotic and finite-time suboptimality bounds are established for the
computed solution. Numerical simulations highlight the efficacy of the proposed
methodology.Comment: 57th IEEE Conference on Decision and Contro
- …