Stefan Voß mostly deals with Mathematical optimization, Operations research, Heuristics, Tabu search and Metaheuristic. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Transformation, Algorithm and Flow shop scheduling. His research in Operations research intersects with topics in Berth allocation problem, Terminal, Production planning, Supply chain and Quay crane.
His Quay crane research integrates issues from Crane scheduling, Terminal operation, State, Containerization and Load planning. His study looks at the intersection of Tabu search and topics like Optimization problem with Artificial intelligence and Decision problem. His Metaheuristic research is multidisciplinary, incorporating elements of Scheduling, Local search, Software engineering and Extremal optimization.
The scientist’s investigation covers issues in Mathematical optimization, Metaheuristic, Heuristics, Operations research and Tabu search. His Mathematical optimization research is multidisciplinary, relying on both Algorithm and Benchmark. Stefan Voß has included themes like Optimization problem, Local search, Ant colony optimization algorithms and GRASP in his Metaheuristic study.
His studies deal with areas such as Simple and Heuristic as well as Heuristics. The various areas that Stefan Voß examines in his Operations research study include Supply chain and Berth allocation problem. He combines subjects such as Simulated annealing and Travelling salesman problem with his study of Tabu search.
Stefan Voß spends much of his time researching Mathematical optimization, Metaheuristic, Set, Heuristics and Operations research. His Mathematical optimization study integrates concerns from other disciplines, such as Quay crane and Benchmark. His biological study spans a wide range of topics, including Ant colony optimization algorithms, Greedy algorithm and GRASP.
His work carried out in the field of Heuristics brings together such families of science as Variable, Quadratic assignment problem, Computational intelligence and State. His studies in Operations research integrate themes in fields like Linear programming and Job shop scheduling. As a member of one scientific family, Stefan Voß mostly works in the field of Berth allocation problem, focusing on Market share and, on occasion, Port.
His primary scientific interests are in Mathematical optimization, Metaheuristic, Heuristics, Berth allocation problem and Greedy algorithm. The Mathematical optimization study combines topics in areas such as Node, Supply chain management and Project scheduling problem. His work deals with themes such as Ant colony optimization algorithms and GRASP, which intersect with Metaheuristic.
His Heuristics study frequently draws connections between adjacent fields such as Computational intelligence. His Berth allocation problem study combines topics from a wide range of disciplines, such as Market share, Dynamic programming and Operations research. While the research belongs to areas of Greedy algorithm, Stefan Voß spends his time largely on the problem of Heuristic, intersecting his research to questions surrounding Heuristic, State and Plan.
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.
Container terminal operation and operations research — a classification and literature review
Dirk Steenken;Stefan Voß;Robert Stahlbock.
OR Spectrum (2004)
Operations research at container terminals: a literature update
Robert Stahlbock;Stefan Voß.
OR Spectrum (2007)
Simple assembly line balancing—Heuristic approaches
Armin Scholl;Stefan Voß.
Journal of Heuristics (1997)
Meta-heuristics: The State of the Art
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers (2000)
A mathematical formulation and complexity considerations for the blocks relocation problem
Marco Caserta;Silvia Schwarze;Stefan Voß.
European Journal of Operational Research (2012)
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
Stefan Voß;David L. Woodruff.
SteinLib: An Updated Library on Steiner Tree Problems in Graphs
Thorsten Koch;Alexander Martin;Stefan Voß.
A classification of formulations for the (time-dependent) traveling salesman problem
Luis Gouveia;Stefan Voß.
European Journal of Operational Research (1995)
Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics (1992)
Dynamic tabu list management using the reverse elimination method
Frank Dammeyer;Stefan Voß.
Annals of Operations Research (1993)
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: