What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Mathematical optimization
- Algorithm
His primary areas of investigation include Vehicle routing problem, Mathematical optimization, Routing, Operations research and Service.
His studies deal with areas such as Cluster analysis, Metaheuristic and Heuristic as well as Vehicle routing problem.
The study incorporates disciplines such as Dynamic programming and Pruning in addition to Heuristic.
His study on Travelling salesman problem, 2-opt and Bottleneck traveling salesman problem is often connected to Time windows and Cross-entropy method as part of broader study in Mathematical optimization.
His Routing study combines topics in areas such as Software engineering, Knowledge management and Benchmark.
The concepts of his Service study are interwoven with issues in Decision problem, Time horizon and Heuristic.
His most cited work include:
- An Exact ε-constraint Method for Bi-objective Combinatorial Optimization Problems - Application to the Traveling Salesman Problem with Profits (237 citations)
- Adaptive Memory Programming: A Unified View of Meta-Heuristics (198 citations)
- DYNAMIC VEHICLE ROUTING AND DISPATCHING (165 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Mathematical optimization, Vehicle routing problem, Heuristic, Routing and Operations research.
Jean-Yves Potvin focuses mostly in the field of Mathematical optimization, narrowing it down to topics relating to Benchmark and, in certain cases, Large neighborhood search.
His work investigates the relationship between Vehicle routing problem and topics such as Artificial intelligence that intersect with problems in Machine learning.
Jean-Yves Potvin combines subjects such as Genetic algorithm, Computation, Reduction and Heuristic with his study of Heuristic.
He interconnects Node, Service and Job shop scheduling in the investigation of issues within Routing.
His work in Operations research addresses subjects such as Scheduling, which are connected to disciplines such as Cluster analysis.
He most often published in these fields:
- Mathematical optimization (45.92%)
- Vehicle routing problem (41.84%)
- Heuristic (22.45%)
What were the highlights of his more recent work (between 2016-2021)?
- Mathematical optimization (45.92%)
- Routing (21.43%)
- Vehicle routing problem (41.84%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Mathematical optimization, Routing, Vehicle routing problem, Job shop scheduling and Metaheuristic.
His work on Tabu search and Heuristics as part of general Mathematical optimization research is often related to Crew, thus linking different fields of science.
His Vehicle routing problem study incorporates themes from Operations research and Benchmark.
His Operations research research incorporates themes from Simulation and Heuristic.
His study focuses on the intersection of Job shop scheduling and fields such as Branch and price with connections in the field of Solver and Distributed computing.
His studies deal with areas such as Spare part, Scheduling, Theoretical computer science and Graph theory as well as Metaheuristic.
Between 2016 and 2021, his most popular works were:
- Heuristics for tactical time slot management: a periodic vehicle routing problem view (22 citations)
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints (19 citations)
- Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility (13 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Mathematical optimization
- Algorithm
Jean-Yves Potvin mainly investigates Mathematical optimization, Job shop scheduling, Benchmark, Heuristics and Vehicle routing problem.
His study in Mathematical optimization is interdisciplinary in nature, drawing from both Routing, Scheduling and Operations research.
His Scheduling research integrates issues from Theoretical computer science, Tabu search, Metaheuristic, Graph theory and Evolutionary algorithm.
His Operations research research is multidisciplinary, incorporating elements of Time horizon and Heuristic.
In the subject of general Integer programming, his work in Branch and price and Integer linear programming model is often linked to Multiple time and Technician, thereby combining diverse domains of study.
His work on Constraint programming expands to the thematically related Local consistency.
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.
