All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6

Displaying 101 – 113 of 113

Showing per page

The nonlinear complementarity model of industrial symbiosis network equilibrium problem

Shiqin Xu, Guoshan Liu, Wendai Lv, Yingmei Liu (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we propose an industrial symbiosis network equilibrium model by using nonlinear complementarity theory. The industrial symbiosis network consists of industrial producers, industrial consumers, industrial decomposers and demand markets, which imitates natural ecosystem by means of exchanging by-products and recycling useful materials exacted from wastes. The industrial producers and industrial consumers are assumed to be concerned with maximization of economic profits as well as minimization...

The periodic Vehicle routing problem: classification and heuristic

M. Mourgaya, F. Vanderbeck (2006)

RAIRO - Operations Research

Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical...

The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up

Kjetil K. Haugen, Asmund Olstad, Krystsina Bakhrankova, Erik Van Eikenhorst (2010)

Kybernetika

This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.

Traffic plans.

Marc Bernot, Vicent Caselles, Jean-Michel Morel (2005)

Publicacions Matemàtiques

In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...

Transportation flow problems with Radon measure variables

Marcus Wagner (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

For a multidimensional control problem ( P ) K involving controls u ∈ L ∞ , we construct a dual problem ( D ) K in which the variables ν to be paired with u are taken from the measure space rca (Ω,) instead of ( L ∞ ) * . For this purpose, we add to ( P ) K a Baire class restriction for the representatives of the controls u. As main results, we prove a strong duality theorem and saddle-point conditions.

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...

Un problema simple de decisión y un problema de espera.

Luis A. Santaló (1985)

Trabajos de Estadística e Investigación Operativa

El viaje de P a Q se puede hacer por diferentes líneas de autobuses que pasan por P según una ley de Poisson dada y tienen distintas velocidades. En esta nota analizamos la estrategia óptima para un pasajero que llega al azar a la parada P y desea trasladarse a Q en un tiempo mínimo. Al final (n.5) consideramos un problema de espera para autobuses que no siguen una distribución de Poisson.

Virtual reality & logistics.

Pehlivanis, Konstantinos, Papagianni, Maria, Styliadis, Athanasios (2004)

Acta Universitatis Apulensis. Mathematics - Informatics

Currently displaying 101 – 113 of 113

Previous Page 6