Displaying 881 – 900 of 1566

Showing per page

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

A. K. Ojha, Rashmi Ranjan Ota (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Optimization is an important tool widely used in formulation of the mathematical model and design of various decision making problems related to the science and engineering. Generally, the real world problems are occurring in the form of multi-criteria and multi-choice with certain constraints. There is no such single optimal solution exist which could optimize all the objective functions simultaneously. In this paper, ϵ-constraint method along with Karush−Kuhn−Tucker (KKT) condition has been used...

Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision-making

Guoshan Liu, Shiqin Xu (2012)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...

Multiperiod supply chain network equilibrium model with electronic commerce and multicriteria decision-making∗∗∗

Guoshan Liu, Shiqin Xu (2012)

RAIRO - Operations Research

In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...

Multiple routing strategies in a labelled network

J. Maublanc, D. Peyrton, A. Quilliot (2001)

RAIRO - Operations Research - Recherche Opérationnelle

We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.

Multiple Routing Strategies in a Labelled Network

J. Maublanc, D. Peyrton, A. Quilliot (2010)

RAIRO - Operations Research

We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.

Multistage interconnection networks in multiprocessor systems. A simulation study.

Víctor López de Buen (1987)

Qüestiió

The principal modelling and simulation features of multistage interconnection networks operating in packet switching are discussed in this paper. The networks studied interconnect processors and memory modules in multiprocessor systems. Several methods are included to increase the bandwidth achievable with this kind of networks. Besides using network buffering, the possibility of having queues of requests at the memory modules is considered. Network conflicts can be reduced using a second network...

Nanonetworks: The graph theory framework for modeling nanoscale systems

Jelena Živkovic, Bosiljka Tadic (2013)

Nanoscale Systems: Mathematical Modeling, Theory and Applications

Nanonetwork is defined as a mathematical model of nanosize objects with biological, physical and chemical attributes, which are interconnected within certain dynamical process. To demonstrate the potentials of this modeling approach for quantitative study of complexity at nanoscale, in this survey, we consider three kinds of nanonetworks: Genes of a yeast are connected by weighted links corresponding to their coexpression along the cell cycle; Gold nanoparticles, arranged on a substrate, are linked...

Nash equilibria for a model of traffic flow with several groups of drivers

Alberto Bressan, Ke Han (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are N groups of drivers, The i-th group consists of κi drivers, sharing the same departure and arrival costs ϕi(t),ψi(t). For any given population sizes κ1,...,κn, we prove the existence of a Nash equilibrium solution, where no driver can lower his own total cost by choosing a different departure...

New algorithms for coupled tasks scheduling – a survey

Jacek Blazewicz, Grzegorz Pawlak, Michal Tanas, Wojciech Wojciechowicz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various variants of...

Currently displaying 881 – 900 of 1566