Search

Abstract: The aim of this note is to show that the optimization algorithm proposed in may not lead to the optimal solution in some cases. In fact, the optimization problem remains open if we do not apply the branch-and-bound method to solve it or compute all the objective values of minimal solutions of the feasible domain. [Copyright &y& Elsevier]

Abstract Grey Wolf Optimizer (GWO) algorithm is a relatively new algorithm in the field of swarm intelligence for solving continuous optimization problems as well as real world optimization problems. The Grey Wolf Optimizer is the only algorithm in the category of swam intelligence which is based on leadership hierarchy. This paper has three important aspects- Firstly, for improving the search ability by grey wolf a modified algorithm RW-GWO based on random walk has been proposed. Secondly, its performance is exhibited in comparison with GWO and state of art algorithms GSA, CS, BBO and SOS on IEEE CEC 2014 benchmark problems. A non-parametric test Wilcoxon and Performance Index Analysis has been performed to observe the impact of improving the leaders in the proposed algorithm. The results presented in this paper demonstrate that the proposed algorithm provide a better leadership to search a prey by grey wolves. The third aspect of the paper is to use the proposed algorithm and GWO on real life application problems. It is concluded from this article that RW-GWO algorithm is an efficient and reliable algorithm for solving not only continuous optimization problems but also for real life optimization problems. [ABSTRACT FROM AUTHOR]

Abstract This paper proposes a novel decomposition method based on user-preference and developed a variation of the decomposition based multi-objective optimization algorithm (MOEA/D) targeting only solutions in a small region of the Pareto-front defined by the preference information supplied by the decision maker (DM). This is particularly advantageous for solving multi-objective optimization problems (MOPs) with more than 3 objectives, i.e., many-objective optimization problems (MaOPs). As the number of objectives increases, the ability of an EMO algorithm to approximate the entire Pareto front (PF) is rapidly diminishing. In this paper, we first propose a novel scalarizing function making use of a series of new reference points derived from a reference point specified by the DM in the preference model. Based on this scalarizing function, we then develop a user-preference-based EMO algorithm, namely R-MOEA/D. One key merit of R-MOEA/D is that it does not rely on an estimation of the ideal point, which may impact significantly the performances of state-of-the-art decomposition based EMO algorithms. Our experimental results on multi-objective and many-objective benchmark problems have shown that R-MOEA/D provides a more direct and efficient search towards the preferred PF region, resulting in competitive performances. In an interactive setting when the DM changes the reference point during optimization, R-MOEA/D has a faster response speed and performance than the compared algorithms, showing its robustness and adaptability to changes of the preference model. Furthermore, the effectiveness of R-MOEA/D is verified on a real-world problem of reservoir flood control operations. [ABSTRACT FROM AUTHOR]

Abstract Distributed assembly permutation flowshop scheduling problem (DAPFSP) has important applications in modern assembly systems. In this paper, we present three variants of the discrete invasive weed optimization (DIWO) for the DAPFSP with total flowtime criterion. For solving such a problem, we present a two-level representation that consists of a product permutation and a number of job sequences. We introduce neighbourhood operators for both the product permutation and job sequences. We design effective local search procedures respectively for product-permutation-based neighbourhood and job-sequence-based neighbourhood. By combining the problem-specific knowledge and the idea of invasive weed optimization, we present three DIWO-based algorithms: a two-level discrete invasive weed optimization (TDIWO), a discrete invasive weed optimization with hybrid search operators (HDIWO), and a HDIWO with selection probability. The algorithms explore the two neighbourhoods in quite a different way. We calibrate the presented DIWO algorithms by means of the design of experimental method, and carry out a comprehensive computational campaign based on the 810 benchmark instances in the literature. The numerical experiments show that the presented DIWO algorithms perform significantly better than the other competing algorithms in the literature. Among the proposed algorithms, HDIWO is the best one. [ABSTRACT FROM AUTHOR]

Abstract This paper presents a novel framework for improving the performance of multi-population algorithms in solving dynamic optimization problems (DOPs). The fundamental idea of the proposed framework is to incorporate the concept of scheduling into multi-population methods with the aim to allocate more function evaluations to the best performing sub-populations. Two methods are developed based on the proposed framework, each of which uses a different approach for scheduling the sub-populations. The first method combines the quality of sub-populations and the degree of diversity among them into a single feedback parameter for detecting the best performing sub-population. The second method uses the learning automata as the central unit for performing the scheduling operation. In order to validate the applicability of the proposed methods, they are incorporated into three well-known algorithms for DOPs. The experimental results show the efficiency of the scheduling approach for improving the multi-population methods on the moving peaks benchmark (MPB) and generalized dynamic benchmark generator. [ABSTRACT FROM AUTHOR]

Abstract: The problem of layout and shape optimization of stiffeners in plates loaded in plane and in bending Kirchhoff’s plates is considered in the paper. Two types of reinforcement are analyzed here, namely introduction of elements made of stiffer material like fibers or beams and introduction of ribs. The problem of minimization (maximization) of arbitrary objective functional of displacements, strains, stresses or reactions with constraint imposed on the structure cost is considered. Using adjoint method, expressions for sensitivities with respect to introduction of stiffeners are derived and on this basis conditions of modification are formulated. In order to find optimal reinforcement, heuristic algorithm is proposed in the paper. At first, using information from sensitivity analysis, initial localization of a new fiber or rib is determined. Next, in order to correct their positions and to determine other parameters characterizing stiffened structure standard optimization is performed. Usually, optimal position of the stiffener only a little differs from the initial position. Numerical examples illustrate applicability of the method. [Copyright &y& Elsevier]

Abstract: This paper proposes a hybrid methodology that exploits strengths of wavelet analysis and support vector machine model in forecasting time series, and deals with the application of proposed methodology in manufacturing time series forecasting. This method is characteristic of the preprocessing of sample data using wavelet transformation for forecast, i.e., the data sequence of evolvement of share of some sectors in manufacturing is first mapped into several time-frequency domains, and then a support vector machine is established for each domain. The final forecasting results are the algebraic sums of all the forecasted components obtained by respective support vector machine models corresponding to different time-frequency domains. Nevertheless, one of disadvantages of the method is dilemma of selection of values of parameters in support vector machine because the way of selecting values for the parameters will affect the generalization performance remarkably. In this paper, chaos optimization is applied to accomplish selection of values of parameters. Results of experiments based on gross values of textile product in Japan suggest that this hybrid method can both achieve higher accuracy in manufacturing forecasting. [Copyright &y& Elsevier]

Abstract: This paper is concerned with the study of necessary and sufficient optimality conditions for convex–concave fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn–Tucker saddle and stationary points are characterized. In addition, some important theorems related to the Kuhn–Tucker problem for saddle and stationary points are established. Moreover, a general dual problem is formulated, and weak, strong and converse duality theorems are proved. Throughout the presented paper illustrative examples are given to clarify and implement the developed theory. [Copyright &y& Elsevier]

Abstract: The strong Rabin number of a network of connectivity is the minimum so that for any nodes , of , there exist node-disjoint paths from to , respectively, whose maximal length is not greater than , where and are not necessarily distinct. In this paper, we show that the strong Rabin number of a -dimensional folded hypercube is , where is the diameter of the -dimensional folded hypercube. Each node-disjoint path we obtain has length not greater than the distance between the two end nodes plus two. This paper solves an open problem raised by Liaw and Chang. [Copyright &y& Elsevier]

In design optimization problems, the robustness of a solution is essential to be considered when it is going to be implemented or used in real world. Robustness can be defined in different ways, but in this work, it is considered as the property of a solution’s performance to be as insensitive as possible to perturbations in that solution. Optimizing both quality and robustness is generally addressed as a multiobjective problem. This paper presents a complete framework aided by decision maker, which can be used to solve robust optimization problems with one or more objectives. Decision maker actively takes part of the process, defining a priori the robustness metric, and specifying iteratively a robustness factor that joins quality and robustness metrics into a single fitness function. The framework is very flexible allowing decision maker not only to specify the right robustness level for him, but also to exchange metrics and algorithms if he wants. The framework was tested and validated using two single-objective robust benchmarking functions, and in one new multiobjective robust function, created to challenge the framework, which tries to seek the most robust Pareto optimal front according to decision maker preferences. [ABSTRACT FROM AUTHOR]

Abstract: In oblique shape from shading (SfS), the illumination direction is essential for recovering the 3D surface of a shaded image. On the other hand, fast marching methods (FMM) are SfS algorithms that use the mechanism of wave propagation to reconstruct the surface. In this paper, the estimation of illumination direction is addressed and we model it as an optimization problem. The idea is to minimize the inconsistency of wave propagation of FMM during the reconstruction. As the consistency of wave propagation is a multi-modal function of illumination direction, genetic algorithm (GA) is utilized. The proposed algorithm is examined on four synthetic models and a real world object. The experimental results show that the proposed algorithm is superior to benchmark methods. [Copyright &y& Elsevier]

Abstract: The paper presents a formal methodology for the hull form optimization in calm and rough water using wash waves and selected dynamic responses, respectively. Parametric hull form modeling is used to generate the variant hull forms with some of the form parameters modified, which are evaluated in the optimization scheme based on evolutionary strategies. Rankine-source panel method and strip theories are used for the hydrodynamic evaluation. The methodology is implemented in the optimization of a double-chine, planing hull form. Furthermore, a dual-stage optimization strategy is applied on a modern fast displacement ferry. The effect of the selected optimization parameters is presented and discussed. [Copyright &y& Elsevier]

Abstract: In this paper, a new optimization approach combining primer vector theory and evolutionary algorithms for fuel-optimal non-linear impulsive rendezvous is proposed. The optimization approach is designed to seek the optimal number of impulses as well as the optimal impulse vectors. In this optimization approach, adding a midcourse impulse is determined by an interactive method, i.e. observing the primer-magnitude time history. An improved version of simulated annealing is employed to optimize the rendezvous trajectory with the fixed-number of impulses. This interactive approach is evaluated by three test cases: coplanar circle-to-circle rendezvous, same-circle rendezvous and non-coplanar rendezvous. The results show that the interactive approach is effective and efficient in fuel-optimal non-linear rendezvous design. It can guarantee solutions, which satisfy the Lawden''s necessary optimality conditions. [Copyright &y& Elsevier]

Abstract: The Basic Curvature Equations of Locally Tool Positioning (BCELTP) are an accurate description of the relationships between the second order approximations of the cutter surface, the tool envelope surface and the designed surface, which was proposed in our previous paper [Gong Hu, Cao Li-Xin, Liu Jian. Second order approximation of tool envelope surface for 5-axis machining with single point contact. Computer-Aided Design 2008;40:604–15]. Based on them, for a given tool path with single cutter contact point, a new local optimization method of tool positions is presented to maximize the machining strip width by minimizing the relative normal curvature between the tool envelope surface and the designed surface. Since the BCELTP are accurate analytical expressions, the proposed optimization method of tool positions is accurate and effective in computation. Furthermore, another new optimization method of tool positions based on a dual-parameter envelope is subsequently proposed. The most interesting point is that it will result in the same results as the method based on the BCELTP. It also proves the correctness of the method based on the BCELTP from a different angle. Finally, several examples are given to prove its effectiveness and accuracy. [Copyright &y& Elsevier]

Abstract: The paper is devoted to cold-formed thin-walled channel beams with open or closed profile of drop flanges. Geometric properties of two C-sections are described with consideration of warping functions and warping inertia moments. Optimization criterion and the dimensionless objective function as a quality measure are defined. Constraints of feasible solutions are strength, global and local buckling conditions and also geometric condition. Analytical solutions of the problems of global and local buckling for thin-walled beams are presented. Results of numerical investigation of optimization problem are compared and presented in tables and figures. [Copyright &y& Elsevier]

Abstract: Recently, interest in analysis and generation of human and human-like motion has increased in various areas. In robotics, in order to operate a humanoid robot, it is necessary to generate motions that have strictly dynamic consistency. Furthermore, human-like motion for robots will bring advantages such as energy optimization. This paper presents a mechanism to generate two human-like motions, walking and kicking, for a biped robot using a simple model based on observation and analysis of human motion. Our ultimate goal is to establish a design principle of a controller in order to achieve natural human-like motions. The approach presented here rests on the principle that in most biological motor learning scenarios some form of optimization with respect to a physical criterion is taking place. In a similar way, the equations of motion for the humanoid robot systems are formulated in such a way that the resulting optimization problems can be solved reliably and efficiently. The simulation results show that faster and more accurate searching can be achieved to generate an efficient human-like gait. Comparison is made with methods that do not include observation of human gait. The gait has been successfully used to control Robo-Erectus, a soccer-playing humanoid robot, which is one of the foremost leading soccer-playing humanoid robots in the RoboCup Humanoid League. [Copyright &y& Elsevier]

Abstract: In this paper, we address the challenging task of finding the best alignment between two 3D objects by solving a global optimization problem in the space of rotations SO(3). The objective function to be optimized is a newly developed rotation-variant similarity measure, which is obtained directly from the object''s geometry and is entirely implemented on the GPU. By exploiting the modern GPU''s parallel architecture, we can process considerably greater amounts of data than a CPU implementation can do in the same amount of time. This allows us to create a similarity measure which combines speed and accuracy. The actual problem of rotation alignment is then solved by finding the global maximum of this similarity function in the space of rotations. A special rotation representation allows for an efficient local optimization on the manifold SO(3). Furthermore, unwanted local maxima can be avoided by a heuristic global optimization procedure which exploits rotational symmetry. Due to this common sense heuristics, the global search can be gradually reduced to a lower-dimensional problem up to a 1D line search to handle objects with high rotational symmetry. We show that our method is superior to existing normalization techniques such as PCA and provides a high degree of precision despite remarkably short runtimes. [Copyright &y& Elsevier]

Abstract: Analyzing the state of the art in a given field in order to tackle a new problem is always a mandatory task. Literature provides surveys based on summaries of previous studies, which are often based on theoretical descriptions of the methods. An engineer, however, requires some evidence from experimental evaluations in order to make the appropriate decision when selecting a technique for a problem. This is what we have done in this paper: experimentally analyzed a set of representative state-of-the-art techniques in the problem we are dealing with, namely, the road passenger transportation problem. This is an optimization problem in which drivers should be assigned to transport services, fulfilling some constraints and minimizing some function cost. The experimental results have provided us with good knowledge of the properties of several methods, such as modeling expressiveness, anytime behavior, computational time, memory requirements, parameters, and free downloadable tools. Based on our experience, we are able to choose a technique to solve our problem. We hope that this analysis is also helpful for other engineers facing a similar problem. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a new filter line search SQP method in which the violations of equality and inequality constraints are considered separately. Thus the filter in our algorithm is composed by three components: objective function value, equality and inequality constraints violations. The filter with three components accepts reasonable steps flexibly, comparing that with two components. The new filter shares some features with the Chin and Fletcher''s approach, namely the “slanting envelope” and the “inclusion property”. Under mild conditions, the filter line search SQP method is proven to be globally convergent. Numerical experiments also show the efficiency of our method. [Copyright &y& Elsevier]

Abstract: In this paper, we use the third order shear deformation theory of Reddy [Reddy JN. Mechanics of laminated composite plates and shells. CRC Press; 2004] with a meshless numerical method to analyze the static deformation of composite plates and shells. Numerical results are compared with Navier solutions in various examples. The meshless collocation method based on radial basis functions requires a user-defined shape parameter than can compromise the quality of the solution when poorly chosen. To improve the choice of this shape parameter, we apply an optimization technique based on the leave-one-out cross validation analysis to obtain the shape parameter in a given interval. The results obtained were significantly better than those produced with a user-defined shape parameter. [Copyright &y& Elsevier]

Abstract: This paper aims to show the use of the response surface methodology (RSM) in size optimization of an autonomous PV/wind integrated hybrid energy system with battery storage. RSM is a collection of statistical and mathematical methods which relies on optimization of response surface with design parameters. In this study, the response surface, output performance measure, is the hybrid system cost, and the design parameters are the PV size, wind turbine rotor swept area and the battery capacity. The case study is realized in ARENA 10.0, a commercial simulation software, for satisfaction of electricity consumption of the global system for mobile communications (GSM) base station at Izmir Institute of Technology Campus Area, Urla, Turkey. As a result, the optimum PV area, wind turbine rotor swept area, and battery capacity are obtained to be 3.95m2, 29.4m2, 31.92kWh, respectively. These results led to $37,033.9 hybrid energy system cost, including auxiliary energy cost. The optimum result obtained by RSM is confirmed using loss of load probability (LLP) and autonomy analysis. [Copyright &y& Elsevier]

Abstract: Optimization design is the most important key technique of Air-breathing Hypersonic Cruise Vehicle (HCV). To improve the design level and get better integrated performances of HCV, this paper researches the integrated optimization design method of waverider hypersonic cruise vehicle. In the optimization design, Multi-Objective Genetic Algorithms (MOGA) is selected as the optimization algorithm, and the shape parameters of aircraft are as design variables. Some performances, such as aerodynamics, aeroheating, radar cross section (RCS), airframe/scramjet integration, and volume of airframe, trimmed characteristic, static stability and maneuverability at cruise phase are selected as the objectives. When the optimization process finishes, the Pareto front side is got, in which many Pareto solutions whose integrated performances are more excellent than basic configuration are found. According to the design idea, we choose a Pareto solution from the Pareto front side as the recommended shape configuration for further research. To validate the aerodynamics of recommended configuration, wind tunnel test is done. And the comparison results show that the optimization design is successful. [Copyright &y& Elsevier]

Abstract: Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly non-linear, mixed integer optimization problems that are typical of complex engineering systems. PSO technique is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. Since the two approaches are supposed to find a solution to a given objective function but employ different strategies and computational effort, it is appropriate to compare their performance. This paper presents the application and performance comparison of PSO and GA optimization techniques, for flexible ac transmission system (FACTS)-based controller design. The design objective is to enhance the power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem and both PSO and GA optimization techniques are employed to search for optimal controller parameters. The performance of both optimization techniques in terms of computational effort, computational time and convergence rate is compared. Further, the optimized controllers are tested on a weakly connected power system subjected to different disturbances over a wide range of loading conditions and parameter variations and their performance is compared with the conventional power system stabilizer (CPSS). The eigenvalue analysis and non-linear simulation results are presented and compared to show the effectiveness of both the techniques in designing a FACTS-based controller, to enhance power system stability. [Copyright &y& Elsevier]

Abstract: In recent years, heuristic algorithms such as simulated annealing, genetic and ant colony algorithms have found many applications in optimization problems. In this paper, ant colony systems (ACSs) are used to optimize the process of finding the collapse load factor of two-dimensional frames. Three variants of ACS algorithms are developed and their relative performances are compared. It is observed that if an ACS is finely tuned and its parameters are carefully adjusted, satisfactory results can be obtained. [Copyright &y& Elsevier]

Abstract: Applications for on-line data reconciliation and optimization must be efficient and numerically robust. The models in these applications are rarely changed and the same optimization problem is solved thousands of times with only minor changes in the parameters. This paper describes a suitable modeling framework for this type of applications that, with the aim of simplifying the creation of new models, makes the application robust and avoids numerical difficulties. The model is based on a unit model structure where first-order derivatives, scaling and initial values are properties of the unit model. A new scaling procedure is proposed based on equation and variable pairing. The modeling framework and the use of the proposed scaling procedure are demonstrated in two case studies, case 1 is simulation of a simple pipe model, case 2 is simulation, data reconciliation and optimization of a flash process. [Copyright &y& Elsevier]

Abstract: Multi-parametric model-based control (mp-MPC) is a control method that is widely acknowledged for its ability to solve the on-line optimisation problem, involved in traditional MPC, off-line via parametric optimisation. Its main advantage is that it obtains the control actions as explicit functions of the plant measurements. This allows for the control actions to be obtained on-line via simple function evaluations instead of solving repetitively a computationally demanding on-line optimisation. This allows mp-MPC to be implemented on the simplest, low-cost hardware. In this paper we report on recent developments on industrial and experimental applications of mp-MPC, where the ability of mp-MPC to be applied on systems with fast dynamics and sampling times is demonstrated, which maybe prohibitive for traditional MPC that relies on on-line optimisation methods. [Copyright &y& Elsevier]

Abstract: An improved particle swarm optimization (IPSO) is proposed in this paper. In the new algorithm, a population of points sampled randomly from the feasible space. Then the population is partitioned into several sub-swarms, each of which is made to evolve based on particle swarm optimization (PSO) algorithm. At periodic stages in the evolution, the entire population is shuffled, and then points are reassigned to sub-swarms to ensure information sharing. This method greatly elevates the ability of exploration and exploitation. Simulations for three benchmark test functions show that IPSO possesses better ability to find the global optimum than that of the standard PSO algorithm. Compared with PSO, IPSO is also applied to identify the hydrologic model. The results show that IPSO remarkably improves the calculation accuracy and is an effective global optimization to calibrate hydrologic model. [Copyright &y& Elsevier]

Abstract: In this paper, we study the positive almost periodic solutions for a class of almost periodic Lotka-Volterra type system with delays and feedback controls. Applying Schauder’s fixed point theorem, a criterion on the existence of the positive almost periodic solution of the system is obtained. Our new criterion, which improves and generalizes some well known results, can be easily checked. [Copyright &y& Elsevier]

Abstract: This paper presents a general multiperiod optimization model, which simultaneously solves the design and planning decisions in multiproduct batch plants. Therefore, the trade-offs between both problems are taken into account as well as variations due to seasonal effects, demand patterns, etc. From the design point of view, the model is formulated considering batch and semicontinuous units, the allocation of intermediate storage, and structural decisions. Following the usual procurement policy, equipment is provided using discrete sizes. From the planning point of view, the formulation takes into account both products and raw materials inventories, product demands and raw materials supplies that vary seasonally in a multiperiod approach. The objective is the maximization of an economic function, which considers incomes, and both investment and operation costs. A plant that produces five oleoresins in seven stages is used to illustrate this approach. [Copyright &y& Elsevier]

Abstract: Packing and decomposition of combinatorial objects such as graphs, digraphs, and hypergraphs by smaller objects are central problems in combinatorics and combinatorial optimization. Their study combines probabilistic, combinatorial, and algebraic methods. In addition to being among the most fascinating purely combinatorial problems, they are often motivated by algorithmic applications. There is a considerable number of intriguing fundamental problems and results in this area, and the goal of this paper is to survey the state-of-the-art. [Copyright &y& Elsevier]

Abstract: Particle swarm optimization (PSO) has gained increasing attention in tackling complex optimization problems. Its further superiority when hybridized with other search techniques is also shown. Chaos, with the properties of ergodicity and stochasticity, is definitely a good candidate, but currently only the well-known logistic map is prevalently used. In this paper, the performance and deficiencies of schemes coupling chaotic search into PSO are analyzed. Then, the piecewise linear chaotic map (PWLCM) is introduced to perform the chaotic search. An improved PSO algorithm combined with PWLCM (PWLCPSO) is proposed subsequently, and experimental results verify its great superiority. [Copyright &y& Elsevier]

Abstract: In this paper, the well-known Ekeland variational principle is generalized to the case where set-valued mappings are involved. More specifically, the -efficient points of a vector optimization problem for set-valued mappings are investigated via a vector Ekeland variational principle for set-valued mappings. [Copyright &y& Elsevier]

Abstract: Torczon and several persons have designed pattern search methods for unconstrained optimization problem, bound constrained, and linearly constrained optimization problems. In this paper, we shall consider linear equality constrained problems as unconstrained ones using generalized pattern search algorithm, except for a feasible starting point. [Copyright &y& Elsevier]

Abstract: The optimal design of digital systems can be complicated by non-linearities that arise from discrete optimization processes, and conventional methods often attain suboptimal results. Quantum computing may be an interesting technology to overcome that issue, but so far its effectiveness has been addressed from a most abstract perspective. This paper tackles the digital-design problem from a practical viewpoint, and derives universal criteria for assessing whether, and how much, quantum technologies can improve over conventional methods: the advantage is expressed in terms of computing time required to attain optimal design. The general framework is applied to two modern problems, i.e., training support vector machines and building vector quantizers. The experimental comparison between conventional and quantum methods addresses the actual performances of the designed systems in the case of vector quantization. Empirical evidence matches theoretical expectations and supports the design method’s consistency. [Copyright &y& Elsevier]

Abstract: In this paper we present a novel method for the numerical solution of dynamic optimization problems. After obtaining a first solution at a coarse resolution of the control profiles with a direct sequential approach, the structure of the control profiles is analyzed for possible switching times and arcs. Subsequently, the problem is reformulated automatically and solved as a multi-stage problem, with each stage corresponding to a potential arc. Order and resolution of the control parameterization are adapted to the type of the particular arc. By means of some case studies we show that accurate solutions with only few degrees of freedom can be obtained. [Copyright &y& Elsevier]

Abstract: This paper investigates a group of computing schemas for joint economic lot size as fuzzy values of the economic lot size model for purchaser and vendor. We express the fuzzy order quantity/production lot size for the purchaser/vendor as the normal triangular fuzzy number (q 1, q 0, q 2) and then we solve the aforementioned optimization problem under the condition 0 < q 1 < q 0 < q 2. We find that, after defuzzification, the joint total relevant cost is slightly higher than in the crisp model. [Copyright &y& Elsevier]

Abstract: This paper considers the mixed sensitivity optimization problem for a class of infinite-dimensional stable plants. This problem is reducible to a two- or one-block control problem with structured weighting functions. We first show that these weighting functions violate the genericity assumptions of existing Hamiltonian-based solutions such as the well-known Zhou–Khargonekar formula. Then, we derive a new closed form formula for the computation of the optimal performance level, when the underlying plant structure is specified by a pseudorational transfer function. [Copyright &y& Elsevier]

Abstract: We consider a multiserver retrial queueing model with applications in service industries, in which customers arrive according to a Markovian arrival process (MAP). Any admitted customer either [(a)] gets service and leaves the system as a satisfied primary customer; or [(b)] gets service and becomes a secondary customer. The secondary customers leave the system either as satisfied or unsatisfied with their services. In this paper, we perform the steady state analysis of the model and also study the algorithmic aspects of this queueing model including an optimization problem. [Copyright &y& Elsevier]

Abstract: In this paper, we present an algebraic sufficient condition for the existence of a selection of optimal solutions in a parametric optimization problem that are totally ordered, but not necessarily monotone. Based on this result, we present necessary and sufficient conditions that ensure the existence of totally ordered selections of minimum cuts for some classes of parametric maximum flow problems. These classes subsume the class studied by Arai et al. [Discrete Appl. Math. 41 (1993) 69–74] as a special case. [Copyright &y& Elsevier]

Abstract: Multi-agent System (MAS) can be used to dispose bounded optimization problems with dynamically changing resources because its autonomous distributed management model aspect is fitted to dealing with such external disturbances. One of the problems in multi-agent optimizations is that it is difficult to rigorously define the optimization criteria with respect to the global optimization in advance. Rather, it may depend much on more situated factors such as temporal availability of resources and coexistence of current conflicts, conflicts among what has been already scheduled and what is to be scheduled. In this paper, an organizational model called Garbage Can Model (GCM) is introduced. In GCM, through its three decision-making strategies and the fluidities of problems and resources, solutions made by an individual agent are concerned with several agents that are co-existing in the environment. The problems allocated to each agent are solved not only by an agent''s own efforts, but also by the change of problem solving status of other agents. Our simulation experiment shows that GCM is a preferred framework for multi-agent optimization problems in dealing with the above difficulties. [Copyright &y& Elsevier]

In this paper, we propose a novel objective penalty function for inequality constrained optimization problems. The objective penalty function differs from any existing penalty function and also has two desired features: exactness and smoothness if the constraints and objective function are differentiable. An exact penalty result is proved for the objective penalty function. In addition to these results, based on the objective penalty function, we develop an algorithm for solving the original problem and show its convergence under some mild conditions. [Copyright &y& Elsevier]