The single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solv...

This paper presents some preliminary results from an ongoing study of the impact of various operating scenarios on the construction and quality of reoutes in...

In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construc...

In some universities, complete course schedules are made available to students at the time of registration. Typically these schedules give the room number, ...

The aim of this paper is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e. the multiple travelling salesman proble...

This paper describes algorithmic approaches for dealing with fuzziness in some highly structured combinatorial problems. A general framework is described an...

Some earlier results on k-star constraints and comb inequalities are generalized.

This paper deals with a modified version of the Lancaster model of capitalism, where it is assumed that there is a cost jointly beared by the two groups of p...

L'objectif de l'étude est d'évaluer l'impact sur les choix résidentiels de certains changements structurels tels les modifications dans la composition de la ...

This paper deals with a class of large-scale stochastic control problems typically associated with the maintenance of complex systems. For these systems the...

Solutions to the oligopolistic equilibrium problem have been obtained under a variety of concavity and differentiability assumptions about the supply and inv...

This paper presents a general dynamic programming algorithm for the solution of optimal stochastic control problems concerning a class of discrete event syst...

The problem of exogenity in economics is a highly relative one. For example in microeconomics (production theory or consumer theory) quantities are exogeneo...

Ce rapport décrit le logiciel graphique exploitant les résultats fournis par le modèle énergétique MARKAL. Il explique en détails les étapes nécessaires à l...

This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses const...

Cet article présente un modèle de programmation linéaire conçu pour analyser la structure du système énergétique du Québec et son adaptation à l'évolution de...

Nous étudions dans cet article la possibilité d'effectuer le couplage entre un modèle de simulation de la demande énergétique (MEDEE-3-QUEBEC) et un modèle d...

This paper provides integer linear programming formulations for three types of vehicle routing problems. Appropriate relaxations of these formulations lend ...

This paper provides an integer linear programming formulation and an exact algorithm for a class of multidepot vehicle routing problems. This formulation co...

In this article, we examine the use of Lagrangian relaxation to obtain a lower bound on the minimum fleet size for the m-TSP with time window constraints on ...

Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost and a time interval within which the tr...