Search results for "Machine"
showing 10 items of 2592 documents
A hierarchic approach to production planning and scheduling of a flexible manufacturing system
1999
Abstract The paper deals with the problem of improving the machine utilization of a flexible manufacturing cell. Limited tool magazine space of the machines turns out to be a relevant bottleneck. A hierarchic approach for this problem is proposed. At the upper level, sets of parts that can be concurrently processed (batches) are determined. At the lower levels, batches are sequenced, linked, and scheduled. Methods taken from the literature are used for the solution of the latter subproblems, and an original mixed integer programming model is formulated to determine batches. The proposed methods are discussed on the basis of computational experience carried out on real instances.
Using box indices in supporting comparison in multiobjective optimization
2009
Because of the conflicting nature of criteria or objectives, solving a multiobjective optimization problem typically requires interaction with a decision maker who can specify preference information related to the objectives in the problem in question. Due to the difficulties of dealing with multiple objectives, the way information is presented plays a very important role. Questions posed to the decision maker must be simple enough and information shown must be easy to understand. For this purpose, visualization and graphical representations can be useful and constitute one of the main tools used in the literature. In this paper, we propose to use box indices to represent information relate…
Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks
2016
The contribution of this study is twofold: First, we show that we can predict the performance of Iterated Local Search (ILS) in different landscapes with the help of Local Optima Networks (LONs) with escape edges. As a predictor, we use the PageRank Centrality of the global optimum. Escape edges can be extracted with lower effort than the edges used in a previous study. Second, we show that the PageRank vector of a LON can be used to predict the solution quality (average fitness) achievable by ILS in different landscapes.
Kernelizing LSPE(λ)
2007
We propose the use of kernel-based methods as underlying function approximator in the least-squares based policy evaluation framework of LSPE(λ) and LSTD(λ). In particular we present the 'kernelization' of model-free LSPE(λ). The 'kernelization' is computationally made possible by using the subset of regressors approximation, which approximates the kernel using a vastly reduced number of basis functions. The core of our proposed solution is an efficient recursive implementation with automatic supervised selection of the relevant basis functions. The LSPE method is well-suited for optimistic policy iteration and can thus be used in the context of online reinforcement learning. We use the hig…
Unbiased Branches: An Open Problem
2007
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 in…
Least-Norm Regularization For Weak Two-Level Optimization Problems
1992
In this paper, we consider a regularization for weak two-level optimization problems by adaptation of the method presented by Solohovic (1970). Existence and approximation results are given in the case in which the constraints to the lower level problems are described by a multifunction. Convergence results for the least-norm regularization under perturbations are also presented.
Design of a Permanent Magnet Synchronous Generator using Interactive Multiobjective Optimization
2017
We consider an analytical model of a permanent magnet synchronous generator and formulate a mixed-integer constrained multiobjective optimization problem with six objective functions. We demonstrate the usefulness of solving such a problem by applying an interactive multiobjective optimization method called NIMBUS. In the NIMBUS method, a decision is iteratively involved in the optimization process and directs the solution process in order to find her/his most preferred Pareto optimal solution for the problem. We also employ a commonly used noninteractive evolutionary multiobjective optimization method NSGA-II to generate a set of solutions that approximates the Pareto set and demonstrate t…
TOWARD A SOLUTION OF ALLOCATION IN LIFE CYCLE INVENTORIES: THE USE OF LEAST SQUARES TECHNIQUES
2010
Purpose: The matrix method for the solution of the so-called inventory problem in LCA generally determines the inventory vector related to a specific system of processes by solving a system of linear equations. The paper proposes a new approach to deal with systems characterized by a rectangular (and thus non-invertible) coefficients matrix. The approach, based on the application of regression techniques, allows solving the system without using computational expedients such as the allocation procedure. Methods: The regression techniques used in the paper are (besides the ordinary least squares, OLS) total least squares (TLS) and data least squares (DLS). In this paper, the authors present t…
Online Metric Learning Methods Using Soft Margins and Least Squares Formulations
2012
Online metric learning using margin maximization has been introduced as a way to learn appropriate dissimilarity measures in an efficient way when information as pairs of examples is given to the learning system in a progressive way. These schemes have several practical advantages with regard to global ones in which a training set needs to be processed. On the other hand, they may suffer from a poor performance depending on the quality of the examples and the particular tuning or other implementation details. This paper formulates several online metric learning alternatives using a passive-aggressive schema. A new formulation of the online problem using least squares is also introduced. The…
Improvement of Statistical Decisions under Parametric Uncertainty
2011
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncertainty. Decision‐making under uncertainty is a central problem in statistical inference, and has been formally studied in virtually all approaches to inference. The aim of the present paper is to show how the invariant embedding technique, the idea of which belongs to the authors, may be employed in the particular case of finding the improved statistical decisions under parametric uncertainty. This technique represents a simple and computationally attractive statistical method based on the constructive use of the i…