About: Olivier Péton

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Olivier Péton Goto Sponge NotDistinct Permalink

An Entity of Type : foaf:Person, within Data Space : data.idref.fr associated with source document(s)

Attributes	Values
type	Person
sameAs	Péton, Olivier Péton, Olivier Péton, Olivier
preferred label	Péton, Olivier
name	Olivier Péton
dbpedia-owl:citizenship	http://sws.geonames.org/3017382/
Language	http://lexvo.org/id/iso639-3/fra
Given name	Olivier
familyName	Péton
has biographical i...tion (Deprecated)	Co-directeur d’une thèse préparée au laboratoire Décision et Information pour les Systèmes de Production (DISP) et soutenue à l’INSA Lyon en 2019 Maître assistant à l'École des Mines de Nantes, département Automatique et productique en 2008, HDR en 2014, Professeur, Mines de Nantes ayant fusionné avec Télécom Bretagne le 2017-01-01 pour former IMT Atlantique
gender	male
ORCID iD	0000-0002-3652-0740
org:hasMembership	http://www.idref.fr/136744656/affiliation/2 http://www.idref.fr/136744656/affiliation/1
org:memberOf	Laboratoire des Sciences du Numérique de Nantes École nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire (2017-....)
Scopus ID	7801580679
is sameAs of	Péton, Olivier Péton, Olivier
is Thesis advisor of	http://www.sudoc.fr/198111282/id http://www.sudoc.fr/136748945/id http://www.sudoc.fr/247119504/id Conception et planification stratégique des réseaux logistiques complexes http://www.sudoc.fr/265201446/id http://www.sudoc.fr/264844009/id
is Praeses of	http://www.sudoc.fr/264914058/id http://www.sudoc.fr/224856480/id
is Author of	The pickup and delivery problem with shuttle routes A Dynamic Discretization approach to the integrated Service Network Design and Vehicle Routign Problem A multi-criteria large neighborhood search for the transportation of disabled people A model and bi-objective solution technique for green sustainable supply chain network design A new consistent vehicle routing problem for the transportation of people with disabilities Reinforcement of the large neighborhood search heuristic for generalized vehicle routing problems The heterogeneous dial-a-ride problem with reconfigurable vehicle capacity A Large Neighborhood Search approach to the Vehicle Routing Problem with Delivery Options A large neighborhood search heuristic for supply chain network design Simple Temporal Problems in Route Scheduling for the Dial-a-Ride Problem with Transfers Optimisation de l'organisation de bourses d'échanges de technologie The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity A Continuous-time Service Network Design and Routing Problem A Large Neighborhood Search approach to integrate delivery options in last mile delivery Métaheuristique et mélanges gaussiens The time consistent Dial-a-Ride Problem in the transport of people with disabilities Une méthode homogène pour la problème de séparation de données An ALNS and route scheduling algorithms for the Dial-A-Ride Problem with Transfers Optimisation du transport d’enfants en situation de handicap avec mutualisation de véhicules reconfigurables Comparaison de trois heuristiques pour la planification stratégique de réseaux logistiques Conception d'un réseau logistique mutualisé entre fournisseurs de la grande distribution. Dial-a-ride problem for disabled people using vehicles with reconfigurable capacity Location of concentration warehouses in a pooled distribution network in the retail sector Optimisation d'un système de transport urbain mixte passagers/marchandises A Large Neighborhood Search based heuristic for Supply Chain Network Design A column generation approach for a pooled network design problem with vehicle management constraints and piecewise linear cost structures An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers https://orbi.uliege.be/handle/2268/256906#id Joint optimization of supply chain network design and finance Feasibility algorithms for two pickup and delivery problems with transfers Solving the large-scale min-max K-rural postman problem for snow plowing The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity The Dial-a-ride problem with school bell adjustment Efficient feasibility testing for request insertion in the Pickup and Delivery Problem with Transfers https://hal.archives-ouvertes.fr/hal-00745813#id A lexicographic minimax approach to the vehicle routing problem with route balancing A stakeholder oriented approach to the optimization of transports of people with disabilities Optimization of customer orders routing in a collaborative distribution network Integrated School Bell Time Adjustment and Vehicle Routing for Paratransit Optimization Combined routing and staff scheduling model for home health care A facility location problem for the design of a collaborative distribution network Hybridizing Large Neighborhood Search and Exacts Methods for Generalized Vehicles Routing Problems with Time Windows LNS based Matheuristic for the Dial-a-Ride Problem Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem Modélisation d'un problème de conception de chaîne logistique pour une entreprise de travaux publics A state of the art of supply chain design models and methods integrating the principles of sustainable development Location of distribution centers in a multi-period collaborative distribution network Multi-directional local search for a bi-objective vehicle routing problem with lexicographic minimax load balancing Optimization of a shared passengers and goods urban transportation network Network design of a multi-period collaborative distribution system A sampling matheuristic for the location inventory routing problem A matheuristic for a two-echelon vehicle routing problem with satellite capacities and reverse flows A linear relaxation-based heuristic approach for logistics network design Un système d'aide à la décision pour planifier les transports vers les établissements médico-sociaux Models and methods for an integrated load plan design and vehicle routing problem A new time-consistent vehicle routing problem for the transportation of handicapped persons A DC programming heuristic applied to the logistics network design problem Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers The dial-a-ride problem with transfers Joint location of facilities and mobile resources: an application to the sector of public works Un système d'aide à la décision pour le transport collectif de personnes handicapées The Dial-A-Ride Problem with School Bell time Adjustment https://orbi.uliege.be/handle/2268/256904#id https://orbi.uliege.be/handle/2268/256908#id A mathematical model for integrated supply chain network design and financial planning A Branch-and-Cut-and-Price approach for the Pickup and Delivery Problem with Shuttle Routes Introduction to the special issue on advances in vehicle routing and logistics optimization: heuristics Collaborative load plan design in the retail market: The pickup hub and delivery problem A three step decomposition approach for a transportation network design problem with non-linear costs Collaborative distribution: from the network design to an operational load plan https://hal.archives-ouvertes.fr/hal-01922934#id

Faceted Search & Find service v1.13.91 as of Aug 16 2018

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software