This paper examines some properties of generalized subtour elimination constraints and connectivity constraints used in a variety of routing problems.

People who attend several meetings on the same day often have unusable pieces of free time between meetings. These can be reduced or eliminated through bett...

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

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

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

Ce rapport décrit un modèle de planification tactique pour l'amélioration de l'industrie du camionnage au Canada. après une brève description du problème, o...

This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters,...

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.

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 describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses const...

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

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

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

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

This paper provides an integer linear programming formulation for a class of multidepot vehicle routing problems. This formulation contains degree constrain...

Bus fleet route planning is often carried out in the following two sequential stages:<br> 1) Based on the demand, determine the trips to be carried out.<br>...

In this article, two Lagrangean relaxations for the vehicle routing problem with time windeow constraints are examined. In the first case, the scheduling co...

Les modèles développés jusqu'à maintenant dans le domaine urbain, que ce soient les modèles économétriques ou encore les modèles déterministes de simulation,...

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