The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings together two key aspects of higher education: research and teaching. It allows the user to define modern metaheuristics and test their resolution behavior on machine scheduling problems. The software may be used by students and researcher with even little knowledge in the mentioned field of research, as the interaction of the user with the system is supported by an extensive graphical user interface. All functions can be easily parameterized, and expensive software licenses are not required. In order to address a large number o...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
In the last few years, the society is witnessing ever-growing levels of complexity in the optimizati...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...
The main topic of this thesis is the combination of metaheuristics and other methods for solving com...
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathemati...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
Peres, F., & Castelli, M. (2021). Combinatorial optimization problems and metaheuristics: Review, ch...
This dissertation is concerned with configuring stochastic local search for combinatorial optimizati...
There are several approaches for solving hard optimization problems. Mathematical programming techni...
This open access book demonstrates all the steps required to design heuristic algorithms for difficu...
In this dissertation we try to answer the following question: How do we go about solving the problem...
Combinatorial optimization problems arise, in many forms, in vari- ous aspects of everyday life. Now...
PhD ThesisThis thesis considers the usefulness of interaction between a human and a powerful comput...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to m...
Combinatorial optimization problems are ubiquitous in real life and hence a wide range of solving pa...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
In the last few years, the society is witnessing ever-growing levels of complexity in the optimizati...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...
The main topic of this thesis is the combination of metaheuristics and other methods for solving com...
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathemati...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
Peres, F., & Castelli, M. (2021). Combinatorial optimization problems and metaheuristics: Review, ch...
This dissertation is concerned with configuring stochastic local search for combinatorial optimizati...
There are several approaches for solving hard optimization problems. Mathematical programming techni...
This open access book demonstrates all the steps required to design heuristic algorithms for difficu...
In this dissertation we try to answer the following question: How do we go about solving the problem...
Combinatorial optimization problems arise, in many forms, in vari- ous aspects of everyday life. Now...
PhD ThesisThis thesis considers the usefulness of interaction between a human and a powerful comput...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to m...
Combinatorial optimization problems are ubiquitous in real life and hence a wide range of solving pa...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
In the last few years, the society is witnessing ever-growing levels of complexity in the optimizati...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...