for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> ENGINEERING (Total: 2167 journals)     - CHEMICAL ENGINEERING (185 journals)    - CIVIL ENGINEERING (168 journals)    - ELECTRICAL ENGINEERING (91 journals)    - ENGINEERING (1176 journals)    - ENGINEERING MECHANICS AND MATERIALS (356 journals)    - HYDRAULIC ENGINEERING (56 journals)    - INDUSTRIAL ENGINEERING (54 journals)    - MECHANICAL ENGINEERING (81 journals) ENGINEERING (1176 journals)            First | 2 3 4 5 6 7 8 9 | Last
 International Journal of Grid and Utility Computing International Journal of Heat and Fluid Flow       (Followers: 15) International Journal of Heat and Mass Transfer       (Followers: 128) International Journal of Heavy Vehicle Systems       (Followers: 6) International Journal of Hypersonics       (Followers: 3) International Journal of Imaging Systems and Technology       (Followers: 2) International Journal of Impact Engineering       (Followers: 7) International Journal of Information Acquisition       (Followers: 1) International Journal of Innovation and Applied Studies       (Followers: 2) International Journal of Innovation Science       (Followers: 6) International Journal of Innovative Technology and Research International Journal of Integrated Engineering       (Followers: 1) International Journal of Intelligent Engineering Informatics International Journal of Intelligent Systems and Applications in Engineering International Journal of Lifecycle Performance Engineering       (Followers: 1) International Journal of Machine Tools and Manufacture       (Followers: 5) International Journal of Manufacturing Research       (Followers: 5) International Journal of Manufacturing Technology and Management       (Followers: 7) International Journal of Materials and Product Technology       (Followers: 4) International Journal of Mathematical Education in Science and Technology       (Followers: 7) International Journal of Mathematics in Operational Research       (Followers: 1) International Journal of Medical Engineering and Informatics       (Followers: 5) International Journal of Micro Air Vehicles       (Followers: 4) International Journal of Microwave and Wireless Technologies       (Followers: 1) International Journal of Microwave Science and Technology       (Followers: 2) International Journal of Mobile Network Design and Innovation       (Followers: 3) International Journal of Multiphase Flow       (Followers: 2) International Journal of Nanomanufacturing       (Followers: 1) International Journal of Nanoscience       (Followers: 1) International Journal of Nanotechnology       (Followers: 5) International Journal of Nanotechnology and Molecular Computation       (Followers: 3) International Journal of Navigation and Observation       (Followers: 8) International Journal of Network Management International Journal of Nonlinear Sciences and Numerical Simulation International Journal of Numerical Methods for Heat & Fluid Flow       (Followers: 7) International Journal of Optics       (Followers: 1) International Journal of Organisational Design and Engineering       (Followers: 10) International Journal of Pattern Recognition and Artificial Intelligence       (Followers: 6) International Journal of Pavement Engineering       (Followers: 3) International Journal of Physical Modelling in Geotechnics       (Followers: 3) International Journal of Plasticity       (Followers: 6) International Journal of Plastics Technology International Journal of Polymer Analysis and Characterization       (Followers: 5) International Journal of Polymer Science       (Followers: 16) International Journal of Precision Engineering and Manufacturing       (Followers: 5) International Journal of Precision Engineering and Manufacturing-Green Technology International Journal of Precision Technology International Journal of Pressure Vessels and Piping       (Followers: 3) International Journal of Production Economics       (Followers: 13) International Journal of Quality and Innovation       (Followers: 4) International Journal of Quality Assurance in Engineering and Technology Education       (Followers: 2) International Journal of Quality Engineering and Technology       (Followers: 2) International Journal of Quantum Information International Journal of Rapid Manufacturing       (Followers: 2) International Journal of Reliability, Quality and Safety Engineering       (Followers: 7) International Journal of Renewable Energy Technology       (Followers: 8) International Journal of Robust and Nonlinear Control       (Followers: 3) International Journal of Science Engineering and Advance Technology International Journal of Sediment Research       (Followers: 1) International Journal of Self-Propagating High-Temperature Synthesis       (Followers: 2) International Journal of Signal and Imaging Systems Engineering International Journal of Six Sigma and Competitive Advantage International Journal of Social Robotics       (Followers: 2) International Journal of Software Engineering and Knowledge Engineering       (Followers: 2) International Journal of Space Science and Engineering       (Followers: 2) International Journal of Speech Technology       (Followers: 4) International Journal of Spray and Combustion Dynamics       (Followers: 6) International Journal of Superconductivity International Journal of Surface Engineering and Interdisciplinary Materials Science       (Followers: 1) International Journal of Surface Science and Engineering       (Followers: 8) International Journal of Sustainable Engineering       (Followers: 7) International Journal of Sustainable Manufacturing       (Followers: 4) International Journal of Systems and Service-Oriented Engineering International Journal of Systems Assurance Engineering and Management International Journal of Systems, Control and Communications       (Followers: 2) International Journal of Technoethics       (Followers: 1) International Journal of Technology Management and Sustainable Development       (Followers: 1) International Journal of Technology Policy and Law       (Followers: 5) International Journal of Telemedicine and Applications       (Followers: 2) International Journal of Thermal Sciences       (Followers: 7) International Journal of Thermodynamics       (Followers: 2) International Journal of Turbo & Jet-Engines International Journal of Ultra Wideband Communications and Systems International Journal of Vehicle Autonomous Systems       (Followers: 1) International Journal of Vehicle Design       (Followers: 6) International Journal of Vehicle Information and Communication Systems       (Followers: 2) International Journal of Vehicle Noise and Vibration       (Followers: 3) International Journal of Vehicle Safety       (Followers: 5) International Journal of Vehicular Technology       (Followers: 2) International Journal of Virtual Technology and Multimedia       (Followers: 4) International Journal of Wavelets, Multiresolution and Information Processing International Journal on Artificial Intelligence Tools       (Followers: 4) International Nano Letters       (Followers: 9) International Review of Applied Sciences and Engineering International Scholarly Research Notices       (Followers: 221) Inverse Problems in Science and Engineering       (Followers: 2) Ionics IPTEK The Journal for Technology and Science IRBM News Ironmaking & Steelmaking       (Followers: 2)
 Journal of Global Optimization   [SJR: 0.919]   [H-I: 51]   [4 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001    Published by Springer-Verlag  [2302 journals]
• Fast algorithms for the minimum volume estimator
• Abstract: Abstract The minimum volume ellipsoid (MVE) estimator is an important tool in robust regression and outlier detection in statistics. We develop fast and efficient algorithms for the MVE estimator problem and discuss how they can be implemented efficiently. The novelty of our approach stems from the recent developments in the first-order algorithms for solving the related minimum volume enclosing ellipsoid problem. Comparative computational results are provided which demonstrate the strength of the algorithms.
PubDate: 2015-06-01

• Some observations on exclusion regions in branch and bound algorithms
• Abstract: Abstract In branch and bound algorithms for constrained global optimization, an acceleration technique is to construct regions $${\varvec{x}}^{*}$$ around local optimizing points $$\check{x}$$ , then delete these regions from further search. The result of the algorithm is then a list of those small regions in which all globally optimizing points must lie. If the constructed regions are too small, the algorithm will not be able to easily reject adjacent regions in the search, while, if the constructed regions are too large, the set of optimizing points is not known accurately. We briefly review previous methods of constructing boxes about approximate optimizing points. We then derive a formula for determining the size of a constructed solution-containing region, depending on a small radius $$\epsilon$$ , and of constructing a containing box $${\varvec{X}}^{*}\supset {\varvec{x}}^{*}$$ such that all points in $${\varvec{X}}^{*}\setminus {\varvec{x}}^{*}$$ are proven to be infeasible, without the need to actually process them in the branch and bound algorithm. The construction differs in its motivation and concept from previous methods of constructing such boxes $${\varvec{X}}^{*}$$ . It may be possible to use this technique to reduce the large amount of processing branch and bound algorithms typically require to fathom regions adjacent to optimizing points, and to obtain more accurate bounds on solution sets.
PubDate: 2015-06-01

• Finding sparse solutions of systems of polynomial equations via
group-sparsity optimization
• Abstract: Abstract The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse solutions. The first one is based on a convex relaxation resulting in a second-order cone programming formulation which can benefit from efficient reweighting techniques for sparsity enhancement. For this approach, sufficient conditions for the exact recovery of the sparsest solution to the polynomial system are derived in the noiseless setting, while stable recovery results are obtained for the noisy case. Though lacking a similar analysis, the second approach provides a more computationally efficient algorithm based on a greedy strategy adding the groups one-by-one. With respect to previous work, the proposed methods recover the sparsest solution in a very short computing time while remaining at least as accurate in terms of the probability of success. This probability is empirically analyzed to emphasize the relationship between the ability of the methods to solve the polynomial system and the sparsity of the solution.
PubDate: 2015-06-01

• PAINT–SiCon : constructing consistent parametric representations of
Pareto sets in nonconvex multiobjective optimization
• Abstract: Abstract We introduce a novel approximation method for multiobjective optimization problems called PAINT–SiCon. The method can construct consistent parametric representations of Pareto sets, especially for nonconvex problems, by interpolating between nondominated solutions of a given sampling both in the decision and objective space. The proposed method is especially advantageous in computationally expensive cases, since the parametric representation of the Pareto set can be used as an inexpensive surrogate for the original problem during the decision making process.
PubDate: 2015-06-01

• An algorithm for global solution to bi-parametric linear complementarity
constrained linear programs
• Abstract: Abstract A linear program with linear complementarity constraints (LPCC) is among the simplest mathematical programs with complementarity constraints. Yet the global solution of the LPCC remains difficult to find and/or verify. In this work we study a specific type of the LPCC which we term a bi-parametric LPCC. Reformulating the bi-parametric LPCC as a non-convex quadratically constrained program, we develop a domain-partitioning algorithm that solves a series of the linear subproblems and/or convex quadratically constrained subprograms obtained by the relaxations of the complementarity constraint. The choice of an artificial constants-pair allows us to control the domain on which the partitioning is done. Numerical results of robustly solving 105 randomly generated bi-parametric LPCC instances of different structures associated with different numbers of complementarity constraints by the algorithm are presented.
PubDate: 2015-06-01

• Maximizing the net present value of a Steiner tree
• Abstract: Abstract The theory of Steiner trees has been extensively applied in physical network design problems to locate a Steiner point that minimizes the total length of a tree. However, maximizing the total generated cash flows of a tree has not been investigated. Such a tree has costs associated with its edges and values associated with nodes. In order to reach the nodes in the tree, the edges need to be constructed. The edges are constructed in a particular order and the costs of constructing the edges and the values at the nodes are discounted over time. These discounted costs and values generate cash flows. In this paper, we study the problem of optimally locating a single Steiner point so as to maximize the sum of all the discounted cash flows, known as the net present value (NPV). An application of this problem occurs in underground mining where, we want to optimally locate a junction point in the underground access network to maximize the NPV. We propose an efficient iterative algorithm to optimally locate a single degree-3 Steiner point. We show this algorithm converges quickly and the Steiner point is unique subject to realistic design parameters.
PubDate: 2015-06-01

• MrDIRECT: a multilevel robust DIRECT algorithm for global optimization
problems
• Abstract: Abstract Although DIRECT global optimization algorithm quickly gets close to the basin of the optimum, it often takes much longer to refine the solution to a high degree of accuracy. This behavior of DIRECT is similar to the “smooth mode phenomenon” encountered when solving linear systems discretized from partial differential equation (PDE). In the case of PDE, this smooth mode phenomenon can be eliminated efficiently by the multigrid algorithm in which the PDE solver is applied at different levels of discretization. In this paper we adapt the multigrid approach to a robust version of DIRECT algorithm, obtaining a “multilevel” robust DIRECT (MrDIRECT) algorithm. Although additional parameters are needed, our numerical results show that MrDIRECT is insensitive to the parameters, and the parameters setting proposed in this paper performs very well on the tested sets of benchmark problems, in terms of the speed with which the global optimum is found to a high degree of accuracy.
PubDate: 2015-06-01

• Complementarity problems with respect to Loewnerian cones
• Abstract: Abstract This work deals with the analysis and numerical resolution of a broad class of complementarity problems on spaces of symmetric matrices. The complementarity conditions are expressed in terms of the Loewner ordering or, more generally, with respect to a dual pair of Loewnerian cones.
PubDate: 2015-06-01

• A note on the complexity of scheduling problems with linear job
deterioration
• Abstract: Abstract Jafari and Moslehi (J Glob Optim 54:389–404, 2012) state that certain single-machine scheduling problems with linear job deterioration are NP-hard. We show that this is not the case for the maximum lateness minimization problem and point out the issues in the analysis of Jafari and Moslehi (J Glob Optim 54:389–404, 2012).
PubDate: 2015-06-01

• Locating a median line with partial coverage distance
• Abstract: Abstract We generalize the classical median line location problem, where the sum of distances from a line to some given demand points is to be minimized, to a setting with partial coverage distance. In this setting, a demand point within a certain specified threshold distance $$r$$ of the line is considered covered and its partial coverage distance is considered to be zero, while non-covered demand points are penalized an amount proportional to their distance to the coverage region. The sum of partial coverage distances is to be minimized. We consider general norm distances as well as the vertical distance and extend classical properties of the median line location problem to the partial coverage case. We are finally able to derive a finite dominating set. While a simple enumeration of the finite dominating set takes $$O(m^3)$$ time, $$m$$ being the number of demand points, we show that this can be reduced to $$O(m^2\log m)$$ in the general case by plane sweeping techniques and even to $$O(m)$$ for the vertical distance and block norm distances by linear programming.
PubDate: 2015-06-01

• A natural extension of the classical envelope theorem in vector
differential programming
• Abstract: Abstract The aim of this paper is to extend the classical envelope theorem from scalar to vector differential programming. The obtained result allows us to measure the quantitative behaviour of a certain set of optimal values (not necessarily a singleton) characterized to become minimum when the objective function is composed with a positive function, according to changes of any of the parameters which appear in the constraints. We show that the sensitivity of the program depends on a Lagrange multiplier and its sensitivity.
PubDate: 2015-05-20

• Semi-continuous quadratic optimization: existence conditions and duality
scheme
• Abstract: Abstract In this work, we study the class of problems called semi-continuous optimization, which contains constrained minimization (maximization) problems with lower (upper) semi-continuous objective functions. We show some existence conditions for solutions based on asymptotic techniques, as well as a duality scheme based on the Fenchel–Moreau conjugation specifically applied to semi-continuous problems. Promising results are obtained, when we apply this scheme to minimize quadratic functions (whose Hessians can be symmetric indefinite) over nonempty, closed and convex polyhedral sets.
PubDate: 2015-05-12

• Island models for cluster geometry optimization: how design options impact
effectiveness and diversity
• Abstract: Abstract Designing island models is a challenging task for researchers. A number of decisions is required regarding the structure of the islands, how they are connected, how many individuals are migrated, which ones and how often. The impact of these choices is yet to be fully understood, specially since it may change between different problems and contexts. Cluster geometry optimization is a widely known and complex problem that provides a set of hard instances to assess and test optimization algorithms. The analysis presented in this paper reveals how design options for island models impact search effectiveness and population diversity, when seeking for the global optima of short-ranged Morse clusters. These outcomes support the definition of a robust and scalable island-based framework for cluster geometry optimization problems.
PubDate: 2015-05-07

• The robust crew pairing problem: model and solution methodology
• Abstract: Abstract We present a new robust formulation for the crew pairing problem where flight and connection times are random and vary within an interval. The model protects against infeasibility with a specified level of uncertainty and minimizes crew cost in the worst case. The resulting robust terms in the objective function and in the resource constraints are nonlinear. We apply Lagrangian relaxation to separate the nonlinear terms in the subproblem leading to a new robust formulation of the shortest path problem with resource constraints. We show that the nonlinear subproblem can be solved as a series of linear auxiliary problems. The proposed solution methodology was successful to solve industry instances in very competitive times and led to more robust crew pairing solutions as shown by simulation experiments.
PubDate: 2015-05-01

• Finding nadir points in multi-objective integer programs
• Abstract: Abstract We address the problem of finding the nadir point in a multi-objective integer programming problem. Finding the nadir point is not straightforward, especially when there are more than three objectives. The difficulty further increases for integer programming problems. We develop an exact algorithm to find the nadir point in multi-objective integer programs with integer-valued parameters. We also develop a variation that finds bounds for each component of the nadir point with a desired level of accuracy. We demonstrate on several instances of multi-objective assignment, knapsack, and shortest path problems that the algorithms work well.
PubDate: 2015-05-01

• Computing the nadir point for multiobjective discrete optimization
problems
• Abstract: Abstract We investigate the problem of finding the nadir point for multiobjective discrete optimization problems (MODO). The nadir point is constructed from the worst objective values over the efficient set of a multiobjective optimization problem. We present a new algorithm to compute nadir values for MODO with $$p$$ objective functions. The proposed algorithm is based on an exhaustive search of the $$(p-2)$$ -dimensional space for each component of the nadir point. We compare our algorithm with two earlier studies from the literature. We give numerical results for all algorithms on multiobjective knapsack, assignment and integer linear programming problems. Our algorithm is able to obtain the nadir point for relatively large problem instances with up to five-objectives.
PubDate: 2015-05-01

• A preference-based evolutionary algorithm for multiobjective optimization:
the weighting achievement scalarizing function genetic algorithm
• Abstract: Abstract When solving multiobjective optimization problems, preference-based evolutionary multiobjective optimization (EMO) algorithms introduce preference information into an evolutionary algorithm in order to focus the search for objective vectors towards the region of interest of the Pareto optimal front. In this paper, we suggest a preference-based EMO algorithm called weighting achievement scalarizing function genetic algorithm (WASF-GA), which considers the preferences of the decision maker (DM) expressed by means of a reference point. The main purpose of WASF-GA is to approximate the region of interest of the Pareto optimal front determined by the reference point, which contains the Pareto optimal objective vectors that obey the preferences expressed by the DM in the best possible way. The proposed approach is based on the use of an achievement scalarizing function (ASF) and on the classification of the individuals into several fronts. At each generation of WASF-GA, this classification is done according to the values that each solution takes on the ASF for the reference point and using different weight vectors. These vectors of weights are selected so that the vectors formed by their inverse components constitute a well-distributed representation of the weight vectors space. The efficiency and usefulness of WASF-GA is shown in several test problems in comparison to other preference-based EMO algorithms. Regarding a metric based on the hypervolume, we can say that WASF-GA has outperformed the other algorithms considered in most of the problems.
PubDate: 2015-05-01

• Existence and characterization theorems in nonconvex vector optimization
• Abstract: Abstract This paper presents existence conditions and characterization theorems for minimal points of nonconvex vector optimization problems in reflexive Banach spaces. Characterization theorems use special class of monotonically increasing sublinear scalarizing functions which are defined by means of elements of augmented dual cones. It is shown that the Hartley cone-compactness is necessary and sufficient to guarantee the existence of a properly minimal point of the problem. The necessity is proven in the case of finite dimensional space.
PubDate: 2015-05-01

• GLODS: Global and Local Optimization using Direct Search
• Abstract: Abstract Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.
PubDate: 2015-05-01

• D-gap functions and descent techniques for solving equilibrium problems
• Abstract: Abstract A new algorithm for solving equilibrium problems with differentiable bifunctions is provided. The algorithm is based on descent directions of a suitable family of D-gap functions. Its convergence is proved under assumptions which do not guarantee the equivalence between the stationary points of the D-gap functions and the solutions of the equilibrium problem. Moreover, the algorithm does not require to set parameters according to thresholds which depend on regularity properties of the equilibrium bifunction. The results of preliminary numerical tests on Nash equilibrium problems with quadratic payoffs are reported. Finally, some numerical comparisons with other D-gap algorithms are drawn relying on some further tests on linear equilibrium problems.
PubDate: 2015-05-01

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

API
Help
News (blog, publications)