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 4

Displaying 61 – 70 of 70

Showing per page

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...

Trivial Cases for the Kantorovitch Problem

Serge Dubuc, Issa Kagabo, Patrice Marcotte (2010)

RAIRO - Operations Research

Let X and Y be two compact spaces endowed with respective measures μ and ν satisfying the condition µ(X) = v(Y). Let c be a continuous function on the product space X x Y. The mass transfer problem consists in determining a measure ξ on X x Y whose marginals coincide with μ and ν, and such that the total cost ∫ ∫ c(x,y)dξ(x,y) be minimized. We first show that if the cost function c is decomposable, i.e., can be represented as the sum of two continuous functions defined on X and Y, respectively,...

Une nouvelle méthode d'initialisation pour le problème de transport

François Dubeau, Oumar Mandione Guèye (2008)

RAIRO - Operations Research

Dans cet article nous proposons une nouvelle méthode d'initialisation du problème de transport classique. Cette méthode est basée sur le principe d'une affectation seulement si nécessaire. Elle donne de bons résultats et souvent la solution optimale.

Currently displaying 61 – 70 of 70

Previous Page 4