Pierre Dejax

Centre National de la Recherche Scientifique

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Nathalie Bostel

Nantes Université

Michel Gendreau

Université de Montréal

Teodor Gabriel Crainic

Université du Québec à Montréal

Olivier Péton

IMT Atlantique

Majid Eskandarpour

Institut d'Economie Scientifique Et de Gestion

Xiao Yang

Shandong University of Finance and Economics

Nubia Velasco

Pedagogical and Technological University of Colombia

Christelle Guéret

Université d'Angers

Victor Songméné

École de Technologie Supérieure

Jean‐Pierre Kenné

École de Technologie Supérieure

Cooperative Institutions

Centre National de la Recherche Scientifique

Laboratoire des Sciences du Numérique de Nantes

École Nationale Supérieure des Mines de Paris

Nantes Université

Université du Québec à Montréal

École de Technologie Supérieure

Laboratoire d'Automatique, Génie Informatique et Signal

IMT Atlantique

Polytechnique Montréal

Université de Montréal

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

A model and a metaheuristic method for the Hub Location Routing Problem and application to postal services

Nathalie Bostel Pierre Dejax Mi Zhang

This paper discusses the problem of designing a logistic network for Less Than Truckload (LTL) shipments of freight transport providers. These companies have to collect products from many origins (suppliers) and ship them to many destinations (clients) through multi-stop routes and consolidate flows into hubs to achieve economies of scale. This problem is known as the Hub Location Routing Problem (HLRP) and its applications relate to the distribution of general goods as well as to postal services. The main decisions concern the location of hubs, the allocation of origin and destination nodes to the hubs, as well as the design of routes serving origin and destination nodes and determination of flows between hubs. In this paper, we propose a mathematical model for the HLRP with capacity on hubs and single allocation, dedicated to postal service systems, where collections and deliveries may occur within the same routes. A metaheuristic method based on a genetic algorithm, improved by an iterative local search is developed to solve the problem. Experiments are conducted on instances adapted from the Australian Post (AP) data set. Comparison with a standard solver proves the efficiency of the proposed method.

Solver

Vehicle Routing Problem

Location-allocation

10.1109/iesm.2015.7380332

Cite

Citations (10)

Production and maintenance planning for a failure-prone deteriorating manufacturing system: a hierarchical control approach

The International Journal of Advanced Manufacturing Technology (2014)

Annie Francie Kouedeu Jean‐Pierre Kenné Pierre Dejax Victor Songméné Vladimir Polotski

Corrective maintenance

Planned maintenance

Problem statement

Optimal maintenance

10.1007/s00170-014-6175-y

Cite

Citations (37)

Short term container fleet management: issues, models and tools

F Benamar Pierre Dejax Teodor Gabriel Crainic Michel Gendreau

Fleet Management

Source

Cite

Citations (5)

Un système d'aide à la décision pour le transport collectif de personnes handicapées

HAL (Le Centre pour la Communication Scientifique Directe) (2008)

Olivier Péton Pierre Dejax Fabien Lehuédé Claire Pavageau Marc Marhadour

Source

Cite

Citations (0)

A Large Neighborhood Search heuristic for Supply Chain Network

Majid Eskandarpour Pierre Dejax Olivier Péton

Many exact or approximate solution techniques have been used to solve facility location problems and more generally supply chain network design problems. Yet, the Large Neighborhood Search technique (LNS) has almost never been proposed for solving such problems, although it has proven its efficiency and flexibility in solving other complex combinatorial optimization problems. In this paper we propose an LNS framework for solving a four-layer single period multi-product supply chain network design problem involving multimodal transport. Location decisions for intermediate facilities (e.g. plants and distribution centers) are made using the LNS while transportation modes and product flow decisions are determined by a greedy heuristic. As a post-optimization step, we also use linear programming to determine the optimal product flows once the logistics network is fixed. Extensive experiments based on generated instances of different sizes and characteristics show the effectiveness of the method compared with a state-of-the-art solver.

Solver

Supply chain network

Source

Cite

Citations (1)

Using a knowledge-based decision support system development environment to implement a scheduling system for a workshop

International Journal of Production Economics (1993)

Michel Klein Catherine Lecomte Pierre Dejax

10.1016/0925-5273(93)90111-w

Cite

Citations (2)

Freight Distribution and Transport Systems Planning

Logistics Information Management (1990)

Teodor Gabriel Crainic Pierre Dejax

Interactive‐graphic systems and operations research methodologies are increasingly being combined to produce efficient, versatile and powerful tools that enhance the decision‐making process. The possible contribution of such tools to the planning of distribution systems for industrial firms and freight carrier service networks and operations is examined and compared.

10.1108/eb007517

Cite

Citations (3)

Optimisation de tournées de techniciens en temps réel

HAL (Le Centre pour la Communication Scientifique Directe) (2011)

Sixtine Binart Pierre Dejax Michel Gendreau Frédéric Semet

Source

Cite

Citations (0)

Analytical modelling and control of a hybrid manufacturing/remanufacturing system

IFAC Proceedings Volumes (2013)

Annie Francie Kouedeu Jean‐Pierre Kenné Pierre Dejax Victor Songméné Vladimir Polotski