Marc Sevaux's Publications List

Metaheuristics in the service industry

2008-06-19T09:29:15Z

(2009) :

A multiobjective distribution problem for parcel delivery at TNT

2008-06-19T09:27:31Z

K Sörensen, J Van den Bergh, D Cattrysse, M Sevaux (2008) Invited talk at the International Workshop on Vehicle Routing in Practice, VIP’08 ./Publications/p-sorensen-08.pdf :

Stimulating information sharing, collaboration and learning in operations research with libOR

2008-06-19T09:27:31Z

K Ven, K Sörensen, J Verelst, M Sevaux (2008) International Journal on Digital Libraries http://dx.doi.org/ 10.1007/s00799-007-0032-7 8: 2 79-90

Mixed-integer linear programming formulation for High Level Synthesis

2008-06-19T09:27:31Z

A Rossi, M Sevaux (2008) Proceedings of 11th International Workshop on Project Management and Scheduling, PMS 2008 :

“Multiple Neighbourhood” Search in Commercial VRP Packages : Evolving Towards Self-Adaptive Method

2008-06-19T09:35:39Z

K Sörensen, M Sevaux, P Schittekat (2008) Metaheuristics in the Service Industry 231-245

Probability-Driven Simulated Annealing for Optimizing Digital FIR Filters

2008-06-18T15:24:50Z

Emmanuel Boutillon, Christian Roland and Marc Sevaux (2008) Adaptive and Multilevel Metaheuristics (Serie: Studies in Computational Intelligence vol 136) 77-93

Adaptive and Multilevel Metaheuristics

2008-09-24T14:48:22Z

(2008) 136:

Ordonnancement et Assignation en Synthèse de Haut Niveau

2008-06-19T09:27:31Z

K Trabelsi, P Coussy, A Rossi, M Sevaux (2008) ROADeF, 9ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision ./Publications/p-trabelsi-08.pdf :

A metaheuristic for solving large instances of the School Bus Routing Problem

2008-06-19T09:27:31Z

The school bus routing problem discussed in this paper, is similar to the standard vehicle routing problem, but has several interesting additional features. In our school bus routing problem, we assume that a set of potential stops is given, as well as a set of students that can walk to one or more stops.

P Schittekat, K Sörensen, M Sevaux, J Springael (2007) Proceedings of 7th Metaheuristics International Conference, MIC 2007 ./Publications/inp-schittekat-07.pdf : 671-673

A metaheuristic for solving large instances of the School Bus Routing Problem

2008-06-19T09:27:31Z

P Schittekat, K Sörensen, M Sevaux, J Springael (2007) $21^st$ annual conference of the SOGESCI-BVWB ./Publications/p-schittekat-07.pdf :

Programmation linéaire en nombres entiers pour la synthèse de haut niveau

2008-06-19T09:27:31Z

M Sevaux, A Rossi (2007) Conférence conjointe Francoro V – Roadef 2007 ./Publications/p-sevaux-07a.pdf :

Min-Cost electronic design using tabu search

2008-06-19T09:27:31Z

In this study, we wish to help a decision maker in designing an electronic component at a minimium cost. After modeling the problem, we have a scheduling problem where a set of tasks with precedence constraints, release dates and due dates has to be scheduled on different resources. The objective is to minimize the cost of the resources used for sequencing all tasks on time.

M Sevaux, K Sörensen, A Singh (2007) Proceedings of 7th Metaheuristics International Conference, MIC 2007 ./Publications/inp-sevaux-07.pdf : 951-952

A curve fitting genetic algorithm for styling application

2008-06-19T09:27:31Z

The fitting of curves in computer aided geometric design is generally regarded as an optimisation problem. According to the application, conditions to be satisfied can make the problem difficult to solve with classical methods. Stochastic ones, such as genetic algorithms, therefore appear as a relevant way of solving. We consider here a curve fitting problem aiming the generation of shapes with sp...

M Sevaux, Y Mineur (2007) European Journal of Operational Research http://dx.doi.org/10.1016/j.ejor.2005.03.065 179: 3 895-905

Metaheuristics for robust planning and scheduling

2008-06-19T09:31:24Z

M Sevaux, K Sörensen, Y Le Quéré (2007) Flexibility and Robsutness in Scheduling

Applications of metaheuristics

2008-06-19T09:30:33Z

(2007) 179-3:

Applications of metaheuristics

2008-06-19T09:27:31Z

M Sevaux, K Sörensen, J Springael, W Dullaert (2007) European Journal of Operational Research http://dx.doi.org/10.1016/j.ejor.2005.03.060 179: 3 601-604

A tabu search method for high level synthesis

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2007) Conférence conjointe Francoro V – Roadef 2007 ./Publications/p-sevaux-07.pdf : 395-396

A metaheuristic for solving large instances of the School Bus Routing Problem

2008-06-19T09:27:31Z

P Schittekat, K Sörensen, M Sevaux, J Springael (2007) 22$^nd$ European Conference on Operational Research, EURO XXII ./Publications/p-schittekat-07a.pdf :

Optimisation des filtres RIF : une approche par recuit simulé avancé

2008-06-19T09:27:31Z

M Sevaux, C Roland, E Boutillon (2007) Conférence conjointe Francoro V – Roadef 2007 ./Publications/p-sevaux-07b.pdf :

Variable neighbourhood search in commercial VRP packages : evolving towards self-adaptive methods

2008-06-19T09:27:31Z

K Sörensen, M Sevaux, P Schittekat (2006) $7^th$ EUMEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics ./Publications/p-sorensen-06.pdf :

VNS/TS pour l’ordonnancement sur machines parallèles

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2006) ROADeF, 7ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision ./Publications/p-sevaux-06.pdf :

VNS/TS for a parallel machine scheduling problem

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2006) EURO XXI :

Tabu searching for high-level synthesis

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2006) $7^th$ EUMEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics ./Publications/p-sevaux-06b.pdf :

Application du recuit simulé pour l’optimisation des Taylor Expansion Diagrams

2008-06-19T09:27:31Z

J Guillot, M Sevaux, E Boutillon, M Ciesielski (2006) MAnifestation des Jeunes Chercheurs STIC, MAJECSTIC 2006 ./Publications/p-boutillon-06.pdf :

A Mathematical Formulation for a School Bus Routing Problem

2008-06-19T09:27:31Z

The school bus routing problem discussed in this paper, is similar to the standard vehicle routing problem, but has several interesting additional features. In the standard VRP all stops to visit are given. In our school bus routing problem, we assume that a set of \emphpotential stops is given, as well as a set of students that can walk to one or more of these potential stops. The school buses us...

P Schittekat, M Sevaux, K Sörensen (2006) Proceedings of the IEEE 2006 International Conference on Service Systems and Service Management, ICSSSM’06 ./Publications/inp-sevaux-06.pdf : 1552-1557

MA|PM : Memetic algorithms with population management

2008-06-19T09:34:52Z

A new metaheuristic for (combinatorial) optimisation is presented: memetic algorithms with population management or MA$|$PM. A MA$|$PM is a memetic algorithm, that combines local search and crossover operators, but its main distinguishing feature is the use of distance measures for population management. Population management strategies can be developed to dynamically control the diversity of a ...

K Sörensen, M Sevaux (2006) Computers and Operations Research 33: 5 1214-1225

A Robust-Solution Based Methodology to MO Problems

2008-06-19T09:27:31Z

Robustness is a very important concept present in diverse areas related to MCDM. In general words we can say that robustness is an attribute related to the “ability of a subject to cope well with uncertainties”, more precisely the uncertainties that accompany the input of a system. In this work we are particularly interested in the concept of robust solution in optimisation and its application...

D Salazar, X Gandibleux, J Jorge, M Sevaux (2006) Proceedings of the 7th International Conference on Multi-Objective Programming and Goal Programming, MOPGP 2006 ./Publications/inp-salazar-06.pdf :

A genetic algorithm for a bi-objective capacitated arc routing problem

2008-06-19T09:27:31Z

The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem for which the objective –- in its classical form –- is the minimisation of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest trip. In this paper, a multi-objective genetic algorithm is presented for this more realistic CARP. Inspired by the second version of the Non-...

P Lacomme, C Prins, M Sevaux (2006) Computers and Operations Research http://dx.doi.org/10.1016/j.cor.2005.02.017 33: 12 3473-3493

Combining constraint programming and memetic algorithm for the hybrid flowshop scheduling problem

2008-09-24T14:52:33Z

We developed a genetic algorithm and a constraint programming based branch-and-bound algorithm to solve multiprocessor task scheduling problem in hybrid flow-shop environments. We then combined these two approaches to benefit from their different aspects. Computational experiments are conducted on a large set of instances and the resulting memetic algorithm gives the best results so far.

M Sevaux, A Jouglet, C Oguz (2005) ORBEL 19 th annual conference of the SOGESCI-BVWB

MA$|$PM : une nouvelle métaheuristique hybride

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2005) ROADeF, 6ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision ./Publications/p-sevaux-05b.pdf :

Constraint programming in a memetic algorithm for hybrid flow-shop scheduling

2008-06-19T09:27:31Z

C Oguz, A Jouglet, M Sevaux (2005) Proceedings of the 7th Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP 2005 ./Publications/p-oguz-05.pdf :

VNS/TS for a parallel machine scheduling problem

2008-06-19T09:27:31Z

M Sevaux, K Sörensen (2005) 18th Mini Euro Conference on VNS ./Publications/p-sevaux-05c.pdf :

Aide à la décision pour la conception urbaine

2008-06-19T09:27:31Z

V Becue, M Sevaux, C Tahon (2005) ROADeF, 6ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision ./Publications/p-becue-05.pdf :

MLS+CP for the hybrid flowshop scheduling problem

2008-09-24T14:52:56Z

M Sevaux, A Jouglet, C Oguz (2005) $6^th$ EUMEeting on Combination of Metaheuristics and LS with Constraint Programming techniques

Stimulating collaborative development in operations research with libOR

2008-06-19T09:27:31Z

In this paper we describe the development of libOR, an on-line library for the operations research (OR) community. The design and operation of this website is inspired by the Open Source movement and recent developments such as Wikipedia. In operations research, data sets are exchanged between researchers in order to test the performance of newly developed algorithms. Currently, the exchange of th...

K Ven, K Sörensen, J Verelst, M Sevaux (2005) Proceedings of the First International Conference on Open Source Systems ./Publications/inp-ven-05.pdf : 71-75

Decision making system for regulation of a bimodal urban transportation network, associating a classical and a multi-agent approaches

2008-06-19T09:27:31Z

To offer high quality services, when users are increasingly demanding and competition more and more hard, is now a major problem that transportation companies are faced with. So, ensuring a regular traffic needs to identify the randomly occurring disturbances that affect the transportation system and to eliminate or reduce their impacts on the traffic. This paper presents a decision support system...

K Bouamrane, C Tahon, M Sevaux, B Beldjilali (2005) Informatica http://www.vtex.lt/informatica/htm/INFO606.htm 16: 4 473-502

Métaheuristiques pour la planification et l’ordonnancement robuste

2008-06-19T09:32:50Z

M Sevaux, K Sörensen, Y Le Quéré (2005) Flexibilité et Robustesse en Ordonnancement 115-133

Permutation distance measures for memetic algorithms with population management

2008-06-19T09:27:31Z

Several new metaheuristic optimization approaches use a distance measure in the solution space to control diversity. Memetic algorithms with population management (MA|PM) are relatively new metaheuristics, that actively control the diversity of a small population of high-quality solutions. The distance measure used should reflect the difference between a given pair of solutions in the solution spa...

M Sevaux, K Sörensen (2005) Proceedings of 6th Metaheuristics International Conference, MIC 2005 ./Publications/inp-sevaux-05.pdf : 832-838

A memetic algorithm for a bi-objective and stochastic CARP

2008-06-19T09:27:31Z

The Capacitated Arc Routing Problem or CARP is raised for instance by urban refuse collection. The paper shows how to modify an efficient memetic algorithm for the CARP to tackle two other problems: a CARP with stochastic demands and a bi-objective CARP in which the second objective is the cost of the longest trip or makespan. The two new algorithms are finally combined for the bi-objective case w...

G Fleury, P Lacomme, C Prins, M Sevaux (2005) Proceedings of 6th Metaheuristics International Conference, MIC 2005 ./Publications/inp-fleury-05.pdf : 368-374

MA|PM : enhanced memetic algorithms for combinatorial optimisation problems

2008-06-19T09:28:52Z

A new metaheuristic for (combinatorial) optimisation is presented: memetic algorithms with population management or MA$|$PM. A MA$|$PM is a memetic algorithm, that combines local search and crossover operators, but its main distinguishing feature is the use of distance measures for \emphpopulation management. Population management \emphstrategies can be developed to dynamically control the diversi...

M Sevaux, K Sörensen (2005) ORBEL 19 th annual conference of the SOGESCI-BVWB

SART : un système d’aide à la décision pour la régulation d’un réseau de transport bimodal

2008-06-19T09:27:31Z

Offrir une qualité de service (confort, régularité, ponctualité) élevée à des usagers de plus en plus exigeants est, dans un contexte concurrentiel de plus en plus rude, un problème majeur pour les compagnies de transport. Ainsi, assurer la régularité du trafic leur impose de mettre en place les moyens d’identifier les dysfonctionnements perturbant le trafic et de supprimer ou d’att�...

K Bouamrane, T Bonte, M Sevaux, C Tahon (2005) Proceedings of the workshop Méthodologies et Heuristiques pour l’Optimisation des Systèmes Industriels, MHOSI 2005 ./Publications/inp-bouamrane-05.pdf : 187-192

Flowshop hybride : de nouvelles perspectives en mêlant algorithme génétique et propagation de contraintes

2008-09-24T14:51:55Z

A Jouglet, C Oguz, M Sevaux (2005) ROADeF, 6ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision

Métaheuristiques : des outils pour l’optimisation

2008-09-24T14:24:37Z

Au cours de cet exposé, nous allons faire un bref rappel sur les métaheuristiques et leur cadre d’application. Nous mettrons en avant les deux caractéristiques principales qui sont l’intensification et la diversification à travers la présentation de 3 métaheuristiques particulières. Nous presenterons ensuite les traits que devraient avoir une "bonne" metaheuristique. La suite de l’exp...

M Sevaux (2005)

Métaheuristiques, des outils pour l’optimisation et la robustesse

2008-09-24T14:24:20Z

Les métaheuristiques jouent un rôle important dans la résolution des problèmes d’optimisation combinatoire appartenant à la classe des problemes NP-difficiles. Pourtant, les problèmes industriels proposés ont souvent des données incomplètes ou parfois sujettes à des erreurs (mesures, précisions, etc.). Par de simples transformations des métaheuristiques classiques, on peut arriver à...

M Sevaux (2005)

Métaheuristiques : Des outils pour l’optimisation et la robustesse

2008-09-24T14:24:52Z

Combining genetic algorithms with constraint programming for a scheduling problem

2008-09-24T14:52:20Z

We developed a genetic algorithm and a constraint programming based branch-and-bound algorithm to solve multiprocessor task scheduling problem in hybrid flow-shop environments. We then combined these two approaches to benefit from their different aspects. We will present our computational results which are very encouraging.

C Oguz, M Sevaux, A Jouglet (2004) Informs annual meeting

libOR : Library for OR data sets

2008-06-19T09:27:31Z

libOR can be described as a comprehensive database of OR problem data sets, similar to the OR library. Although libOR consists of a central database, it is decentrally updateable. Unlike other similar databases, libOR also contains a database of results. libOR uses XML technology to validate data sets. libOR has a number of responsibles that make sure that the problems and results are up to date, ...

K Sörensen, M Sevaux (2004) Informs annual meeting :

Genetic algorithms with population management : an application to arc routing

2008-06-19T09:27:31Z

C Prins, M Sevaux, K Sörensen (2004) Optimization :

MA$|$PM : Memetic algorithms with population management

2008-06-19T09:27:31Z

K Sörensen, M Sevaux (2004) $4^th$ Joint EU/ME workshop with the university of Nottingham on Design and Evaluation of Advanced Hybrid Meta-heuristics ./Publications/p-sorensen-04b.pdf :

Production de biens et services : application en ordonnancement et transport

2008-09-24T14:25:51Z

M Sevaux (2004)

A genetic algorithm for robust schedules in a just-in-time environment with ready times and due dates

2008-06-19T09:27:31Z

Computing a schedule for a given single machine problem is often difficult for irregular criteria, but when the data are uncertain, the problem is much more complicated. In this paper, we modify a genetic algorithm to compute robust schedules when release dates are subject to small variations. Two types of robustness are distinguished: quality robustness or robustness in the objective function spa...

M Sevaux, K Sörensen (2004) 4OR – Quarterly journal of the Belgian, French and Italian Operations Research Societies http://dx.doi.org/10.1007/s10288-003-0028-0 2: 2 129-147

Robust and flexible vehicle routing in practical situations

2008-06-19T09:27:31Z

This paper presents a new technique for finding robust and flexible vehicle routing solutions in practical situations, combining the optimisation power of metaheuristics with a sampling-based approach to evaluating the robustness and flexibility of a solution. This approach overcomes the main limitations of most current methods. Using experiments, we show that the method is versatile and capable o...

K Sörensen, M Sevaux (2004) Proceedings of 5th triennial symposium on transportation analysis, TRISTAN V ./Publications/p-sorensen-04.pdf :

Robustness Analysis : Optimisation

2008-09-24T14:32:00Z

M Sevaux, K Sörensen (2004) Newsletter of the EWG Multicriteria Aid for Decisions

A genetic algorithm with population management GA$|$PM for the CARP.

2008-09-24T14:25:18Z

Metaheuristics are nowadays commonly used for solving combinatorial optimisation problems. Classical genetic algorithms face several problems for convergence and the purpose of the proposed method is to solve efficiently the balance between intensification and diversification during the search. This is done through a careful population management which leads to general improvement of the classical...

M Sevaux (2004)

Meta-heuristics for multi-objective optimisation

2008-06-19T09:34:05Z

(2004) 535:

Stochastic Maintenance Scheduling Problem

2008-06-19T09:27:31Z

This paper addresses resolution of a robust scheduling problem arising at the French railways company. The objective is to reduce the immobilization of trains during the maintenance operations. The processing times of operations are submitted to hazards and the objective is to minimize both the total completion time (\emphi.e. the makespan) and to limit the random event consequences on solution qu...

G Fleury, P Lacomme, M Sevaux (2004) Proceedings of ninth international conference on project management and scheduling, PMS 2004 ./Publications/inp-fleury-04.pdf : 405-409

A genetic algorithm with population management (GA$|$PM) for the CARP

2008-06-19T09:27:31Z

In this paper, we apply the framework of genetic algorithms with population management (GA$|$PM) to the capacitated arc routing problem (CARP). GA$|$PM use distance measures to control the diversity of a small population of high-quality solutions. The algorithm is compared on the 23 GDB instances from Golden, DeArmon and Baker. The GA$|$PM is able to retrieve the same solutions much faster than an...

C Prins, M Sevaux, K Sörensen (2004) Proceedings of 5th trienal symposium on transportation analysis, TRISTAN V ./Publications/p-prins-04.pdf :

Metaheuristics : strategies for the optimisation of the production of goods and services

2008-09-24T14:56:29Z

Solving optimisation problems is key to the continuous improvement of productivity in industry. When traditional methods fail, it is natural to consider approximate resolution methods. Metaheuristics, today, play an important role in solving optmisation problems. Over the last few years, these powerful techniques have become necessary tools. The HDR synthesis presents an overview of the classic m...

M Sevaux (2004) Habilitation Thesis

An exact method to minimize the number of tardy jobs in single machine scheduling

2008-06-19T09:27:31Z

This paper considers the problem of scheduling $n$ jobs on a single machine to minimize the number of tardy (or late) jobs. Each job has a release date, a processing time and a due date. The general case with non-equal release dates and different due dates is considered. Using new and efficient lower bounds and several dominance rules, a branch and bound scheme is proposed based on the definition ...

S Dauzère-Pérès, M Sevaux (2004) Journal of Scheduling http://dx.doi.org/10.1023/B:JOSH.0000046073.05827.15 7: 6 405-420

Advances in mutliple objective capacitated arc routing problem

2008-09-24T14:28:19Z

The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. A bi-objective genetic algorithm is presented for this more realistic CARP, never studied before...

M Sevaux (2003)

Metaheuristics : a quick overview

2008-09-24T14:28:48Z

Today, metaheuristics play an important role in the optimization of difficult problems. Most people have already heard about tabu search or genetic algorithms but don’t know in detail how each of these optimization strategies work. This talk will present some of the metaheuristics used today in many research domains. Two types are introduced: neighborhood metaheuristics and population metaheuris...

M Sevaux (2003)

A genetic algorithm for robust schedules in a just-in-time environment

2008-09-24T14:31:24Z

Population metaheuristics

2008-09-24T14:28:33Z

Metaheuristics play a great role in optimization problem solving. Most of the people have already heard about genetic algorithms but don’t know much about it. This talk will focus on population metaheuristics (i.e. metaheuristics that use a population of solutions instead of a single solution). The presentation will include a description of Genetic Algorithms (GA), Hybrid GA, Memetic Algorithms,...

M Sevaux (2003)

Reactive scheduling of complex system maintenance in a cooperative environment with communication times

2008-09-24T10:00:36Z

This paper focuses on the problematic of the complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they lead to identify dynamically new tasks or to modify the duration of planned tasks. In addition, when an unexpected event is detected...

Y Le Quéré, M Sevaux, C Tahon, D Trentesaux (2003) IEEE-SMC 33: 2 225-234

GA$|$PM : genetic algorithms with population management for permutation problems

2008-06-19T09:27:31Z

Classical genetic algorithms (GA)-pioneered by among others Holland (1975) and Goldberg (1989) have been shown experimentally to perform rather poorly on many combinatorial problems. Large memory requirements, large running times and poor performance in terms of solution quality characterise many GA implementations. In this paper we present a new type of genetic algorithm that attempts to overcome...

K Sörensen, M Sevaux (2003) Proceedings of 5th Metaheuristics International Conference, MIC 2003 ./Publications/inp-sorensen-03.pdf : 69-1

Modèle de coopération d’un processus de ré-ordonnancement distribué

2008-06-19T09:27:31Z

Distributed re-scheduling Processes are involved in many industrial cases (multi-site problems, multi-entities problems) and represent a large part of decision systems literature. The emerging problems lie on both, re-scheduling process and structure of decision systems. The literature shows the influence of some parameters of the decision cooperative process on the re-scheduling process, when the...

Y Le Quéré, M Sevaux, C Tahon, D Trentesaux (2003) Proceedings of the Automatic control doctoral days (Journées doctorales d’automatique) ./Publications/inp-lequere-03.pdf : 401-406

Mutliple objective capacitated arc routing problem

2008-06-19T09:27:31Z

The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. In this paper, a bi-objective genetic algorithm is presented for this more realistic CARP, never...

P Lacomme, C Prins, M Sevaux (2003) Proceedings of 2nd International Conference on Evolutionary Multi-Criterion Optimization, EMO’2003 ./Publications/inp-lacomme-03.pdf : 550-564

Algorithmes de graphes

2008-06-19T07:11:23Z

P. Lacomme, C. Prins, and M. Sevaux (2003) :

Reactive scheduling of complex system maintenance in a cooperative environment with communication times

2008-09-24T14:51:17Z

Using lagrangean relaxation to minimize the weighted number of late jobs

2008-06-19T09:27:31Z

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed-integer linear programming. By rel...

S Dauzère-Pérès, M Sevaux (2003) Naval Research Logistics http://dx.doi.org/10.1002/nav.10056 50: 3 273-288

Solving a robust maintenance scheduling problem at the French railway company

2008-09-24T14:31:41Z

M Sevaux, Y Le Quéré (2003) LAMIH/SP-2003-3

Approche robuste pour un problème à contraintes de ressources

2008-06-19T09:27:31Z

Le problème de la maintenance des TGV est extrêmement complexe et regroupe plusieurs milliers de tâches élémentaires. Au niveau de la planification à moyen ou court terme, la maintenance d’un TGV peut être découpé en huit tâches principales par rame. Un TGV compte le plus souvent huit remorques, on a donc un ensemble de 64 tâches aggrégées qui représentent les principales étapes d...

Y Le Quéré, M Sevaux (2003) ROADeF, 5ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision :

Genetic algorithms to minimize the weighted number of late jobs on a single machine

2008-06-19T09:27:31Z

The general one-machine scheduling problem is strongly $\mathcalNP$-Hard when the objective is to minimize the weighted number of late jobs. Few methods exist to solve this problem. In an other paper, we developed a Lagrangean relaxation algorithm which gives good results on many instances. However, there is still room for improvement, and a metaheuristic might lead to better results. In this pape...

M Sevaux, S Dauzère-Pérès (2003) European Journal of Operational Research http://dx.doi.org/10.1016/S0377-2217(02)00827-5 151: 2 296-306

Curve fitting for styling application by genetic algorithm

2008-06-19T09:27:31Z

The fitting of curves in computer aided geometric design is generally regarded as an optimisation problem. According to the application, conditions to be satisfied can make the problem difficult to solve with classical methods. Stochastic ones, such as genetic algorithms, therefore appear as a relevant way of solving. We consider here a curve fitting problem aiming the generation of shapes with sp...

Y Mineur, M Sevaux (2003) 3rd Joint EU/ME workshop with the university of Antwerp on Real-life application of metaheuristics :

Lib-OR – Library of OR data sets

2008-06-19T09:27:31Z

K Ven, K Sörensen, M Sevaux, J Verelst (2003) 3rd Joint EU/ME workshop with the university of Antwerp on Real-life application of metaheuristics :

Lagrangean relaxation for minimizing the weigthed number of late jobs on parallel machines

2008-06-19T09:27:31Z

This paper presents a Lagrangean relaxation approach for solving a parallel machine scheduling problem where the objective is to minimize the weithed number of late jobs. This approach is an extension of an approach that has been successfully applied on the one-machine case.

S Dauzère-Pérès, M Sevaux (2002) Proceedings of 8th International Workshop on Project Management and Scheduling, PMS’2002 ./Publications/inp-dauzere-02.pdf : 121-124

Genetic algorithm for robust schedules

2008-06-19T09:27:31Z

Computing a schedule for a given single machine problem is often difficult for irregular criteria, but when the data are uncertain, the problem is much more complicated. In this paper, we create a genetic algorithm to compute robust scedules when release dates are subject ot small variations. Instead of evaluating a single fitness function, at each iteration, several functions are evaluated taking...

M Sevaux, K Sörensen (2002) Proceedings of 8th International Workshop on Project Management and Scheduling, PMS’2002 ./Publications/inp-sevaux-02.pdf : 330-333

Les méthodes de recherche à population

2008-09-24T14:30:01Z

Cet exposé fait suite à celui présenté à Toulouse en Novembre 2001. Si les méthodes précédentes (recherches locales itératives) présentent un intérêt particulier dans leur facilité d’implémentation, les méthodes à population offrent une puissance d’une toute autre dimension. Une méthode à population présente un parallélisme intrinsèque et donne souvent de très bons résu...

M Sevaux (2002)

Scatter search and GA : a one machine scheduling problem comparison

2008-06-19T09:27:31Z

The general one machine total weighted tardiness problem is one of the most difficult scheduling problem. In the general case only few results exists. The problem can be described as follows: a set of $n$ jobs has to be sequenced on a single machine. Preemption is not allowed and only one job can be processed at the same time. Each job cannot start before its release date $r_j$, is processed durin...

M Sevaux, P Thomin (2002) The sixteenth triennial conference of international federation of operational research societies, IFORS’2002 :

Résolution d’un problème industriel de maintenance des TGV à la SNCF

2008-06-19T09:27:31Z

Le problème abordé est celui de la maintenance des TGV réalisée ‘a l’EIMM d’Hellemmes. Cette étude s’incrit dans un cadre très large qui concerne la robustesse de la planification des tâches de maintenance pour une rame TGV. Dans cette présentation, nous allons nous concentrer uniquement sur la recherche d’un ordonnancement optimal de ces tâches. Cet ordonnancement servira de ba...

Y Le Quéré, M Sevaux, D Trentesaux, C Tahon (2002) ROADeF, 4ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision :

Flexibilité et Robustesse en Ordonnancement

2008-09-24T14:56:01Z

M. Sevaux (2002) Bulletin de la ROADeF

Métaheuristiques pour la résolution robuste de problèmes d’optimisation combinatoire

2008-09-24T14:29:48Z

La résolution de problèmes d’optimisation combinatoire est souvent basée sur des données d éterministes. Pourtant ces données sont sujettes à variations dans de nombreux cas. Pour les problèmes les plus difficiles, on utilisera des métaheuristiques pour chercher des solutions robustes (qui résistent à des variations des données).

M Sevaux (2002)

Multiobjective capacitated arc routing problem

2008-06-19T09:27:31Z

Applications of optimisation with Xpress-MP

2008-06-19T07:13:35Z

C. Guéret, C. Prins, and M. Sevaux (2002) :

Les méthodes de recherche à voisinage

2008-09-24T14:29:31Z

Quelle approche adopter lorsqu’on se retrouve face à un problème d’optimisation NP-Difficile ? Une des étapes les plus simples consiste à construire une heuristique pour “sentir” la nature du problème. Mais souvent cette technique conduit à des solutions peu efficaces. Choisir d’implémenter une recherche locale (ou une recherche par voisinage) permet d’améliorer la solution d�...

M Sevaux (2002)

Planification réactive des opérations de maintien et d’actualisation réglementaire et technologique des systèmes complexes

2008-06-19T09:27:31Z

Cet article propose l’étude de cas de la planification de la maintenance d’un système complexe. La problématique de la planification dans un contexte où les tâches sont sujettes à aléas et où les modifications du plan sont à minimiser compte tenu de la faible mobilité des produits maintenus est traitée.

Y Le Quéré, M Sevaux, D Trentesaux, C Tahon (2001) Proceedings of the International Conference on Computer aided Maintenance ./Publications/inp-lequere-01.pdf :

Les méthodes de recherche à voisinage

2008-09-24T14:29:13Z

Quelle approche adopter lorsqu’on se retrouve face à un problème d’optimisation NP-Difficile ? Une des étapes les plus simples consiste à construire une heuristique pour "sentir" la nature du problème. Mais souvent cette technique conduit à des solutions peu efficaces. Choisir d’implémenter une recherche locale (ou une recherche par voisinage) permet d’améliorer la solution d’une...

M Sevaux (2001)

Single machine scheduling : minimizing the [weighted] number of late jobs, a review

2008-09-24T14:32:35Z

M Sevaux, D Rivreau (2001)

Parallel machine scheduling : a metaheuristic computational evaluation

2008-09-24T14:32:58Z

Minimiser le nombre pondéré de jobs en retard est un critère qui sert souvent dŽévaluation pour mesurer la capacité de travail d’un atelier. Dans le cas ou les jobs doivent etre ordonnancés sur une seule machine, il existe plusieurs approches qui ont donné de bons resultats et permettent de résoudre des instances jusqu’à 150 tâches. Si on étend le problème à plusieurs machines, i...

M Sevaux, Ph. Thomin (2001)

Heuristics and metaheuristics for parallel machine scheduling : a computational evaluation

2008-06-19T09:27:31Z

In this paper, the problem consist in minimizing the weighted number of late jobs on parallel machine. Several heuristics and metaheuristics using a common neighborhood are presented and evaluated. Best results are given by an improved tabu search procedure with cycle detection and dynamic tenure adaptation.

M Sevaux, P Thomin (2001) Proceedings of 4th Metaheuristics International Conference, MIC 2001 ./Publications/inp-sevaux-01a.ps.gz : 411-415

Gestion réactive des opérations de maintien et d’actualisation réglementaire et technologiques des systèmes complexes

2008-09-24T14:35:46Z

Y Le Quéré, D Trentesaux, M Sevaux, C Tahon (2001) Groupe de Recherche en Productique – Organisation et Gestion de Production

Heuristics and metaheursitics for a parallel machine scheduling problem : a computational evaluation

2008-09-24T14:31:07Z

In scheduling theory, minimizing the weighted number of late jobs in the general case (non-equal release dates) is an objective function usually used as a performance indicator. This paper presents several approaches for the $\mathcalNP$-Hard parallel machine scheduling problem, including two MILP formulations for exact resolution and various heuristics and metaheuristics to solve large size insta...

M Sevaux, P Thomin (2001) LAMIH/SP-2001-2

Efficient heuristic and tabu search for parallel machine scheduling

2008-06-19T09:27:31Z

The problem of minimizing the weighted number of late jobs subject to release date on parallel machines is $\mathcalNP$-Hard. An innovative data structure is presented and used for a simple efficient heuristic. Numerical results are presented. Based on this first solution a tabu search procedure is developped and improves again the results. Compare to another approach, our method gives competitive...

M Sevaux, P Thomin (2001) ORBEL Conference :

Single Machine Scheduling : Minimizing the [Weighted] Number of Late Jobs

2008-09-24T14:32:19Z

Minimizing the number of late jobs on a single machine is a criterion well studied today. Various authors have tackled this problem since 1968 but very few of them have tried to solve it in the general case (problem with differents release dates). Two french teams have recently proposed new properties and efficient procedures for solving this problem. Three exact methods exist today and are compet...

M Sevaux (2001)

Parallel machine scheduling : a (meta)heuristic computational evaluation

2008-09-24T14:34:30Z

M Sevaux, P Thomin (2001)

Recherche taboue améliorée pour l’ordonnancement sur machines parallèles

2008-06-19T09:27:31Z

Ce papier présente une méthode de recherche taboue qui permet de résoudre un problème d’ordonnancement sur machines parallèles dans lequel l’objectif est de minimiser le poids des jobs en retard. Ce critère particulier est souvent utilisé comme indicateur de performance, base d’autres critères comme par exemple la minimisation de la somme des retards pondérés. Des modélisations pa...

M Sevaux, P Thomin (2001) Actes de la 3ème conférence internationale francophone de MOdélisation et de SIMulation, MOSIM’01 ./Publications/inp-sevaux-01.pdf : 829-833

Programmation linéaire

2008-06-19T07:14:35Z

C. Guéret, C. Prins, and M. Sevaux (2000) :

Un algorithme génétique pour minimiser le nombre pondéré de jobs en retard sur une machine

2008-06-19T09:27:31Z

Le problème noté $1|r_j|\sum w_jU_j$ dans la littérature est $\mathcalNP$-difficile au sens fort. Un algorithme de relaxation Lagrangienne développé précédemment résout déjà le problème, mais certaines instances sont difficiles. Une méta-heuristique pourrait donner de meilleurs résultats et nous avons choisi de développer un algorithme génétique (GA). Plusieurs types de moteurs et ...

M Sevaux, S Dauzère-Pérès (2000) ROADeF, 3ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision :

A genetic algorithm to minimize the weighted number of late jobs on a single machine

2008-06-19T09:27:31Z

The problem of minimizing the weighted number of late jobs subject to release date on a single machine is strongly $\mathcalNP$-Hard. In an other paper, we have developped a Lagrangean relaxation algorithm to solve the problem. A meta-heuristic could lead to better results and we decided to use a Genetic Algorithm (GA). Even if a GA is somewhat easy to implement, many variations exist. In this pap...

M Sevaux, S Dauzère-Pérès (2000) Proceedings of 7th International Workshop on Project Management and Scheduling, PMS’2000 ./Publications/inp-sevaux-00a.ps.gz : 242-244

Genetic algorithms to minimize the weighted number of late jobs on a single machine

2008-09-24T14:36:17Z

Models and solving procedures for continuous-time production planning

2008-06-19T09:27:31Z

The goal of this paper is to solve a continuous time production planning problem, where production rates are supposed to be piecewise constant. The problem is then to determine not only the rates, but also the times, called switching times, at which these rates may change. An iterative procedure is proposed where, at the first step, optimal rates are determined given the switching times and, at th...

S Dauzère-Pérès, S B Gershwin, M Sevaux (2000) IIE Transactions http://dx.doi.org/10.1023/A:1007648012154 32: 2 93-103

Building a genetic algorithm for a single machine scheduling problem

2008-06-19T09:27:31Z

The problem of minimizing the weighted number of late jobs subject to release date on a single machine is strongly $\mathcalNP$-Hard. Few methods exist to solve this problem. In an other paper, we have developed a Lagrangean relaxation algorithm which give good results over many instances. In some cases, a meta-heuristic could lead to better results and we decided to use a Genetic Algorithm (GA). ...

M Sevaux, S Dauzère-Pérès (2000) Proceedings of the 18th EURO Winter Institute, ESWI XVIII ./Publications/inp-sevaux-00.ps.gz :

Ordonnancement à une machine par relaxation Lagrangienne

2008-09-24T14:37:38Z

M Sevaux (1999)

Using Lagrangean relaxation to minimize the (weighted) number of late jobs

2008-06-19T09:27:31Z

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed-integer linear programming. By rel...

S Dauzère-Pérès, M Sevaux (1999) National contribution for the 15th triennal conference, IFORS’99 ./Publications/inp-dauzere-99a.ps :

Control Policies for some Continuous-Time Production Scheduling Problems

2008-09-24T14:37:18Z

In some industries, it is preferable to use control policies to schedule production. Starting from any configuration of the stocks, an optimal control policy leads the surplus level to a stationary state. The goal of this paper is to provide some control policies for a continuous-time production scheduling problem where demand is constant. For a one machine and multi-item case, we develop a contro...

S Dauzère-Pérès, M Sevaux (1999) 99/3/AUTO

Using lagrangean relaxation to minimize the (weighted) number of late jobs

2008-09-24T14:36:38Z

An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

2008-09-24T14:36:58Z

This paper considers the problem of scheduling $n$ jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and different due dates is considered. Using new and efficient lower bounds and several dominance rules, a branch and bound scheme is proposed based on the defini...

S Dauzère-Pérès, M Sevaux (1999) 99/6/AUTO

Control policies for some continuous-time production scheduling problems

2008-06-19T09:27:31Z

Une méthode arborescente améliorée pour la minimisation du nombre de jobs en retard

2008-06-19T09:27:31Z

L’étude concerne le problème général d’ordonnancement à une machine dénoté par $1|r_j|\sum U_j$ dans la classification standard. Chaque job $J_i$ ne peut démarrer avant sa date de début au plus tôt $r_i$, et doit se terminer avant sa date de fin au plus tard (ou date échue) $d_i$. Un job est en retard s’il se termine après sa date échue. L’objectif est de minimiser le nombre d...

S Dauzère-Pérès, M Sevaux (1999) ROADeF, 2ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision :

On Two Optimization Problems in Production Planning and Scheduling

2009-01-20T16:44:09Z

This dissertation presents the study of two optimization problems, one in production planning and the other in scheduling. In industries where items are produced in large quantities, raw material is continuously arriving and final products are continuously leaving the shop-floor. For a medium-term horizon, this process can be considered as continuous, and continuous-time production planning models...

M Sevaux, (1998)

An Efficient Formulation for Minimizing the Number of Late Jobs in Single-Machine Scheduling

2008-09-24T14:37:55Z

S Dauzère-Pérès, M Sevaux (1998) 98/9/AUTO

Using lagrangean relaxation to minimize the weighted number of late jobs in one machine sequencing with release dates

2008-06-19T09:27:31Z

We consider the problem of scheduling $n$ jobs on a single machine where the objective is to minimize the number of late jobs, both in the unweighted and weighted case, and where release dates, processing times and dued dates can be different. A new integer programming formulation is proposed, whose efficiency has been evaluated through Linear Programming (LP) relaxation. However, in large instanc...

S Dauzère-Pérès, M Sevaux (1998) Symposium on Combinatorial Optimization, CO’98 :

Various Mathematical Programming Formulations for a General One Machine Sequencing Problem

2008-09-24T14:38:32Z

S Dauzère-Pérès, M Sevaux (1998) 98/3/AUTO

Various mathematical programming formulations for a general one machine sequencing problem

2008-06-19T09:27:31Z

The paper considers the problem of scheduling $n$ jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and different due dates is considered. Various mixed-integer linear programming formulations are presented and discussed. A new polynomial solvable case is also in...

S Dauzère-Pérès, M Sevaux (1998) Proceedings of the 4ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets, JNPC’98 ./Publications/rr98-3-auto.ps.gz : 63-68

A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine

2008-09-24T14:38:11Z

S Dauzère-Pérès, M Sevaux (1998) 98/5/AUTO

A branch and bound method to minimize the number of late jobs on a single machine

2008-06-19T09:27:31Z

The paper considers the problem of scheduling $n$ jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and different due dates is considered. Using new and efficient lower bounds, a branch and bound scheme is proposed based on the definition of a master sequence, i....

S Dauzère-Pérès, M Sevaux (1998) Proceedings of the 6th International Workshop on Project Management and Scheduling, PMS’98 ./Publications/rr98-5-auto.ps.gz : 193-196

On minimizing late jobs in single machine scheduling

2008-06-19T09:27:31Z

An original and efficient mixed integer linear programming formulation is proposed, using some properties of the problem. Several cuts can be used to strengthen that formulation and to obtain better bounds by LP relaxation. A branch-and-cut algorithm is derived, whose efficiency will be discussed through some numerical experiments.

S Dauzère-Pérès, M Sevaux (1998) INFORMS/Cors’98 :

Handling discrete demand in continuous-time production planning

2008-06-19T09:27:31Z

Models and solution procedures were proposed in a previous work for continuous-time production planning, i.e., when production and demand are expressed in terms of rates instead of quantities. This paper investigates the case where demand is discrete, i.e., corresponds to quantities of products that need to be fulfilled at given points in time. After describing the model and the solution procedure...

S Dauzère-Pérès, M Sevaux (1998) Proceedings of the 9th symposium of the International Federation of Automatic Control on Information Control in Manufacturing, INCOM’98 ./Publications/rr97-4-auto.ps.gz : 467-472

Modeling and solving procedures of continuous-time production planning problems

2008-06-19T09:27:31Z

In classical production planning problems, the goal is to minimize a cost function over a discrete horizon divided into equal length periods. In continuous-time planning problems, we consider demand and production rates instead of quantities. The objective is then to minimize the cost over the whole horizon. Assuming that the production and demand rates are piecewise constant, we briefly present s...

S Dauzère-Pérès, S B Gershwin, M Sevaux (1997) 8th Annual Meeting of the Production and Operations Management Society, POM-97 :

Optimizing Switching-Times in Continuous-Time Production Planning

2008-06-19T09:27:31Z

In continuous-time planning problems, production is expressed in terms of rates instead of quantities. The objective is to minimize the cost over the whole horizon, and not only at ends of periods like a discrete-time planning problem. We propose a two-level iterative procedure to solve this problem. At the first level, optimal production rates are determined, given the switching times. At the sec...

S Dauzère-Pérès, M Sevaux (1997) 3rd International Symposium on Logistics :

Modeling and Solving Procedures of Continuous-Time Production Planning Problems

2008-09-24T14:39:35Z

Handling Discrete Demand in Continuous-Time Production Planning

2008-09-24T14:39:17Z

S Dauzère-Pérès, M Sevaux (1997) 97/4/AUTO

Models and Solving Procedures for Continuous-Time Production Planning

2008-09-24T14:38:55Z

S Dauzère-Pérès, S B Gershwin, M Sevaux (1997) 97/6/AUTO

Modèles et Procédures de Résolution pour la Planification en Temps Continu

2008-09-24T14:39:52Z

Dans les problèmes classiques de planification de la production, pour un horizon connu et une prévision de demande calculée, le but est de déterminer les quantités a produire pour chacun des produits de fa\c con à minimiser le coût de stockage et de rupture de stock. L’horizon est alors discrétise en périodes de même longueur, et le surplus (positif=stock, négatif=rupture de stock) e...

S Dauzère-Pérès, M Sevaux (1997)

Minimisation du nombre de jobs dans le problème d’ordonnancement à une machine

2008-09-24T10:02:20Z

Nous nous intéresserons au problème général d’ordonnancement à une machine, avec des dates de début au plus tot et des dates de fin au plus tard, avec pour objectif la minimisation du nombre de jobs en retard. Nous rappellerons d’abord les résultats les plus connus sur ce problème. Nous montrerons comment nous avons pu étendre un cas où la résolution du problème peut se faire en te...

S Dauzère-Pérès, M Sevaux (1997)

Ordonnancement avec délais de communication

2009-01-20T16:44:26Z

Les problèmes d’ordonnancement avec délais de communication sont pour les chercheurs en ordonnancement un nouveau domaine dont l’importance croît avec la multiplication des ordinateurs à mémoire distribuée. En s’intéressant à ce type de problème, nous espérons donner des idées pour de nouvelles résolutions et de nouveaux algorithmes. Ce papier tient lieu de rapport de stage de \s...

M Sevaux, (1995)