28 research outputs found
Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
Motivated by a real-world application, we present a multi-container loading problem with 3-open
dimensions. We formulate it as a biobjective mixed-integer nonlinear program with lexicographic
objectives in order to reflect the decision maker’s optimization priorities. The first objective is to
minimize the number of containers, while the second objective is to minimize the volume of those
containers. Besides showing the NP-hardness of this sequential optimization problem, we provide
bounds for it which are used in the three proposed algorithms, as well as, on their evaluation when a
certificate of optimality is not available. The first is an exact parametric-based approach to tackle the
lexicographic optimization through the second objective of the problem. Nevertheless, given that the
parametric programs correspond to large nonlinear mixed-integer optimizations, we present a heuristic
that is entirely mathematical-programming based. The third algorithm enhances the solution quality of
the heuristic. These algorithms are specifically tailored for the real-world application. The effectiveness
and efficiency of the devised heuristics is demonstrated with numerical experiments
Metaheuristic and Multiobjective Approaches for Space Allocation
This thesis presents an investigation on the application of metaheuristic techniques to tackle the space allocation problem in academic institutions. This is a combinatorial optimisation problem which refers to the distribution of the available room space among a set of entities (staff, research students, computer rooms, etc.) in such a way that the space is utilised as efficiently as possible and the additional constraints are satisfied as much as possible. The literature on the application of optimisation techniques to approach the problem mentioned above is scarce. This thesis provides a description and formulation of the problem. It also proposes and compares a range of heuristics for the initialisation of solutions and for neighbourhood exploration. Four well-known metaheuristics (iterative improvement, simulated annealing, tabu search and genetic algorithms) are adapted and tuned for their application to the problem investigated here. The performance of these techniques is assessed and benchmark results are obtained. Also, hybrid approaches are designed that produce sets of high quality and diverse solutions in much shorter time than those required by space administrators who construct solutions manually. The hybrid approaches are also adapted to tackle the space allocation problem from a two-objective perspective. It is also revealed that the use of aggregating functions or relaxed dominance to evaluate solutions in Pareto optimisation, can be more beneficial than the standard dominance relation to enhance the performance of some multiobjective optimisers in some problem domains. A range of single-solution metaheuristics are extended to create hybrid evolutionary approaches based on the scheme of cooperative local search. This scheme promotes the cooperation of a population of local searchers by means of mechanisms to share the information gained during the search. This thesis also reports the best results known so far for a set of test instances of the space allocation
problem in academic institutions.
This thesis pioneers the application of metaheuristics to solve the space allocation problem. The major contributions are: provides a formulation of the problem together with tests data sets, reports the best known results for these test instances, investigates the multiobjective nature of the problem and proposes a new form of hybridising metaheuristics
Metaheuristic and Multiobjective Approaches for Space Allocation
This thesis presents an investigation on the application of metaheuristic techniques to tackle the space allocation problem in academic institutions. This is a combinatorial optimisation problem which refers to the distribution of the available room space among a set of entities (staff, research students, computer rooms, etc.) in such a way that the space is utilised as efficiently as possible and the additional constraints are satisfied as much as possible. The literature on the application of optimisation techniques to approach the problem mentioned above is scarce. This thesis provides a description and formulation of the problem. It also proposes and compares a range of heuristics for the initialisation of solutions and for neighbourhood exploration. Four well-known metaheuristics (iterative improvement, simulated annealing, tabu search and genetic algorithms) are adapted and tuned for their application to the problem investigated here. The performance of these techniques is assessed and benchmark results are obtained. Also, hybrid approaches are designed that produce sets of high quality and diverse solutions in much shorter time than those required by space administrators who construct solutions manually. The hybrid approaches are also adapted to tackle the space allocation problem from a two-objective perspective. It is also revealed that the use of aggregating functions or relaxed dominance to evaluate solutions in Pareto optimisation, can be more beneficial than the standard dominance relation to enhance the performance of some multiobjective optimisers in some problem domains. A range of single-solution metaheuristics are extended to create hybrid evolutionary approaches based on the scheme of cooperative local search. This scheme promotes the cooperation of a population of local searchers by means of mechanisms to share the information gained during the search. This thesis also reports the best results known so far for a set of test instances of the space allocation
problem in academic institutions.
This thesis pioneers the application of metaheuristics to solve the space allocation problem. The major contributions are: provides a formulation of the problem together with tests data sets, reports the best known results for these test instances, investigates the multiobjective nature of the problem and proposes a new form of hybridising metaheuristics
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem
The online bin packing problem is a well-known optimization challenge that finds application in a wide range of real-world scenarios. In the paper, we propose a novel algorithm called FuzzyPatternPack(FPP), which leverages fuzzy inference and pattern-based predictions of the distribution of item sizes in online bin packing. In comparison to traditional heuristics like BestFit(BF) and FirstFit(FF), as well as the more recent PatternPack(PaP) and ProfilePacking(PrP) algorithm based on online predictions, FPP demonstrates competitive and superior performance in solving various benchmark problems. Particularly, it excels in addressing problems with evolving distributions, making it a promising solution for real-world applications where the item sizes may change over time. This research unveils the promising potential of employing fuzzy logic to effectively address uncertainty in scheduling and planning problems
Design of Heuristic Algorithms for Hard Optimization
This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content
Evolutionary Computation
This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field
Computational complexity of evolutionary algorithms, hybridizations, and swarm intelligence
Bio-inspired randomized search heuristics such as evolutionary algorithms, hybridizations
with local search, and swarm intelligence are very popular among practitioners
as they can be applied in case the problem is not well understood or when there is
not enough knowledge, time, or expertise to design problem-specific algorithms. Evolutionary
algorithms simulate the natural evolution of species by iteratively applying
evolutionary operators such as mutation, recombination, and selection to a set of solutions
for a given problem. A recent trend is to hybridize evolutionary algorithms with
local search to refine newly constructed solutions by hill climbing. Swarm intelligence
comprises ant colony optimization as well as particle swarm optimization. These modern
search paradigms rely on the collective intelligence of many single agents to find good
solutions for the problem at hand. Many empirical studies demonstrate the usefulness
of these heuristics for a large variety of problems, but a thorough understanding is still
far away.
We regard these algorithms from the perspective of theoretical computer science and
analyze the random time these heuristics need to optimize pseudo-Boolean problems.
This is done in a mathematically rigorous sense, using tools known from the analysis of
randomized algorithms, and it leads to asymptotic bounds on their computational complexity.
This approach has been followed successfully for evolutionary algorithms, but
the theory of hybrid algorithms and swarm intelligence is still in its very infancy. Our
results shed light on the asymptotic performance of these heuristics, increase our understanding
of their dynamic behavior, and contribute to a rigorous theoretical foundation
of randomized search heuristics
Contribution to the development of efficient algorithms for solving complex single-objective and multi-objective optimization models
L’optimització en enginyeria de processos és un àrea molt estesa que ha anat evolucionant al llarg del temps i ha passat de ser una metodologia d'interès purament acadèmic a una tecnologia que té, i que contínua tenint, gran impacte en la indústria. En aquesta tesi ens hem centrat en el desenvolupament mètodes basats en dues eines típiques d'optimització: programació matemàtica i metaheurístiques. Els objectius d'aquesta tesi són: el primer és desenvolupar una metaheuristica híbrida per a l'optimització del disseny de cadenes de subministrament, d'un sol objectiu (cost o benefici), on tots els paràmetres són coneguts a priori; el segon és desenvolupar un algorisme efectiu per a reducció d'objectius facilitant la resolució de problemes multi-objectiu; i finalment s'han implementat una sèrie de millores en el mètode de la restricció èpsilon per millorar l'eficiència en la resolució de problemes multi-objectiu. Tots els algorismes presentats han estat comparats i avaluats amb els mètodes establerts per la literatura.La optimización en ingeniería de procesos es un área muy extensa que ha ido evolucionando a lo largo del tiempo y ha pasado de ser una metodología de interés puramente académico a una tecnología que tiene, y que continua teniendo, gran impacto en la industria. En esta tesis nos hemos centrado en el desarrollo de métodos basados en dos herramientas típicas de optimización: programación matemática y metaheurísticas. Los objetivos de esta tesis son: el primero es desarrollar una metaheuristica híbrida para la optimización del diseño de cadenas de suministro, de un solo objetivo (coste o beneficio), donde todos los parámetros son conocidos a priori; el segundo es desarrollar un algoritmo efectivo para la reducción de objetivos facilitando la resolución de problemas multi-objetivo; y finalmente se han implementado una serie de mejoras en el método de la restricción epsilon para mejorar la eficiencia en la resolución de problemas multi-objetivo. Todos los algoritmos presentados han sido comparados y evaluados con los métodos establecidos por la literatura.Optimization has become a major area in process systems engineering. It has evolved from a methodology of academic interest into a technology that has and continues to make significant impact in industry. In this thesis we have focused on development of tools based on two standard optimization methods: mathematical programming and metaheuristics. The objectives of this thesis are: firstly, the development of a hybrid metaheuristic for optimizing the design of supply chains, single objective (cost or benefit), where all parameters are known previously; secondly, the development of an effective algorithm for objective reduction facilitating the resolution of multi-objective problems; and finally, we improved the epsilon-constraint algorithm in multi-objective optimization. All the algorithms presented have been assessed with the methods established in the literature
Contemporary Robotics
This book book is a collection of 18 chapters written by internationally recognized experts and well-known professionals of the field. Chapters contribute to diverse facets of contemporary robotics and autonomous systems. The volume is organized in four thematic parts according to the main subjects, regarding the recent advances in the contemporary robotics. The first thematic topics of the book are devoted to the theoretical issues. This includes development of algorithms for automatic trajectory generation using redudancy resolution scheme, intelligent algorithms for robotic grasping, modelling approach for reactive mode handling of flexible manufacturing and design of an advanced controller for robot manipulators. The second part of the book deals with different aspects of robot calibration and sensing. This includes a geometric and treshold calibration of a multiple robotic line-vision system, robot-based inline 2D/3D quality monitoring using picture-giving and laser triangulation, and a study on prospective polymer composite materials for flexible tactile sensors. The third part addresses issues of mobile robots and multi-agent systems, including SLAM of mobile robots based on fusion of odometry and visual data, configuration of a localization system by a team of mobile robots, development of generic real-time motion controller for differential mobile robots, control of fuel cells of mobile robots, modelling of omni-directional wheeled-based robots, building of hunter- hybrid tracking environment, as well as design of a cooperative control in distributed population-based multi-agent approach. The fourth part presents recent approaches and results in humanoid and bioinspirative robotics. It deals with design of adaptive control of anthropomorphic biped gait, building of dynamic-based simulation for humanoid robot walking, building controller for perceptual motor control dynamics of humans and biomimetic approach to control mechatronic structure using smart materials