Axe 2 : Aide à la décision prise dans les systèmes complexes

Retour

Cahiers du GERAD

1401 résultats — page 59 de 71

One of the many problems faced by rail transportation companies is to optimize the utilization of the available stock of locomotives and cars. In this paper...

référence BibTeX
, et

The aim of this paper is to present a survey of recent optimization models for the most commonly studied rail transportation problems. For each group of pro...

référence BibTeX
, et

In the last 15 years, considerable efforts have been placed on integrating product and process design. This integration can improve product quality, reduce...

référence BibTeX
, et

An FMS environment requires a flexible and adaptable material handling system. Automated guided vehicles (AGV) provide such a system. One of the component...

référence BibTeX
et

The paper is concerned with conflict and coordination in a two-member channel of distribution. We propose a differential game model that includes carry-ove...

référence BibTeX
, , et

If it is assumed that the final product of bromination of C<sub>60</sub> will obey two rules, (i) that no two <i>sp</i><sup>3</sup> carbons may be adjacent,...

référence BibTeX
, , , , , et

This paper describes a decision support system based on a sophisticated mixed integer linear programming model, EUGENE, developed to help the regional decis...

référence BibTeX
, , et

Column generation is often used to solve large scale optimization problems, and much research has been devoted to improve the convergence of the solution pr...

référence BibTeX
, et

We consider a monopolist firm that plans its production, inventory, and pricing policy over a fixed and finite horizon. The problem is represented by an opt...

référence BibTeX
, et

The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...

référence BibTeX

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

référence BibTeX
, et

Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...

référence BibTeX

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...

référence BibTeX
, et

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

référence BibTeX
, et

We describe a method of channel assignment for cellular telephone systems (in which a limited number of rearrangements are allowed) that gives good performa...

référence BibTeX
et

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

référence BibTeX
et

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

référence BibTeX
, , et

This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...

référence BibTeX

The locomotive assignment problem is to provide at minimum cost sufficient motive power to pull all the trains of a time tabled schedule. Optimization metho...

référence BibTeX
, , , et

Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...

référence BibTeX