Rairo-operations Research 

About: Rairo-operations Research is an academic journal published by EDP Sciences. The journal publishes majorly in the area(s): Computer science & Supply chain. It has an ISSN identifier of 0399-0559. Over the lifetime, 1880 publications have been published receiving 15402 citations. The journal is also known as: RAIRO. Operations research & RO. Recherche opérationnelle (Imprimé).

Parametric integer programming

Abstract: L'analyse semantique des programmes informatiques conduit a la resolution de problemes de programmation parametrique entiere. L'article s'est ainsi consacre a la construction d'un algorithme de ce type

A heuristic column generation method for the heterogeneous fleet VRP

Abstract: This paper presents a heuristic column generation method for solving vehicle routing problems with a heterogeneous fleet of vehicles. The method may also solve the fleet size and composition vehicle routing problem and new best known solutions are reported for a set of classical problems. Numerical results show that the method is robust and efficient, particularly for medium and large size problem instances.

Determining lot sizes and resource requirements: A review

Abstract: We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this field). There exists plenty of papers and books dealing with these methods, and studying in particular their convergence properties. The second part of the paper is devoted to more recent or atypical methods, mostly issued from combinatorial optimization. The three main methods are “metaheuristics": Simulated Annealing (and derived techniques), Tabu Search and Genetic Algorithms; we also describe three other less known methods. For these methods, theoretical studies of convergence are less abundant in the literature, and the use of convergence results is by far more limited in practice. However, the fitting of some of these techniques to continuous variables problems gave very promising results; that question is not discussed in detail in the paper, but useful references allowing to deepen the subject are given.

Ordonnancements à contraintes disjonctives

Abstract: L’accès aux archives de la revue « Revue française d’automatique, d’informatique et de recherche opérationnelle. Recherche opérationnelle » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/ legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.

Balancing the stations of a self service “bike hire” system

Abstract: This paper is motivated by operating self service transport systems that ourish nowa- days. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP dened by Chalasani and Motwani in which, unlike their denition, C is part of the input: each vertex v of a graph G = (V;E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that P v2V xv = P v2V yv and all quantities are assumed to be integers); given a vehicle of capacity C, nd a minimal route that balances all vertices, that is, that allows to have an amount yv of the commodity on each vertex v. This paper presents among other things complexity results, lower bounds, approximation algo- rithms, and a polynomial algorithm when G is a tree. Mathematics Subject Classication. ???, ???