نتایج جستجو برای: routing and lateness penalties a mixed

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

2016
Ana Maria A.C. Rocha M. Fernanda P. Costa

A penalty framework for globally solving mixed-integer nonlinear programming problems is presented. Both integrality constraints and nonlinear constraints are handled separately by hyperbolic tangent penalty functions. The preliminary numerical experiments show that the proposed penalty approach is effective and the hyperbolic tangent penalties compete with other popular penalties.

Journal: :journal of advances in computer research 0
reza fotohi department of computer engineering, germi branch, islamic azad university, germi, iran roodabe heydari department of computer engineering, germi branch, islamic azad university, germi, iran shahram jamali department of computer engineering, mohaghegh ardabili university, ardabil, iran

mobile-ad-hoc-networks (manets) are self-configuring networks of mobile nodes, which communicate through wireless links. the infrastructure of a mobile ad hoc network (manet) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. the main issues in manets include the mobility of the network nodes, the scarcity of computati...

Journal: :Algorithms 2021

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness Lmax for integer due dates to problem, where along precedence constraints given on set V={v1,v2, …,vn} of multiprocessor a subset tasks must be processed simultaneously. Contrary classical shop-scheduling several processors fulfill task. Furthermore, two types may task V. We p...

B. Shirazi, I. Mahdavi, M. Jannatipour,

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...

Journal: :IEEE Trans. Automat. Contr. 2002
Giancarlo Ferrari-Trecate Domenico Mignone Manfred Morari

We propose a state smoothing algorithm for hybrid systems based on Moving Horizon Estimation (MHE) by exploiting the equivalence between hybrid systems modeled in the Mixed Logic Dynamical form and piecewise affine systems. We provide sufficient conditions on the time horizon and the penalties on the state at the beginning of the estimation horizon to guarantee asymptotic convergence of the MHE...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده ادبیات و علوم انسانی 1391

the purpose of this two-phase, sequential mixed methods study was to find out whether there were any decencies between male and female ma students’ theses regarding the common features of academic writing such as syntactic complexity, means of integrating cited information, and organizing arguments. i chose 10 male written theses and 15 female written theses in tefl and linguistics. in the firs...

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

Journal: :international journal of industrial mathematics 2014
b. vahdani sh. sadigh behzadi

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

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

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