International audienceSupply chain network design (SCND) models and methods have been the subject of several recent literature review surveys, but none of them explicitly includes sustainable development as a main characteristic of the problem considered. The aim of this review is to bridge this gap. The paper analyzes 87 papers in the field of supply chain network design, covering mathematical models that include economic factors as well as environmental and/or social dimensions. The review is organized along four research questions asking (i) which environmental and social objectives are included, (ii) how are they integrated into the models, (iii) which methods and tool are used and finally (iv) which industrial applications and contexts are covered in these models. The review finds that there are a number of limitations to the current research in sustainable SCND. The narrow scope of environmental and social measures in current models should go beyond limited greenhouse gas indicators to broader life-cycle approaches including new social metrics. The more effective inclusion of uncertainty and risk in models with improved multi-objective approaches is also needed. There are also significant gaps in the sectors used to test models limiting more general applicability. The paper concludes with promising new avenues of research to more effectively include sustainability into SCND models

International audienc

International audiencen this article, we address a problem of the transportation of people with disabilities where customers are served on an almost daily basis and expect some consistency in the service. We introduce an original model for the time-consistency of the service, based on so-called time-classes. We then define a new multiday vehicle routing problem (VRP) that we call the Time-Consistent VRP. We address the solution of this new problem with a large neighborhood search heuristic. Each iteration of the heuristic requires solving a complex VRP with multiple time windows and no waiting time which we tackle with a heuristic branch-and-price method. Computational tests are conducted on benchmark sets and modified real-life instances. Results demonstrate the efficiency of the method and highlight the impact of time-consistency on travel costs. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 211-224 201

International audienc

No abstract

The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8% on real-life instances.

No abstract

No abstract