André Langevin

According to our database1, André Langevin authored at least 50 papers between 1993 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Solving the clustered traveling salesman problem with -relaxed priority rule.
Int. Trans. Oper. Res., 2022

2021
An inverse optimization approach for a capacitated vehicle routing problem.
Eur. J. Oper. Res., 2021

Robust optimization for the hierarchical mixed capacitated general routing problem applied to winter road maintenance.
Comput. Ind. Eng., 2021

2020
The mixed capacitated general routing problem with time-dependent demands.
Networks, 2020

2019
Street-segment-based salt and abrasive prediction for winter maintenance using machine learning and GIS.
Trans. GIS, 2019

A multi-compartment vehicle routing problem in cold-chain distribution.
Comput. Oper. Res., 2019

2018
Solving the clustered traveling salesman problem with d-relaxed priority rule.
CoRR, 2018

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

Adaptive large neighborhood search algorithm for the rural postman problem with time windows.
Networks, 2017

The rescheduling arc routing problem.
Int. Trans. Oper. Res., 2017

A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.
Comput. Oper. Res., 2017

Erratum to: Approximating the length of Chinese postman tours.
4OR, 2017

2016
Some Interactional Functions of Text in a Text-and-Voice SCMC Chat Session for Language Learning.
Int. J. Comput. Assist. Lang. Learn. Teach., 2016

Location arc routing problem with inventory constraints.
Comput. Oper. Res., 2016

Quantitative approaches for road maintenance.
Proceedings of the Seventh Symposium on Information and Communication Technology, 2016

2014
Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints.
Networks, 2014

The Rural Postman Problem with time windows.
Networks, 2014

Solving the close-enough arc routing problem.
Networks, 2014

Periodic capacitated arc-routing problem with inventory constraints.
J. Oper. Res. Soc., 2014

The multi-district team orienteering problem.
Comput. Oper. Res., 2014

An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size.
Comput. Oper. Res., 2014

Approximating the length of Chinese postman tours.
4OR, 2014

2013
An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices.
Eur. J. Oper. Res., 2013

Integrated scheduling of crane handling and truck transportation in a maritime container terminal.
Eur. J. Oper. Res., 2013

The periodic capacitated arc routing problem with irregular services.
Discret. Appl. Math., 2013

The synchronized arc and node routing problem: Application to road marking.
Comput. Oper. Res., 2013

A survey of models and algorithms for emergency response logistics in electric distribution systems. Part II: Contingency planning level.
Comput. Oper. Res., 2013

A survey of models and algorithms for emergency response logistics in electric distribution systems. Part I: Reliability planning with fault considerations.
Comput. Oper. Res., 2013

2012
An Optimal Constraint Programming Approach to the Open-Shop Problem.
INFORMS J. Comput., 2012

Synchronized arc routing for snow plowing operations.
Comput. Oper. Res., 2012

An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints.
Proceedings of the ICORES 2012, 2012

2011
Collaboration for a two-echelon supply chain in the pulp and paper industry: the use of incentives to increase profit.
J. Oper. Res. Soc., 2011

An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A heuristic method for the capacitated arc routing problem with refill points and multiple loads.
J. Oper. Res. Soc., 2010

2008
Vehicle Routing for Urban Snow Plowing Operations.
Transp. Sci., 2008

The sector design and assignment problem for snow disposal operations.
Eur. J. Oper. Res., 2008

2007
The capacitated arc routing problem with refill points.
Oper. Res. Lett., 2007

A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal.
Comput. Oper. Res., 2007

A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading.
Comput. Oper. Res., 2007

Scheduling and routing of automated guided vehicles: A hybrid approach.
Comput. Oper. Res., 2007

2006
Integrated production and material handling scheduling using mathematical programming and constraint programming.
Eur. J. Oper. Res., 2006

A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal.
Comput. Oper. Res., 2006

A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing.
Comput. Oper. Res., 2006

Road network monitoring: algorithms and a case study.
Comput. Oper. Res., 2006

2004
Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2001
High performing evolutionary techniques for solving complex location problems in industrial system design.
J. Intell. Manuf., 2001

Value Analysis and Optimization of Reusable Containers at Canada Post.
Interfaces, 2001

1997
A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem.
Transp. Sci., 1997

Skeleton-based facility layout design using genetic algorithms.
Ann. Oper. Res., 1997

1993
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows.
Networks, 1993


  Loading...