Search

Your search keyword '"Vercraene, Samuel"' showing total 27 results
Start Over Author "Vercraene, Samuel"
27 results on '"Vercraene, Samuel"'

1. {\'E}tude pour l'analyse et l'optimisation du transport des personnes en situation de handicap

Author

Tellez, Oscar, Daguet, Laurent, Lehuédé, Fabien, Monteiro, Thibaud, Montoya, Geovanny Osorio, Péton, Olivier, and Vercraene, Samuel

Subjects
Computer Science - Computers and Society, Physics - Physics and Society
Abstract

From 2010, the medical transport has become one of the top ten priorities of the risk management plan in France because of the increase in the cost. For social and medico-social institutions (MSI), this cost represents the second after that of the wages. In this context, the project NOMAd aims an overall improvement of the daily transport of people between their home and their (MSI). To this end, we propose the sharing of transport between several ESMS. This mutualization of transport makes possible to gather and optimize routes in a certain geographical area. The challenge is to improve economic performance while maintaining economic, social and environmental goals. From a scientific point of view, the studied problem is called the Time-Consistent-Dial-a-Ride Problem and aims to find a compromise between the objectives of the cost of transport and the consistency of the service. Given the complexity of the problem, we seek, first of all, to solve the problem for half a day. Then we consider the whole week. To solve these problems, we use the Large Neighborhood Search meta-heuristic and a master problem based on the Set Covering Problem., Comment: in French

Published
2018

6. Economic optimisation of cold production: a matheuristic with artificial neural network approach.

Author

Ribault, Alnour, Vercraene, Samuel, Henry, Sébastien, and Ouzrout, Yacine

Subjects
ARTIFICIAL neural networks, COST control, MAINTENANCE costs, OPERATING costs, COLD (Temperature)
Abstract

In this paper, the economic optimisation of cold storage is studied. A modern cold room is mainly composed of compressors, a tank to store heat-transfer fluid and cold rooms. The main cost is incurred by energy consumption and maintenance. The price of electricity, which is known in advance, varies during the day. Production schedules that entail higher risks of compressor wear, and thus high maintenance costs, have to be avoided. The temperature inside the cold rooms must be maintained within the allowed range, and complex thermodynamic processes make it difficult to predict temperature. The tank has a limited capacity. This paper presents the first model optimising the management cost of a cold store with a tank. Maintenance costs are considered for compressors, and Artificial Neural Networks are used to forecast the temperatures in the cold rooms. An optimal Dynamic Programme is designed for the case with one cold room and a matheuristic algorithm is presented for the general case with several cold rooms. A comparison with a classical hysteresis controller shows significant savings. The impact of storage capacity on operating costs is evaluated, after which the influence of the maintenance cost value is discussed. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

9. Integrated School Bell Time Adjustment and Vehicle Routing for Paratransit Optimization

Author

Vercraene, Samuel, Lehuédé, Fabien, Monteiro, Thibaud, Péton, Olivier, Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
paratransit, matheuristic, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], vehicle routing, dial-a-ride problem
Abstract

International audience

Published
2022

12. Consistent-DARP

Author

Tellez, Oscar, Vercraene, Samuel, Lehuédé, Fabien, Péton, Olivier, Monteiro, Thibaud, and Vercraene, Samuel

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, ComputingMilieux_MISCELLANEOUS
Published
2019

13. The time‐consistent dial‐a‐ride problem.

Author

Tellez, Oscar, Vercraene, Samuel, Lehuédé, Fabien, Péton, Olivier, and Monteiro, Thibaud

Subjects
VEHICLE routing problem, PARATRANSIT services, TRANSPORTATION planning, QUALITY of service
Abstract

In the context of door‐to‐door transportation of people with disabilities, service quality considerations such as maximum ride time and service time consistency are critical requirements. To identify a good trade‐off between these considerations and economic objectives, we define a new variant of the multiperiod dial‐a‐ride problem called the time‐consistent dial‐a‐ride problem. A transportation planning is supposed to be time consistent if for each passenger, the same service time is used all along the planning horizon. However, considering the numerous variations in transportation demands over a week, designing consistent plans for all passengers can be too expensive. It is therefore necessary to find a compromise solution between costs and time‐consistency objectives. The time‐consistent dial‐a‐ride problem is solved using an epsilon‐constraint approach to illustrate the trade‐off between these two objectives. It computes an approximation of the Pareto front, using a matheuristic framework that combines a large neighbourhood search with the solution of set partitioning problems. This approach is benchmarked on time‐consistent vehicle routing problem literature instances. Experiments are also conducted in the context of door‐to‐door transportation for people with disabilities, using real data. These experiments support managerial insights regarding the inter‐relatedness of costs and quality of service. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

16. The Dial-a-ride problem with school bell adjustment

Author

Vercraene, Samuel, Lehuédé, Fabien, Monteiro, Thibaud, Péton, Olivier, Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and Institut National des Sciences Appliquées (INSA)-Université de Lyon

Subjects
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2019

17. {��}tude pour l'analyse et l'optimisation du transport des personnes en situation de handicap

Author

Tellez, Oscar, Daguet, Laurent, Lehu��d��, Fabien, Monteiro, Thibaud, Montoya, Geovanny Osorio, P��ton, Olivier, and Vercraene, Samuel

Subjects
FOS: Computer and information sciences, Computers and Society (cs.CY), FOS: Physical sciences, Physics and Society (physics.soc-ph)
Abstract

From 2010, the medical transport has become one of the top ten priorities of the risk management plan in France because of the increase in the cost. For social and medico-social institutions (MSI), this cost represents the second after that of the wages. In this context, the project NOMAd aims an overall improvement of the daily transport of people between their home and their (MSI). To this end, we propose the sharing of transport between several ESMS. This mutualization of transport makes possible to gather and optimize routes in a certain geographical area. The challenge is to improve economic performance while maintaining economic, social and environmental goals. From a scientific point of view, the studied problem is called the Time-Consistent-Dial-a-Ride Problem and aims to find a compromise between the objectives of the cost of transport and the consistency of the service. Given the complexity of the problem, we seek, first of all, to solve the problem for half a day. Then we consider the whole week. To solve these problems, we use the Large Neighborhood Search meta-heuristic and a master problem based on the Set Covering Problem., in French

Published
2018
Full Text
View/download PDF

18. Planification des opérations de ballastage pour la maintenance des voies ferrées

Author

Roux-Sablier, Marion, Ladier, Anne-Laure, Vercraene, Samuel, Bontems, Thomas, Ladier, Anne-Laure, Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2018

19. Logistical Optimization of Nuclear Waste Flows during Decommissioning

Author

Dottavio, Giannina, Andrade, M. F., Renard, Frédéric, Cheutet, Vincent, Ladier, Anne-Laure, Vercraene, Samuel, HOANG, Phuong, Briet, S., Dachicourt, Rémi, Baizet, Y., Altran Research, ALTRAN (FRANCE), Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), and Ladier, Anne-Laure

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], decision-support framework, logistical optimization, waste management, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS, Nuclear decommissioning
Abstract

International audience

Published
2016

20. Optimal control of a production-inventory system with product returns

Author

Vercraene, Samuel, Gayon, Jean-Philippe, Gestion et Conduite des Systèmes de Production (G-SCOP_GCSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Vercraene, Samuel

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Multi-echelon systems, Queueing, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Markov decision process, Product returns, Inventory control
Abstract

International audience; We consider a production-inventory system that consists of n stages. Each stage has a finite production capacity modelled by an exponential server. The downstream stage faces a Poisson demand. Each stage receives returns of products according to independent Poisson processes that can be used to serve demand. The problem is to control production to minimize discounted (or average) holding and backordering costs. For the single-stage problem (n = 1), we fully characterize the optimal policy. We show that the optimal policy is base-stock and we derive an explicit formula for the optimal base- stock level. For the general n-stage problem, we show that the optimal policy is characterized by state-dependent base-stock levels. In a numerical study, we investigate three heuristic policies: the base-stock policy, the Kanban policy and the fixed buffer policy. The fixed-buffer policy obtains poor results while the relative performances of base-stock and Kanban policies depend on bottlenecks. We also show that returns have a non-monotonic effect on average costs and strongly affect the performances of heuristics. Finally, we observe that having returns at the upstream stage is preferable in some situations.

Published
2013

21. Analyse de sensibilité dans une classe de processus de décision markoviens

Author

Vercraene, Samuel, Gayon, Jean-Philippe, Karaesmen, Fikri, Gestion et Conduite des Systèmes de Production (G-SCOP_GCSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Department of Industrial Engineering, Koç University, and Vercraene, Samuel

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], contrôle optimal, Processus de décision markovien, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], analyse de sensibilité
Abstract

National audience; We focus on the class of queuing system control problem involving a cost minimization or a reward maximization. It is well established that in many of these problems the optimal policy is a state dependent threshold policy. When several system parameters values are changed, we show that it is sometimes possible to predict the evolution of optimal policy. Our approach is based on the propagation of certain properties of the MDP formalization value function. We illustrate this study on two instances, a tandem queue in production/inventory context and a admission control problem.

Published
2013

22. Coordination of manufacturing, remanufacturing and returns acceptance in a hybrid production-inventory system

Author

Vercraene, Samuel, Flapper, S.D.P., Gayon, Jean-Philippe, Vercraene, Samuel, Gestion et Conduite des Systèmes de Production (G-SCOP_GCSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Eindhoven University of Technology [Eindhoven] (TU/e)

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], inventory control, return acceptance, Remanufacturing
Abstract

International audience; This paper studies the coordination of manufacturing, remanufacturing and returns acceptance in a hybrid system. We use a queueing control framework, where manufacturing and remanufacturing are modeled by single servers with exponentially distributed processing times. Customer demands and returned products arrive in the system according to independent Poisson processes. A returned product can be either rejected or accepted. When accepted, a return is placed in a remanufacturable inventory. New products and remanufactured products are placed in a serviceable inventory and customer demands can be satisfied by new products or remanufactured ones. For a cost structure including holding, backorder, manufacturing, admission and rejecting costs, we show that the optimal policy is characterized by two state-dependent base-stock thresholds and one state-dependent acceptance threshold. We also obtain monotonicity results for these switching curves. Then we adapt several heuristic policies from the literature to our model. Finally we carry out a numerical study to compare their performances to the ones of the optimal policy.

Published
2012

23. A two-stage production/inventory system with admission control of product returns

Author

Vercraene, Samuel, Gayon, Jean-Philippe, Vercraene, Samuel, Gestion et Conduite des Systèmes de Production (G-SCOP_GCSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), and Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Production/Inventory system, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Optimal Control, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Multi-echelon, Remanufacturing, Reverse logistics
Abstract

ISBN 978-2-9600532-3-4; International audience; We consider a two-stage production-inventory system. Each stage is made of an exponential production server and an output inventory. The downstream inventory faces a Poisson demand and each inventory receives product returns that can be either accepted or rejected. The objective is to find a production/admission policy minimizing the expected discounted costs over an infinite horizon. We consider linear holding, backorder, production, admission and rejecting costs. We show that the optimal policy is characterized by state-dependent base-stock levels and state-dependent disposal thresholds. We also obtain monotonicity results for these switching curves. Interestingly, our results can be transposed to an hybrid single- echelon system with a production facility and a remanufacturing facility, both with exponential leadtimes. Finally, we design heuristics to control production and disposal and we carry out a numerical study to investigate their performances.

Published
2011

24. Gestion des stocks et de la production intégrant des retours de produits

Author

Vercraene, Samuel, Gestion et Conduite des Systèmes de Production (G-SCOP_GCSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF), Université de Grenoble, Yannick Frein, Jean-Philippe Gayon, and STAR, ABES

Subjects
Optimal policy, [SPI.OTHER]Engineering Sciences [physics]/Other, Politique optimale, [SPI.OTHER] Engineering Sciences [physics]/Other, MDP, Reverse logistics, Logistique inverse
Abstract

Flows of returns due to recycling and reusing waste are developing in order to preserve the limited natural resources of our planet. These new flows interact with the traditional production flows. Therefore, in order to provide customers with the best service level and minimize the stock in the supply chain, the control of the return flows appears to be of highest importance. We address this problem by modeling a situation with a limited porduction capacity and we consider an operational production/inventory problem that incorporates flows of returns. We model three continuous-time production/inventory problems with limited produc- tion capacities, random lead times, and linear costs. In the first problem we take into account the probability that a product can be reused as a finished product or only as semi-finished product (by parts), in the second problem we include a step of remanufac- turing before reusing the returned product, and in the third problem we consider a system with product returns that are announced in advance by the customers. Apart from the caracterization of the optimal policies for these cases, the performance assessments of some heuristic policies and the study of the poduction capacity effect on these heuristic policies stand as main contributions. Throughout this work we have used existing tools to characterize optimal policies for different Markov decision processes. The last chapter aims to improve these tools and enable us to study the influence of several system parameters on its optimal policy., De nombreux retours de produits dus au recyclage et à la réutilisation des déchets se développent dans le but de préserver les ressources naturelles limitées de notre planète. Ces nouveaux flux interagissant avec les flux de production traditionnels, il est important de les piloter de façon à satisfaire au mieux les demandes des clients et minimiser l'encours dans la chaîne logistique. Nos travaux s'inscrivent dans cette démarche. Nous nous plaçons dans un contexte où la capacité de production est limitée et nous considérons un problème opérationnel de gestion des stocks et de la production intégrant des flux de retours. Nous modélisons trois problèmes de production et de stockage à temps continu, avec des capacités de production limitées, des délais aléatoires et des coûts linéaires. Le premier prenant en compte la probabilité qu'un produit puisse être réutilisé comme produit fini ou seulement comme produit semi-fini (par partie), le deuxième présentant un problème où la réutilisation d'un retour comme produit fini nécessite une étape de remise à neuf et le troisième modélisant un système où les clients préviennent à l'avance du renvoi potentiel de leurs produits. Outre la caractérisation des politiques optimales de gestion, une part importante de nos contributions réside dans l'évaluation des performances de différentes politiques heuristiques et l'étude de l'impact de la capacité de production sur celles-ci. Enfin, nous nous servons dans tout ce document d'outils permettant la caractérisation des politiques optimales. La dernière partie de ce document vise à développer ces outils et à permettre l'étude de l'effet des paramètres d'un système formulé en processus de décision Markovien sur la politique optimale de celui-ci.

Published
2012

25. Optimisation économique de la production d'énergie thermique avec stockage

Author

Alnour Ribault, Samuel Vercraene, Sébastien HENRY, Yacine Ouzrout, Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), and Vercraene, Samuel

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2017

26. LNS based Matheuristic for the Dial-a-Ride Problem

Author

Oscar Tellez, Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro, Décision et Information pour les Systèmes de Production (DISP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), and Vercraene, Samuel

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2016

27. The heterogeneous dial-a-ride problem with reconfigurable vehicle capacity

Author

Oscar Tellez, Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro, Décision et Information pour les Systèmes de Production (DISP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Vercraene, Samuel, Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2016

Catalog

Books, media, physical & digital resources
See catalog results