Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 49 of 69
This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...
BibTeX reference
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...
BibTeX reference
The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....
BibTeX reference
The fleet management problem discussed in this paper consists in assigning the best routes to a set of vehicles in an underground mine haulage network. The h...
BibTeX reference
This paper presents two solution approaches for taking into account the displacement mode (forward or in reverse) of vehicles during the solution of the shor...
BibTeX referencePublic Transit
This paper reviews state-of-the-art models and approaches for solving a wide variety of public transit problems encountered at the strategic, tactical, and...
BibTeX reference
The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...
BibTeX reference
In order to achieve a successful implementation of electronic commerce (EC), it is necessary to "re-engineer" the logistics activities of the enterprise. Thi...
BibTeX reference
Ce document présente une revue de littérature sur la logistique inverse. Dans la littérature, plusieurs termes sont utilisés comme des synonymes, par exemple...
BibTeX reference
The paper addresses the problem of determining a retailer's optimal price promotions of two brands in a product category. A dynamic model is constructed, tak...
BibTeX reference
This paper deals with time-consistency and agreeability, two dynamic individual rationality concepts, in special linear-quadratic differential games. Condi...
BibTeX reference
Bimatrix and polymatrix games are expressed as parametric linear 0-1 programs. This leads to an algorithm for complete enumeration of their extreme equilibri...
BibTeX reference
We propose a numerical approach to compute stationary Markov perfect Nash equilibrium advertising strategies of Lanchester model. The algorithm can be implem...
BibTeX reference
A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...
BibTeX reference
Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus...
BibTeX reference
This paper deals with the issue of shelf-space allocation and advertising decisions in marketing channels. We consider a network composed of a unique retaile...
BibTeX referenceThe Minimum Diameter Octagon with Unit-Length Sides: Vincze's Wife's Octagon is Suboptimal
This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...
BibTeX reference
In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...
BibTeX reference
This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...
BibTeX reference
Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...
BibTeX reference