Frédéric Semet mainly investigates Operations research, Tabu search, Emergency medical services, Mathematical optimization and Vehicle routing problem. He does research in Tabu search, focusing on Guided Local Search specifically. His Emergency medical services research spans across into subjects like Relocation and Tabu search heuristic.
In general Mathematical optimization study, his work on Column generation often relates to the realm of Context, Schedule and Nurse scheduling problem, thereby connecting several areas of interest. His Vehicle routing problem research is multidisciplinary, incorporating elements of Travelling salesman problem, Combinatorial optimization and Heuristics. He has researched Heuristics in several fields, including Scheduling and Computer engineering.
Frédéric Semet spends much of his time researching Mathematical optimization, Operations research, Vehicle routing problem, Routing and Travelling salesman problem. His Operations research research is multidisciplinary, relying on both Scheduling, Tabu search and Time horizon. His Tabu search research is multidisciplinary, incorporating perspectives in Tabu search heuristic and Combinatorial optimization.
His work on Large neighborhood search as part of general Vehicle routing problem study is frequently connected to Destination-Sequenced Distance Vector routing and Time windows, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. The study incorporates disciplines such as Network planning and design, Division, Heuristic and Heuristic in addition to Routing. In his research, Frédéric Semet undertakes multidisciplinary study on Relocation and Emergency medical services.
His main research concerns Mathematical optimization, Operations research, Heuristic, Routing and Heuristic. Frédéric Semet combines subjects such as Vehicle routing problem and Logistics network design with his study of Mathematical optimization. His study on Large neighborhood search is often connected to Benchmark, Time windows and Context as part of broader study in Vehicle routing problem.
His study deals with a combination of Operations research and Order picking. Vertex is closely connected to Computation in his research, which is encompassed under the umbrella topic of Heuristic. His Network planning and design course of study focuses on Service and Transportation planning and Heuristics.
His primary scientific interests are in Routing, Heuristic, Mathematical optimization, Heuristic and Operations research. His studies in Heuristic integrate themes in fields like Branch and cut, Travelling salesman problem, Interval and Directed graph. His study in Mathematical optimization is interdisciplinary in nature, drawing from both Vehicle routing problem and Inventory routing problem.
His Large neighborhood search study in the realm of Vehicle routing problem connects with subjects such as Operator, Commodity and Time windows. The various areas that Frédéric Semet examines in his Heuristic study include Vertex, Computation, Integer programming and Vertex. His work deals with themes such as Dynamic programming, Division and Focus, which intersect with Operations research.
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.
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)
Ambulance location and relocation models
Luce Brotcorne;Gilbert Laporte;Gilbert Laporte;Frédéric Semet;Frédéric Semet.
(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)
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
Michel Gendreau;Gilbert Laporte;Gilbert Laporte;Frédéric Semet;Frédéric Semet.
parallel computing (2001)
Multi-objective vehicle routing problems
Nicolas Jozefowiez;Nicolas Jozefowiez;Frédéric Semet;El-Ghazali Talbi.
European Journal of Operational Research (2008)
Solving an ambulance location model by tabu search
Michel Gendreau;Gilbert Laporte;Frédéric Semet.
Location Science (1997)
A generalized linear programming model for nurse scheduling
Brigitte Jaumard;Frédéric Semet;Tsevi Vovor.
European Journal of Operational Research (1998)
Solving real-life vehicle routing problems efficiently using tabu search
Frédéric Semet;Eric Taillard.
Annals of Operations Research (1993)
The Covering Tour Problem
Michel Gendreau;Gilbert Laporte;Frédéric Semet.
Operations Research (1997)
A tabu search heuristic for the undirected selective travelling salesman problem
Michel Gendreau;Gilbert Laporte;Frédéric Semet.
European Journal of Operational Research (1998)
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:
HEC Montréal
Polytechnique Montréal
University of Lille
University of Bologna
École des Mines de Saint-Étienne
Concordia University
Polytechnique Montréal
University of Montreal
University of Bologna
University of Vienna
Stanford University
University of Wisconsin–Madison
University of Erlangen-Nuremberg
Joint Genome Institute
National Taiwan Ocean University
Agricultural Research Service
University of California, Berkeley
National Institutes of Natural Sciences
Harvard University
University of Calgary
Johns Hopkins University
Beth Israel Deaconess Medical Center
National and Kapodistrian University of Athens
University of Hawaii System
University of Chicago
University of Bologna