2021 - Izaak Walton Killam Memorial Prize, Canada Council
2019 - Member of the National Academy of Engineering For domain-defining contributions to the theory and practice of vehicle routing, facility location, and distribution management.
2018 - Prix Marie-Victorin, Government of Quebec
2005 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
His main research concerns Vehicle routing problem, Mathematical optimization, Operations research, Tabu search and Routing. The Vehicle routing problem study combines topics in areas such as Metaheuristic, Heuristic, Simulation, Mathematical model and Integer programming. His biological study spans a wide range of topics, including Algorithm and Benchmark.
Gilbert Laporte interconnects Linear programming, Scheduling, Scheduling and Arc routing in the investigation of issues within Operations research. His studies deal with areas such as Tabu search heuristic, Local search and Search algorithm as well as Tabu search. His Routing research integrates issues from Function, Stochastic process and Fuel efficiency.
Mathematical optimization, Operations research, Vehicle routing problem, Routing and Travelling salesman problem are his primary areas of study. His research combines Algorithm and Mathematical optimization. His Operations research research is multidisciplinary, incorporating perspectives in Time horizon, Linear programming, Scheduling, Project management and Integer programming.
His work carried out in the field of Vehicle routing problem brings together such families of science as Metaheuristic, Static routing, Benchmark, Mathematical model and Combinatorial optimization. The Travelling salesman problem study combines topics in areas such as Hamiltonian path and Combinatorics. Gilbert Laporte has researched Tabu search in several fields, including Tabu search heuristic and Search algorithm.
Gilbert Laporte mainly focuses on Mathematical optimization, Operations research, Routing, Vehicle routing problem and Metaheuristic. His study in Heuristic, Heuristic, Integer programming, Linear programming and Travelling salesman problem falls within the category of Mathematical optimization. In his study, Rapid transit is strongly linked to Network planning and design, which falls under the umbrella field of Operations research.
His work carried out in the field of Routing brings together such families of science as Algorithm, Simulation and Benchmark. Computer network covers Gilbert Laporte research in Vehicle routing problem. His studies deal with areas such as Large neighborhood search and Job shop scheduling as well as Metaheuristic.
His primary scientific interests are in Mathematical optimization, Vehicle routing problem, Routing, Metaheuristic and Heuristic. His is doing research in Travelling salesman problem, Linear programming, Time horizon, Heuristics and Column generation, both of which are found in Mathematical optimization. His study focuses on the intersection of Heuristics and fields such as Scheduling with connections in the field of Operations research and Grid.
Vehicle routing problem is a subfield of Computer network that he studies. His Routing research is multidisciplinary, incorporating elements of Iterated local search, Cover, Evolutionary algorithm and Benchmark. His Heuristic research is multidisciplinary, incorporating perspectives in Robust optimization, Integer programming and Heuristic.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The vehicle routing problem: An overview of exact and approximate algorithms
European Journal of Operational Research (1992)
A tabu search heuristic for the vehicle routing problem
Michel Gendreau;Alain Hertz;Gilbert Laporte.
Management Science (1994)
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Jean-François Cordeau;Michel Gendreau;Gilbert Laporte.
A unified tabu search heuristic for vehicle routing problems with time windows
Jean-François Cordeau;Gilbert Laporte;Anne Mercier.
Journal of the Operational Research Society (2001)
Classical and modern heuristics for the vehicle routing problem
Gilbert Laporte;Michel Gendreau;Jean-Yves Potvin;Frédéric Semet.
International Transactions in Operational Research (2000)
The traveling salesman problem: An overview of exact and approximate algorithms
European Journal of Operational Research (1992)
Metaheuristics: A bibliography
Ibrahim H. Osman;Gilbert Laporte.
Annals of Operations Research (1996)
Fifty Years of Vehicle Routing
Transportation Science (2009)
Ambulance location and relocation models
Luce Brotcorne;Gilbert Laporte;Gilbert Laporte;Frédéric Semet;Frédéric Semet.
European Journal of Operational Research (2003)
A guide to vehicle routing heuristics
Jean-François Cordeau;Michel Gendreau;Gilbert Laporte;Jean-Yves Potvin.
Journal of the Operational Research Society (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: