What is he best known for?
The fields of study he is best known for:
- Mathematical optimization
- Algorithm
- Programming language
His main research concerns Mathematical optimization, Metaheuristic, Vehicle routing problem, Memetic algorithm and Heuristics.
The concepts of his Mathematical optimization study are interwoven with issues in Routing, Arc routing, Upper and lower bounds and GRASP.
He has included themes like Local search, Heuristic and Operations research in his Metaheuristic study.
His Vehicle routing problem study integrates concerns from other disciplines, such as Facility location problem, Tabu search and Local search.
His studies deal with areas such as Transportation theory, Traveling repairman problem and Bounding overwatch as well as Memetic algorithm.
His biological study spans a wide range of topics, including Artificial intelligence and Benchmark.
His most cited work include:
- A simple and effective evolutionary algorithm for the vehicle routing problem (738 citations)
- A survey of recent research on location-routing problems (342 citations)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (288 citations)
What are the main themes of his work throughout his whole career to date?
Christian Prins mainly focuses on Mathematical optimization, Vehicle routing problem, Metaheuristic, Arc routing and Routing.
His research links Set with Mathematical optimization.
His Vehicle routing problem research integrates issues from Algorithm, Travelling salesman problem, Tabu search, Heuristic and Operations research.
As a part of the same scientific study, Christian Prins usually deals with the Metaheuristic, concentrating on Upper and lower bounds and frequently concerns with Cutting-plane method.
His Arc routing research incorporates themes from Node, Genetic algorithm and Crossover.
Christian Prins has researched Routing in several fields, including Branch and cut and Trailer.
He most often published in these fields:
- Mathematical optimization (69.44%)
- Vehicle routing problem (43.89%)
- Metaheuristic (36.67%)
What were the highlights of his more recent work (between 2014-2020)?
- Mathematical optimization (69.44%)
- Vehicle routing problem (43.89%)
- Metaheuristic (36.67%)
In recent papers he was focusing on the following fields of study:
Christian Prins mostly deals with Mathematical optimization, Vehicle routing problem, Metaheuristic, Iterated local search and Linear programming.
Christian Prins merges Mathematical optimization with Distribution networks in his study.
His Vehicle routing problem study results in a more complete grasp of Routing.
His research in Routing intersects with topics in Algorithm, Set and Benchmark.
The various areas that Christian Prins examines in his Metaheuristic study include Greedy randomized adaptive search procedure, Local search and Heuristics.
His work in Linear programming addresses issues such as Heuristic, which are connected to fields such as Integer programming.
Between 2014 and 2020, his most popular works were:
- Models for optimization and performance evaluation of biomass supply chains: An Operations Research perspective (99 citations)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (72 citations)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (42 citations)
In his most recent research, the most cited papers focused on:
- Mathematical optimization
- Algorithm
- Programming language
His primary areas of investigation include Vehicle routing problem, Mathematical optimization, Metaheuristic, Greenhouse gas and Iterated local search.
Christian Prins works mostly in the field of Vehicle routing problem, limiting it down to topics relating to Algorithm and, in certain cases, Scheduling and Theoretical computer science, as a part of the same area of interest.
His Mathematical optimization research includes elements of Routing and Set.
Christian Prins combines subjects such as Local search, Heuristics and Heuristic with his study of Metaheuristic.
His study explores the link between Local search and topics such as Greedy randomized adaptive search procedure that cross with problems in Ant colony optimization algorithms, Heuristic and Memetic algorithm.
His Iterated local search research integrates issues from Variable and Integer.
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.
