Search results for "Mathematical optimization"
showing 10 items of 1300 documents
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
1996
Acyclic directed graphs are commonly used to model complex systems. The most important criterion to obtain a readable map of an acyclic graph is that of minimizing the number of arc crossings. In this paper, we present a heuristic for solving the problem of minimizing the number of arc crossings in a bipartite graph. It consists of a novel and easier implementation of fundamental tabu search ideas without explicit use of memory structures (a tabu thresholding approach). Computational results are reported on a set of 250 randomly generated test problems. Our algorithm has been compared with the two best heuristics published in the literature and with the optimal solutions for the test proble…
Using Principle of Complementarity when Diagnosing Complex Logistic Activities by Applying Alternative Approach
2012
The paper considers the problem of obtaining new data in process of diagnostics of a recognized transportation company. Such knowledge should not contradict to existing theories and objective means, but should be aimed instead at improving the diagnoses issued. By investigating the methodological problem by virtue of the principle of complementarity, the goals of making fundamental changes are achieved without disturbing the efficiency of the enterprise activities.
Optimality conditions for nondifferentiable convex semi-infinite programming
1983
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.
Qualitative Theory of Differential Equations, Difference Equations, and Dynamic Equations on Time Scales
2016
We are pleased to present this special issue. This volume reflects an increasing interest in the analysis of qualitative behavior of solutions to differential equations, difference equations, and dynamic equations on time scales. Numerous applications arising in the engineering and natural sciences call for the development of new efficient methods and for the modification and refinement of known techniques that should be adjusted for the analysis of new classes of problems. The twofold goal of this special issue is to reflect both the state-of-the-art theoretical research and important recent advances in the solution of applied problems.
Adaptive memory programming for constrained global optimization
2010
The problem of finding a global optimum of a constrained multimodal function has been the subject of intensive study in recent years. Several effective global optimization algorithms for constrained problems have been developed; among them, the multi-start procedures discussed in Ugray et al. [1] are the most effective. We present some new multi-start methods based on the framework of adaptive memory programming (AMP), which involve memory structures that are superimposed on a local optimizer. Computational comparisons involving widely used gradient-based local solvers, such as Conopt and OQNLP, are performed on a testbed of 41 problems that have been used to calibrate the performance of su…
An Aggressive Search Procedure for the Bipartite Drawing Problem
1996
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present an aggressive search scheme for the BDP based on the Intensification, Diversification and Strategic Oscillation elements of Tabu Search. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 30…
Reference Priors in a Variance Components Problem
1992
The ordered group reference prior algorithm of Berger and Bernardo (1989b) is applied to the balanced variance components problem. Besides the intrinsic interest of developing good noninformative priors for the variance components problem, a number of theoretically interesting issues arise in application of the proposed procedure. The algorithm is described (for completeness) in an important special case, with a detailed heuristic motivation.
On the influence of the initial ramp for a correct definition of the parameters of fractional viscoelastic materials
2014
Creep and/or Relaxation tests on viscoelastic materials show a power-law trend. Based upon Boltzmann superposition principle the constitutive law with a power-law kernel is ruled by the Caputo's fractional derivative. Fractional constitutive law posses a long memory and then the parameters obtained by best fitting procedures on experimental data are strongly influenced by the prestress on the specimen. As in fact during the relaxation test the imposed history of deformation is not instantaneously applied, since a unit step function may not be realized by the test machine. Usually an initial ramp is present in the deformation history and the time at which the deformation attains the maximum …
Most Diverse Near-Shortest Paths
2021
Computing the shortest path in a road network is a fundamental problem that has attracted lots of attention. However, in many real-world scenarios, determining solely the shortest path is not enough as users want to have additional, alternative ways of reaching their destination. In this paper, we investigate a novel variant of alternative routing, termed the k-Most Diverse Near-Shortest Paths (kMDNSP). In contrast to previous work, kMDNSP aims at maximizing the diversity of the recommended paths, while bounding their length based on a user-defined constraint. Our theoretical analysis proves the NP-hardness of the problem at hand. To compute an exact solution to kMDNSP, we present an algori…
A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems
2005
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for a gradient-based local NLP solver. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the glob…