Olivier Péton

According to our database1, Olivier Péton authored at least 21 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Multi-directional local search for sustainable supply chain network design.
Int. J. Prod. Res., 2021

2020
A lexicographic minimax approach to the vehicle routing problem with route balancing.
Eur. J. Oper. Res., 2020

2019
Network design of a multi-period collaborative distribution system.
Int. J. Mach. Learn. Cybern., 2019

Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem.
EURO J. Transp. Logist., 2019

2018
Introduction to the special issue on advances in vehicle routing and logistics optimization: heuristics.
EURO J. Transp. Logist., 2018

{É}tude pour l'analyse et l'optimisation du transport des personnes en situation de handicap.
CoRR, 2018

2017
Solving the large-scale min-max K-rural postman problem for snow plowing.
Networks, 2017

Optimization of a city logistics transportation system with mixed passengers and goods.
EURO J. Transp. Logist., 2017

A large neighborhood search heuristic for supply chain network design.
Comput. Oper. Res., 2017

2016
Location of distribution centers in a multi-period collaborative distribution network.
Electron. Notes Discret. Math., 2016

A Facility Location Problem for the Design of a Collaborative Distribution Network.
Proceedings of the Internet and Distributed Computing Systems, 2016

2014
A new consistent vehicle routing problem for the transportation of people with disabilities.
Networks, 2014

A multi-criteria large neighbourhood search for the transportation of disabled people.
J. Oper. Res. Soc., 2014

A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes.
Eur. J. Oper. Res., 2014

The Dial-A-Ride Problem with Transfers.
Comput. Oper. Res., 2014

Modèles et méthodes d'optimisation combinatoire pour la conception de chaînes logistiques et l'optimisation des transports.
, 2014

2013
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers.
Transp. Sci., 2013

Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers.
Oper. Res. Lett., 2013

2012
Simple Temporal Problems in Route Scheduling for the Dial-a-Ride Problem with Transfers.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2010
A linear relaxation-based heuristic approach for logistics network design.
Comput. Ind. Eng., 2010

2003
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method.
Comput. Optim. Appl., 2003


  Loading...