Search results for "Mathematica"
showing 10 items of 7971 documents
Adaptation, coordination, and local interactions via distributed approachability
2017
This paper investigates the relation between cooperation, competition, and local interactions in large distributed multi-agent\ud systems. The main contribution is the game-theoretic problem formulation and solution approach based on the new framework\ud of distributed approachability, and the study of the convergence properties of the resulting game model. Approachability\ud theory is the theory of two-player repeated games with vector payoffs, and distributed approachability is here presented for\ud the first time as an extension to the case where we have a team of agents cooperating against a team of adversaries under local\ud information and interaction structure. The game model turns i…
Surface Characteristics of Machined Polystyrene with 3D Printed Thermoplastic Tool
2020
An effort is made in this work to appraise the surface characteristics of machined expandable polystyrene (EPS) with a novel 3D printed thermoplastic acrylonitrile-butadiene-styrene (ABS) tool. Linear grooves on EPS were made on a vertical milling machine that was modified to conduct experiments in the laboratory. The tests were designed as per the Taguchi L9 based factorial design of experimentation while varying process parameters such as depth of cut, spindle speed, and feed rate. The machining responses dimensional accuracy and surface roughness of the machined grooves were studied. Furthermore, the surface topography of the machined specimens was considered to investigate the mechanism…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
Mathematical models for a cutting problem in the glass manufacturing industry
2021
Abstract The glass cutting problem proposed for the ROADEF 2018 challenge is a two-dimensional, three-stage guillotine cutting process, with an additional cut to obtain pieces in some specific situations. However, it is not a standard problem because it includes specific constraints. The sheets produced in the glass manufacturing process have defects that make them different and have to be used in order. The pieces to be cut are grouped into subsets and the pieces from each subset must be cut in order. We approach the problem by developing and solving integer linear models. We start with the basic model, which includes the essential features of the problem, as a classical three-stage cuttin…
Sampled Fictitious Play on Networks
2019
We formulate and solve the problem of optimizing the structure of an information propagation network between multiple agents. In a given space of interests (e.g., information on certain targets), each agent is defined by a vector of their desirable information, called filter, and a vector of available information, called source. The agents seek to build a directed network that maximizes the value of the desirable source-information that reaches each agent having been filtered en route, less the expense that each agent incurs in filtering any information of no interest to them. We frame this optimization problem as a game of common interest, where the Nash equilibria can be attained as limit…
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
2021
Abstract The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle’s capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. …
Meta-heuristic Algorithms for Nesting Problem of Rectangular Pieces
2017
Abstract Nesting problems consist of placing multiple items onto larger shapes finding a good arrangement. The goal of the nesting process is to minimize the waste of material. It is common to assume, as in the present work, that the stock sheet has fixed width and infinite height, since in the real world a company may have to cut pieces from a roll of material. The complexity of such problems is often faced with a two-stage approach, so-called “hybrid algorithm”, combining a placement routine and a meta-heuristic algorithm. Starting from a given positioning sequence, the placement routine generates a non-overlapping configuration. The encoded solution is manipulated and modified by the met…
Forecasting portfolio returns using weighted fuzzy time series methods
2016
We propose using weighted fuzzy time series (FTS) methods to forecast the future performance of returns on portfolios. We model the uncertain parameters of the fuzzy portfolio selection models using a possibilistic interval-valued mean approach, and approximate the uncertain future return on a given portfolio by means of a trapezoidal fuzzy number. Introducing some modifications into the classical models of fuzzy time series, based on weighted operators, enables us to generate trapezoidal numbers as forecasts of the future performance of the portfolio returns. This fuzzy forecast makes it possible to approximate both the expected return and the risk of the investment through the value and a…
Optimal control of discrete-time interval type-2 fuzzy-model-based systems with D-stability constraint and control saturation
2016
This paper investigates the optimal control problem for discrete-time interval type-2 (IT2) fuzzy systems with pole constraints. An IT2 fuzzy controller is characterized by two predefined functions, and the membership functions and the premise rules of the IT2 fuzzy controller can be chosen freely. The pole assignment is considered, which is constrained in a presented disk region. Based on Lyapunov stability theory, sufficient conditions of asymptotic stability with an H ∞ performance are obtained for the discrete-time IT2 fuzzy model based (FMB) system. Based on the criterion, the desired IT2 state-feedback controller is designed to guarantee that the closed-loop system is asymptotically s…
Modeling and control of uncertain nonlinear systems
2018
A survey of the methodologies associated with the modeling and control of uncertain nonlinear systems has been given due importance in this paper. The basic criteria that highlights the work is relied on the various patterns of techniques incorporated for the solutions of fuzzy equations that corresponds to fuzzy controllability subject. The solutions which are generated by these equations are considered to be the controllers. Currently, numerical techniques have come out as superior techniques in order to solve these types of problems. The implementation of neural networks technique is contributed in the complex way of dealing the appropriate coefficients and solutions of the fuzzy systems.