Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1412 results — page 65 of 71
This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...
BibTeX reference
This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...
BibTeX reference
This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...
BibTeX referenceA New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling
In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...
BibTeX reference
In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...
BibTeX reference
It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...
BibTeX reference
In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...
BibTeX reference
This paper propose a column generation method for optimally solving the rostering problem. Various strategies for accelerating the column generation process...
BibTeX reference
We consider the problem of defining a fair sharing of the total advantages gained by two regions (players) which decide to coordinate their environmental po...
BibTeX reference
The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...
BibTeX reference
In operations planning in an open pit mine an economic blocks model is generally used which attempts to determine which blocks will be extracted during each...
BibTeX reference
Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...
BibTeX reference
The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...
BibTeX reference
We consider a price setting duopoly producing differentiated goods, where the players can learn by doing and from each other. The unit production cost is mo...
BibTeX reference
We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...
BibTeX reference
We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...
BibTeX reference
This paper deals with the modeling of economy-environment interactions for several countries which are assumed to behave competitively for the control of th...
BibTeX reference
The stochastic linear programming problem with recourse has a dual block angular structure. It can thus be handled by Benders decomposition or by Kelley's m...
BibTeX reference
This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...
BibTeX reference
We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...
BibTeX reference