Cell Formation (CF) is the initial step in the configuration of cell assembling frameworks. This paper proposes a new mathematical model for the CF problem considering aspects of production planning, namely inventory, backorder, and subcontracting. In this paper, for the first time, backorder is considered in cell formation problem. The main objective is to minimize the total fixed and variable...

In this contribution, a novel approach for the modeling and optimization of discrete-continuous dynamic systems based on a disjunctive problem formulation is proposed. It will be shown that a disjunctive model representation, which constitutes an alternative to mixed-integer model formulations, provides a very flexible and intuitive way to formulate discrete-continuous dynamic optimization prob...

Abstract The formulation of a discrete-time anti-windup scheme for linear systems with constrained control signals is extended to the sampled-data case. Thus, the control of a continuous-time linear plant via a discrete linear nominal controller and a discrete anti-windup compensator is considered. Stability of the antiwindup compensator is equivalent to the known discrete problem while a hybri...

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...

In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...

The accurate estimation of optical flow is a challenging task, which is often posed as an energy minimization problem. Most topperforming methods approach this using continuous optimization algorithms. In many cases, the employed models are assumed to be convex to ensure tractability of the optimization problem. This is in contrast to the related problem of narrow-baseline stereo matching, wher...

Discrete-event simulation optimization is a problem of significant interest to practitioners interested in extracting useful information about an actual (or yet to be designed) system that can be modeled using discrete-event simulation. This paper presents a brief survey of the literature on discrete-event simulation optimization over the past decade (1988 to the present). Swisher et al. (2000)...

1. Abstract In structural sizing optimization problems the aim is to minimize an objective function under certain constraints. The design variables of the optimization problem are generally discrete and belong to certain discrete sets. In the context of the present work the design set is implemented and efficiently treated as a database that contains the required geometric properties for all de...

We discuss trajectory optimization for hybrid systems with a natural, hierarchical separation of discrete and continuous dynamics. The trajectory optimization problem considered requires that a discrete state sequence and a continuous state trajectory must be both determined to minimize a single cost function, such that the discrete state sequence also solves a symbolic planning problem. We mod...

—In order to solve discrete optimization problems, this paper proposed a discrete bacterial foraging algorithm (DBFA) based on the idea of bacterial foraging optimization (BFO). The proposed DBFA applies binary encoding, and thus has the advantages of solving both discrete and continuous optimization problems. Also, according to sharing experiences of bacterium, we use the rotation step to upd...