نتایج جستجو برای: dynamic cell formation problem scenariobased robust optimization mixed

تعداد نتایج: 3729968  

Journal: :Automatica 2016
Xinmiao Sun Christos G. Cassandras

We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem (MINLP). For the class of opt...

Hamed Farrokhi-Asl Masoud Rabbani Mohammad Ravanbakhsh

Machines are a key element in the production system and their failure causes irreparable effects in terms of cost and time. In this paper, a new multi-objective mathematical model for dynamic cellular manufacturing system (DCMS) is provided with consideration of machine reliability and alternative process routes. In this dynamic model, we attempt to resolve the problem of integrated family (par...

Hejazi, Reza, Karimi, Ehsan , Khoshalhan, Farid ,

  In this paper a new nonlinear integer programming model is presented for dynamic cell formation problem (DCF) in cellular manufacturing system (CMS). idea “higher material flow in shorter distance” for formation of cells is introduced. Since the linearized model is NP-hard, a novel approach called local search embeded branch and cut (LSEBC) is introduced. Computational results show the effici...

2012
Tao Yao

This report documents the development of several transportation optimization models under uncertainty. First, a robust evacuation transportation planning model for freeway traffic systems was developed, in which demand is uncertain. The study results provide preliminary evidence that routing traffic using such a robust, optimization-based model can improve the average objective performance. Nex...

Open-Pit Production Scheduling (OPPS) problem focuses on determining a block sequencing and scheduling to maximize Net Present Value (NPV) of the venture under constraints. The scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. In order to deal with the OPPS uncertainties, various approaches can be recommended. Robust opti...

ژورنال: کنترل 2022

 In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...

Mohammad Mehrabad, Saeed Arani

This paper addresses to the Cell Formation Problem (CFP) in which Automated Guided Vehicles (AGVs) have been employed to transfer the jobs which may need to visit one or more cells. Because of added constraints to problem such as AGVs’ conflict and excessive cessation on one place, it is possible that AGVs select the different paths from one cell to another over the time. This means that the ti...

2005
Antonio Flores-Tlacuahuac Lorenz T. Biegler

In this work, we propose a new algorithm for addressing the simultaneous design and control problem through the robust and efficient solution of a Mixed-Integer Dynamic Optimization (MIDO) problem. The algorithm is based on the transformation of the MIDO problem into a Mixed-Integer Nonlinear Programming (MINLP) program through the discretization of the MIDO problem. In this approach both the m...

Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید