for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> ENGINEERING (Total: 2250 journals)
    - CHEMICAL ENGINEERING (188 journals)
    - CIVIL ENGINEERING (179 journals)
    - ELECTRICAL ENGINEERING (100 journals)
    - ENGINEERING (1207 journals)
    - HYDRAULIC ENGINEERING (53 journals)
    - INDUSTRIAL ENGINEERING (61 journals)
    - MECHANICAL ENGINEERING (87 journals)

ENGINEERING (1207 journals)            First | 1 2 3 4 5 6 7 | Last

Showing 1001 - 1200 of 1205 Journals sorted alphabetically
Processes     Open Access  
Production     Open Access  
Production and Operations Management     Hybrid Journal   (Followers: 9)
Production Engineering     Hybrid Journal   (Followers: 3)
Production Planning & Control: The Management of Operations     Hybrid Journal   (Followers: 7)
Progress in Agricultural Engineering Sciences     Full-text available via subscription  
Progress in Computational Fluid Dynamics, An International Journal     Hybrid Journal   (Followers: 6)
Progress in Energy and Combustion Science     Full-text available via subscription   (Followers: 8)
Progress in Nanotechnology and Nanomaterials     Open Access   (Followers: 4)
Progress in Photovoltaics: Research & Applications     Hybrid Journal   (Followers: 7)
Progress in Polymer Science     Full-text available via subscription   (Followers: 32)
Propellants, Explosives, Pyrotechnics     Hybrid Journal   (Followers: 217)
Propulsion and Power Research     Open Access   (Followers: 13)
Purinergic Signalling     Hybrid Journal  
Quaderns d’Història de l’Enginyeria     Open Access  
Quality and Reliability Engineering International     Hybrid Journal   (Followers: 10)
Quality Engineering     Hybrid Journal   (Followers: 7)
Radiochimica Acta     Hybrid Journal   (Followers: 4)
Rapid Prototyping Journal     Hybrid Journal   (Followers: 3)
Rare Metals     Hybrid Journal  
Reactive and Functional Polymers     Hybrid Journal   (Followers: 5)
Recent Patents on Engineering     Full-text available via subscription   (Followers: 2)
Recent Patents on Nanotechnology     Full-text available via subscription   (Followers: 2)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 1)
Redes de Ingeniería     Open Access  
Regional Maritime University Journal     Full-text available via subscription   (Followers: 1)
Regular and Chaotic Dynamics     Hybrid Journal  
Rem : Revista Escola de Minas     Open Access   (Followers: 1)
Remote Sensing     Open Access   (Followers: 12)
Remote Sensing Letters     Hybrid Journal   (Followers: 9)
Requirements Engineering     Hybrid Journal   (Followers: 3)
Research Ideas and Outcomes     Open Access  
Research in Engineering Design     Hybrid Journal   (Followers: 10)
Research Journal of Nanoscience and Nanotechnology     Open Access   (Followers: 2)
Research Works of Air Force Institute of Technology     Open Access   (Followers: 1)
Resonance     Hybrid Journal   (Followers: 16)
Review of Symbolic Logic     Full-text available via subscription   (Followers: 1)
Reviews in Advanced Sciences and Engineering     Partially Free   (Followers: 1)
Revista AIDIS de Ingeniería y Ciencias Ambientales. Investigación, desarrollo y práctica     Open Access  
Revista Brasileira de Engenharia Agrícola e Ambiental     Open Access   (Followers: 1)
Revista Ciencias e Ingeniería al Día     Open Access  
Revista Científica e-Locução     Open Access  
Revista CINTEX     Open Access  
Revista Cubana de Ingeniería     Open Access  
Revista de Engenharia da Universidade Católica de Petrópolis     Open Access  
Revista de Ingeniería     Open Access  
Revista de Ingenieria Sismica     Open Access  
Revista de Investigación, Desarrollo e Innovación     Open Access  
Revista EIA     Open Access   (Followers: 1)
Revista Facultad de Ingeniería     Open Access   (Followers: 1)
Revista Facultad de Ingenieria - Universidad de Tarapaca     Open Access  
Revista Facultad de Ingeniería Universidad de Antioquia     Open Access   (Followers: 1)
Revista Informador Técnico     Open Access   (Followers: 1)
Revista Ingenieria de Construcción     Open Access  
Revista Logos Ciencia & Tecnología     Open Access  
Revue de Métallurgie     Full-text available via subscription  
Russian Engineering Research     Hybrid Journal  
Russian Journal of Non-Ferrous Metals     Hybrid Journal   (Followers: 25)
Russian Microelectronics     Hybrid Journal  
Sadhana     Open Access   (Followers: 4)
Safety Science     Hybrid Journal   (Followers: 15)
Scholedge International Journal of Multidisciplinary & Allied Studies     Open Access   (Followers: 2)
Science & Technique     Open Access  
Science and Engineering Ethics     Hybrid Journal   (Followers: 6)
Science and Technology     Open Access   (Followers: 2)
Science China Technological Sciences     Hybrid Journal  
Science in Context     Hybrid Journal   (Followers: 1)
Science Journal of Volgograd State University. Technology and innovations     Open Access  
Science Progress     Full-text available via subscription   (Followers: 3)
Scientia cum Industria     Open Access  
Scientific Journal of Control Engineering     Open Access   (Followers: 1)
Scientific Journal of Pure and Applied Sciences     Open Access  
Scientific Journal of Review     Open Access  
Sealing Technology     Full-text available via subscription   (Followers: 1)
Securitas Vialis     Hybrid Journal  
Security and Communication Networks     Hybrid Journal   (Followers: 2)
Selected Topics in Applied Earth Observations and Remote Sensing, IEEE Journal of     Hybrid Journal   (Followers: 15)
Semiconductors     Hybrid Journal  
Semiconductors and Semimetals     Full-text available via subscription  
Sensing and Imaging : An International Journal     Hybrid Journal   (Followers: 1)
Sensor Letters     Full-text available via subscription   (Followers: 1)
Sensors     Open Access   (Followers: 9)
Separation and Purification Technology     Hybrid Journal   (Followers: 10)
Services Computing, IEEE Transactions on     Hybrid Journal   (Followers: 4)
Shock and Vibration     Hybrid Journal   (Followers: 6)
SIAM Journal on Applied Dynamical Systems     Full-text available via subscription   (Followers: 2)
SIAM Journal on Mathematical Analysis     Full-text available via subscription   (Followers: 3)
SIAM Journal on Matrix Analysis and Applications     Full-text available via subscription   (Followers: 1)
SIAM Journal on Numerical Analysis     Full-text available via subscription   (Followers: 4)
SIAM Journal on Optimization     Full-text available via subscription   (Followers: 6)
SIAM Review     Full-text available via subscription   (Followers: 5)
SILICON     Hybrid Journal  
Sistemas & Telemática     Open Access   (Followers: 1)
Sleep and Biological Rhythms     Hybrid Journal   (Followers: 3)
Small     Hybrid Journal   (Followers: 8)
Smart Grid     Open Access  
Soft Computing     Hybrid Journal   (Followers: 6)
Software Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 33)
Soil Dynamics and Earthquake Engineering     Hybrid Journal   (Followers: 7)
Soldagem & Inspeção     Open Access  
Solid-State Circuits Magazine, IEEE     Hybrid Journal   (Followers: 7)
SourceOCDE Developpement urbain, rural et regional     Full-text available via subscription  
SourceOCDE Energie     Full-text available via subscription  
SourceOECD Energy     Full-text available via subscription  
SourceOECD Science and Technology Statistics - SourceOCDE Base de donnees des sciences et de la technologie     Full-text available via subscription  
SourceOECD Transport     Full-text available via subscription   (Followers: 3)
SourceOECD Urban, Rural and Regional Development     Full-text available via subscription   (Followers: 1)
South African Computer Journal     Full-text available via subscription  
South African Journal of Agricultural Extension     Open Access   (Followers: 3)
South African Journal of Science     Open Access   (Followers: 3)
Sports Engineering     Hybrid Journal   (Followers: 2)
Stahlbau     Hybrid Journal   (Followers: 4)
Steel in Translation     Hybrid Journal  
Steel Research International     Hybrid Journal   (Followers: 28)
Stochastic Analysis and Applications     Hybrid Journal  
Stochastic Processes and their Applications     Hybrid Journal   (Followers: 4)
Stochastics and Dynamics     Hybrid Journal  
Strain     Hybrid Journal   (Followers: 1)
Strategic Planning for Energy and the Environment     Hybrid Journal   (Followers: 3)
Studies in Engineering and Technology     Open Access  
Studies in Interface Science     Full-text available via subscription   (Followers: 1)
Studies in Logic and Practical Reasoning     Full-text available via subscription  
Studies in Surface Science and Catalysis     Full-text available via subscription   (Followers: 1)
Superconductor Science and Technology     Hybrid Journal  
Surface Engineering     Hybrid Journal   (Followers: 3)
Surface Review and Letters     Hybrid Journal   (Followers: 1)
Surface Science Reports     Full-text available via subscription   (Followers: 14)
Survey Review     Hybrid Journal   (Followers: 6)
Surveying and Land Information Science     Full-text available via subscription   (Followers: 2)
Sustainability Science     Hybrid Journal   (Followers: 5)
Sustainability Science and Engineering     Full-text available via subscription   (Followers: 4)
Sustainable Management of Sediment Resources     Full-text available via subscription  
Swiss Journal of Geosciences     Hybrid Journal  
Symmetry     Open Access  
Synthesis Lectures on Algorithms and Software in Engineering     Full-text available via subscription  
Synthesis Lectures on Antennas     Full-text available via subscription   (Followers: 2)
Synthesis Lectures on Biomedical Engineering     Full-text available via subscription  
Synthesis Lectures on Computational Electromagnetics     Full-text available via subscription   (Followers: 3)
Synthesis Lectures on Energy and the Environment: Technology, Science, and Society     Full-text available via subscription   (Followers: 2)
Synthesis Lectures on Engineering     Full-text available via subscription  
Synthesis Lectures on Global Engineering     Full-text available via subscription  
Synthesis Lectures on Professionalism and Career Advancement for Scientists and Engineers     Full-text available via subscription  
Synthetic Metals     Hybrid Journal   (Followers: 4)
Systems Engineering     Hybrid Journal   (Followers: 6)
Systems Engineering Procedia     Open Access  
Systems Research Forum     Hybrid Journal  
Systems Science & Control Engineering     Open Access   (Followers: 3)
Techno.Com     Open Access  
Technological Engineering     Open Access  
Technologies     Open Access   (Followers: 1)
TECHNOLOGY     Hybrid Journal  
Technology and Innovation     Full-text available via subscription   (Followers: 3)
Technology in Society     Hybrid Journal   (Followers: 4)
Technometrics     Full-text available via subscription   (Followers: 6)
Tecnologia, Ciencia, Educacion     Open Access   (Followers: 1)
Tecnura     Open Access  
Telecommunications Policy     Hybrid Journal   (Followers: 8)
Terahertz Science and Technology, IEEE Transactions on     Hybrid Journal   (Followers: 1)
Textile Science and Technology     Full-text available via subscription   (Followers: 3)
The Journal of Computational Multiphase Flows     Full-text available via subscription  
The Journal of Supercomputing     Hybrid Journal   (Followers: 1)
The Scientific World Journal     Open Access  
Theoretical and Computational Fluid Dynamics     Hybrid Journal   (Followers: 9)
Theoretical Issues in Ergonomics Science     Hybrid Journal   (Followers: 2)
Thermal Engineering     Hybrid Journal   (Followers: 3)
Tikrit Journal of Engineering Science     Open Access  
tm - Technisches Messen     Hybrid Journal   (Followers: 1)
Topics in Catalysis     Hybrid Journal   (Followers: 1)
Traffic Injury Prevention     Hybrid Journal   (Followers: 41)
TRANSACTIONS of the VŠB - Technical University of Ostrava, Safety Engineering Series     Open Access   (Followers: 1)
Transactions of Tianjin University     Full-text available via subscription  
Transport and Telecommunication Journal     Open Access   (Followers: 3)
Transport World Africa     Full-text available via subscription   (Followers: 3)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 32)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 5)
Trends in Applied Sciences Research     Open Access   (Followers: 1)
Tribology in Industry     Open Access   (Followers: 1)
Tribology International     Hybrid Journal   (Followers: 41)
Tribology Letters     Hybrid Journal   (Followers: 5)
Tribology Transactions     Hybrid Journal   (Followers: 33)
Tribotest     Hybrid Journal  
Tropical Science     Hybrid Journal   (Followers: 1)
Turkish Journal of Engineering and Environmental Sciences     Open Access  
Ultramicroscopy     Hybrid Journal   (Followers: 2)
Uludağ University Journal of The Faculty of Engineering     Open Access  
Universal Journal of Applied Science     Open Access  
Universal Journal of Engineering Science     Open Access   (Followers: 1)
Utilities Policy     Hybrid Journal   (Followers: 2)
Vacuum     Hybrid Journal   (Followers: 12)
Virtual and Physical Prototyping     Hybrid Journal   (Followers: 3)
Visualization in Engineering     Open Access  
Walailak Journal of Science and Technology     Open Access  
Waste and Biomass Valorization     Hybrid Journal  
Waste Management Series     Full-text available via subscription   (Followers: 2)
Waves in Random and Complex Media     Hybrid Journal  
Wear     Hybrid Journal   (Followers: 29)
Welding in the World     Hybrid Journal   (Followers: 2)
West African Journal of Industrial and Academic Research     Open Access   (Followers: 1)
Women in Engineering Magazine, IEEE     Full-text available via subscription   (Followers: 8)
World Journal of Engineering     Full-text available via subscription   (Followers: 3)

  First | 1 2 3 4 5 6 7 | Last

Journal Cover Journal of Global Optimization
  [SJR: 0.919]   [H-I: 51]   [2 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001
   Published by Springer-Verlag Homepage  [2281 journals]
  • Saddle point approach to solving problem of optimal control with fixed
    • Abstract: Abstract In a Hilbert space, the problem of terminal control with linear dynamics and fixed ends of the trajectory is considered. The integral objective functional has a quadratic form. In contrast to the traditional approach, the problem of terminal control is interpreted not as an optimization problem, but as a saddle-point problem. The solution to this problem is a saddle point of the Lagrange function with components in the form of controls, phase and conjugate trajectories. A saddle-point method is proposed, the convergence of the method in all components of the solution is proved.
      PubDate: 2016-05-01
  • Notes on the single route lateral transhipment problem
    • Abstract: Abstract Previous research has analyzed deterministic and stochastic models of lateral transhipments between different retailers in a supply chain. In these models the analysis assumes given fixed transhipment costs and determines under which situations (magnitudes of excess supply and demand at various retailers) the transhipment is profitable. However, in reality, these depend on aspects like the distance between retailers or the transportation mode chosen. In many situations, combining the transhipments may save transportation costs. For instance, one or more vehicle routes may be used to redistribute the inventory of the potential pickup and delivery stations. This can be done in any sequence as long as the vehicle capacity is not violated and there is enough load on the vehicle to satisfy demand. The corresponding problem is an extension of the one-commodity pickup and delivery traveling salesman and the pickup and delivery vehicle routing problem. When ignoring the routing aspect and assuming given fixed costs, transhipment is only profitable if the quantities are higher than a certain threshold. In contrast to that, the selection of visited retailers is dependent on the transportation costs of the tour and therefore the selected retailers are interrelated. Hence the problem also has aspects of a (team) orienteering problem. The main contribution is the discussion of the tour planning aspects for lateral transhipments which may be valuable for in-house planning but also for price negotiations with external contractors. A mixed integer linear program for the single route and single commodity version is presented and an improved LNS framework to heuristically solve the problem is introduced. Furthermore, the effect of very small load capacity on the structure of optimal solutions is discussed.
      PubDate: 2016-05-01
  • Balancing mixed-model assembly lines with sequence-dependent tasks via
           hybrid genetic algorithm
    • Abstract: Abstract Close connections existing among sequence-dependent tasks should be emphasized while assembling products within automotive or electronic industries. This paper addresses the mixed-model assembly line balancing problem with sequence-dependent tasks with two objectives, the minimization of cycle time and workload variance. A hybrid genetic algorithm with novel logic strings was proposed to address the problem. First, both the sequence-dependent connections and precedence relations are integrated into the combined precedence graph so as to transform the original problem into the single-model assembly line balancing problem and to decrease the computational complexity. Second, three heuristic factors are hybridized into the process of initialization with the purpose of improving the quality of initial solution population. Third, considering sequence-dependent tasks, logic strings are designed to ensure the feasibility of chromosomes during two-point crossover and insertion mutation operations. Computational studies have demonstrated that the proposed algorithm can solve problems to near-optimality and even optimality with less computational effort.
      PubDate: 2016-05-01
  • A preconditioned block Arnoldi method for large scale Lyapunov and
           algebraic Riccati equations
    • Abstract: Abstract In the present paper, we propose a preconditioned Newton–Block Arnoldi method for solving large continuous time algebraic Riccati equations. Such equations appear in control theory, model reduction, circuit simulation amongst other problems. At each step of the Newton process, we solve a large Lyapunov matrix equation with a low rank right hand side. These equations are solved by using the block Arnoldi process associated with a preconditioner based on the alternating direction implicit iteration method. We give some theoretical results and report numerical tests to show the effectiveness of the proposed approach.
      PubDate: 2016-05-01
  • Generalized subdifferentials of the sign change counting function
    • Abstract: Abstract The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for this sign change counting function is given where classical subdifferentials remain intractable. An attempt to prove global optimality at some point, for the 4-dimensional first non trivial example, is made by using a sufficient condition specially tailored among all the cases for this subdifferential.
      PubDate: 2016-05-01
  • Global optimization approach to Malfatti’s problem
    • Abstract: Abstract We examine Malfatti’s problem which dates back to 200 years ago from the view point of global optimization. The problem has been formulated as the convex maximization problem over a nonconvex set. Global optimality condition by Strekalovsky (Sov Math Dokl 292(5):1062–1066, 1987) has been applied to this problem. For solving numerically Malfatti’s problem, we propose the algorithm in Enkhbat (J Glob Optim 8:379–391, 1996) which converges globally. Some computational results are provided.
      PubDate: 2016-05-01
  • Practical exponential set stabilization for switched nonlinear systems
           with multiple subsystem equilibria
    • Abstract: Abstract This paper studies the practical exponential set stabilization problem for switched nonlinear systems via a \(\tau \) -persistent approach. In these kinds of switched systems, every autonomous subsystem has one unique equilibrium point and these subsystems’ equilibria are different each other. Based on previous stability results of switched systems and a set of Gronwall–Bellman inequalities, we prove that the switched nonlinear system will reach the neighborhood of the corresponding subsystem equilibrium at every switching time. In addition, we constructively design a suitable \(\tau \) -persistent switching law to practically exponentially set stabilize the switched system. Finally, a numerical example is presented to illustrate the obtained results.
      PubDate: 2016-05-01
  • Convex hull characterizations of lexicographic orderings
    • Abstract: Abstract Given a p-dimensional nonnegative, integral vector \(\varvec{\alpha },\) this paper characterizes the convex hull of the set S of nonnegative, integral vectors \(\varvec{x}\) that is lexicographically less than or equal to \(\varvec{\alpha }.\) To obtain a finite number of elements in S,  the vectors \(\varvec{x}\) are restricted to be component-wise upper-bounded by an integral vector \(\varvec{u}.\) We show that a linear number of facets is sufficient to describe the convex hull. For the special case in which every entry of \(\varvec{u}\) takes the same value \((n-1)\) for some integer \(n \ge 2,\) the convex hull of the set of n-ary vectors results. Our facets generalize the known family of cover inequalities for the \(n=2\) binary case. They allow for advances relative to both the modeling of integer variables using base-n expansions, and the solving of knapsack problems having weakly super-decreasing coefficients. Insight is gained by alternately constructing the convex hull representation in a higher-variable space using disjunctive programming arguments.
      PubDate: 2016-04-25
  • Delaunay-based derivative-free optimization via global surrogates, part
           II: convex constraints
    • Abstract: Abstract The derivative-free global optimization algorithms developed in Part I of this study, for linearly constrained problems, are extended to nonconvex n-dimensional problems with convex constraints. The initial \(n+1\) feasible datapoints are chosen in such a way that the volume of the simplex generated by these datapoints is maximized; as the algorithm proceeds, additional feasible datapoints are added in such a way that the convex hull of the available datapoints efficiently increases towards the boundaries of the feasible domain. Similar to the algorithms developed in Part I of this study, at each step of the algorithm, a search function is defined based on an interpolating function which passes through all available datapoints and a synthetic uncertainty function which characterizes the distance to the nearest datapoints. This uncertainty function, in turn, is built on the framework of a Delaunay triangulation, which is itself based on all available datapoints together with the (infeasible) vertices of an exterior simplex which completely contains the feasible domain. The search function is minimized within those simplices of this Delaunay triangulation that do not include the vertices of the exterior simplex. If the outcome of this minimization is contained within the circumsphere of a simplex which includes a vertex of the exterior simplex, this new point is projected out to the boundary of the feasible domain. For problems in which the feasible domain includes edges (due to the intersection of multiple twice-differentiable constraints), a modified search function is considered in the vicinity of these edges to assure convergence.
      PubDate: 2016-04-19
  • An efficient multi-objective PSO algorithm assisted by Kriging metamodel
           for expensive black-box problems
    • Abstract: Abstract The huge computational overhead is the main challenge in the application of community based optimization methods, such as multi-objective particle swarm optimization and multi-objective genetic algorithm, to deal with the multi-objective optimization involving costly simulations. This paper proposes a Kriging metamodel assisted multi-objective particle swarm optimization method to solve this kind of expensively black-box multi-objective optimization problems. On the basis of crowding distance based multi-objective particle swarm optimization algorithm, the new proposed method constructs Kriging metamodel for each expensive objective function adaptively, and then the non-dominated solutions of the metamodels are utilized to guide the update of particle population. To reduce the computational cost, the generalized expected improvements of each particle predicted by metamodels are presented to determine which particles need to perform actual function evaluations. The suggested method is tested on 12 benchmark functions and compared with the original crowding distance based multi-objective particle swarm optimization algorithm and non-dominated sorting genetic algorithm-II algorithm. The test results show that the application of Kriging metamodel improves the search ability and reduces the number of evaluations. Additionally, the new proposed method is applied to the optimal design of a cycloid gear pump and achieves desirable results.
      PubDate: 2016-04-19
  • A polynomially solvable case of the pooling problem
    • Abstract: Abstract Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem.
      PubDate: 2016-04-18
  • Multiple depot ring star problem: a polyhedral study and an exact
    • Abstract: Abstract The multiple depot ring-star problem (MDRSP) is an important combinatorial optimization problem that arises in optical fiber network design and in applications that collect data using stationary sensing devices and autonomous vehicles. Given the locations of a set of customers and a set of depots, the goal is to (i) find a set of simple cycles such that each cycle (ring) passes through a subset of customers and exactly one depot, (ii) assign each non-visited customer to a visited customer or a depot, and (iii) minimize the sum of the routing costs, i.e., the cost of the cycles and the assignment costs. We present a mixed integer linear programming formulation for the MDRSP and propose valid inequalities to strengthen the linear programming relaxation. Furthermore, we present a polyhedral analysis and derive facet-inducing results for the MDRSP. All these results are then used to develop a branch-and-cut algorithm to obtain optimal solutions to the MDRSP. The performance of the branch-and-cut algorithm is evaluated through extensive computational experiments on several classes of test instances.
      PubDate: 2016-04-12
  • Heuristic solution approaches for the maximum minsum dispersion problem
    • Abstract: Abstract The Maximum Minsum Dispersion Problem (Max-Minsum DP) is a strongly NP-Hard problem that belongs to the family of equitable dispersion problems. When dealing with dispersion, the operations research literature has focused on optimizing efficiency-based objectives while neglecting, for the most part, measures of equity. The most common efficiency-based functions are the sum of the inter-element distances or the minimum inter-element distance. Equitable dispersion problems, on the other hand, attempt to address the balance between efficiency and equity when selecting a subset of elements from a larger set. The objective of the Max-Minsum DP is to maximize the minimum aggregate dispersion among the chosen elements. We develop tabu search and GRASP solution procedures for this problem and compare them against the best in the literature. We also apply LocalSolver, a commercially available black-box optimizer, to compare our results. Our computational experiments show that we are able to establish new benchmarks in the solution of the Max-Minsum DP.
      PubDate: 2016-04-09
  • Covers and approximations in multiobjective optimization
    • Abstract: Abstract Due to the growing interest in approximation for multiobjective optimization problems (MOPs), a theoretical framework for defining and classifying sets representing or approximating solution sets for MOPs is developed. The concept of tolerance function is proposed as a tool for modeling representation quality. This notion leads to the extension of the traditional dominance relation to \(t\hbox {-}\) dominance. Two types of sets representing the solution sets are defined: covers and approximations. Their properties are examined in a broader context of multiple solution sets, multiple cones, and multiple quality measures. Applications to complex MOPs are included.
      PubDate: 2016-04-06
  • A Bayesian approach to constrained single- and multi-objective
    • Abstract: Abstract This article addresses the problem of derivative-free (single- or multi-objective) optimization subject to multiple inequality constraints. Both the objective and constraint functions are assumed to be smooth, non-linear and expensive to evaluate. As a consequence, the number of evaluations that can be used to carry out the optimization is very limited, as in complex industrial design optimization problems. The method we propose to overcome this difficulty has its roots in both the Bayesian and the multi-objective optimization literatures. More specifically, an extended domination rule is used to handle objectives and constraints in a unified way, and a corresponding expected hyper-volume improvement sampling criterion is proposed. This new criterion is naturally adapted to the search of a feasible point when none is available, and reduces to existing Bayesian sampling criteria—the classical Expected Improvement (EI) criterion and some of its constrained/multi-objective extensions—as soon as at least one feasible point is available. The calculation and optimization of the criterion are performed using Sequential Monte Carlo techniques. In particular, an algorithm similar to the subset simulation method, which is well known in the field of structural reliability, is used to estimate the criterion. The method, which we call BMOO (for Bayesian Multi-Objective Optimization), is compared to state-of-the-art algorithms for single- and multi-objective constrained optimization.
      PubDate: 2016-04-04
  • Preface
    • PubDate: 2016-04-01
  • A proximal method with logarithmic barrier for nonlinear complementarity
    • Abstract: Abstract We study the proximal method with the regularized logarithmic barrier, originally stated by Attouch and Teboulle for positively constrained optimization problems, in the more general context of nonlinear complementarity problems with monotone operators. We consider two sequences generated by the method. We prove that one of them, called the ergodic sequence, is globally convergent to the solution set of the problem, assuming just monotonicity of the operator and existence of solutions; for convergence of the other one, called the proximal sequence, we demand some stronger property, like paramonotonicity of the operator or the so called “cut property” of the problem.
      PubDate: 2016-04-01
  • Constrained optimization with stochastic feasibility regions applied to
           vehicle path planning
    • Abstract: Abstract In real-time trajectory planning for unmanned vehicles, on-board sensors, radars and other instruments are used to collect information on possible obstacles to be avoided and pathways to be followed. Since, in practice, observations of the sensors have measurement errors, the stochasticity of the data has to be incorporated into the models. In this paper, we consider using a genetic algorithm for the constrained optimization problem of finding the trajectory with minimum length between two locations, avoiding the obstacles on the way. To incorporate the variability of the sensor readings, we propose a modified genetic algorithm, addressing the stochasticity of the feasible regions. In this way, the probability that a possible solution in the search space, say x, is feasible can be derived from the random observations of obstacles and pathways, creating a real-time data learning algorithm. By building a confidence region from the observed data such that its border intersects with the solution point x, the level of the confidence region defines the probability that x is feasible. We propose using a smooth penalty function based on the Gaussian distribution, facilitating the borders of the feasible regions to be reached by the algorithm.
      PubDate: 2016-04-01
  • On global search in nonconvex optimal control problems
    • Abstract: Abstract Optimal control problems with a nonconvex quadratic functional of Lagrange are considered. On the base of global optimality conditions we develop a global search algorithm, one of the principal module of which is represented by special local search method. The results of computational testing presented.
      PubDate: 2016-03-11
  • Preface
    • PubDate: 2016-03-04
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015