9 research outputs found
A Memetic Algorithm for the Generalized Traveling Salesman Problem
The generalized traveling salesman problem (GTSP) is an extension of the
well-known traveling salesman problem. In GTSP, we are given a partition of
cities into groups and we are required to find a minimum length tour that
includes exactly one city from each group. The recent studies on this subject
consider different variations of a memetic algorithm approach to the GTSP. The
aim of this paper is to present a new memetic algorithm for GTSP with a
powerful local search procedure. The experiments show that the proposed
algorithm clearly outperforms all of the known heuristics with respect to both
solution quality and running time. While the other memetic algorithms were
designed only for the symmetric GTSP, our algorithm can solve both symmetric
and asymmetric instances.Comment: 15 pages, to appear in Natural Computing, Springer, available online:
http://www.springerlink.com/content/5v4568l492272865/?p=e1779dd02e4d4cbfa49d0d27b19b929f&pi=1
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem
The Lin-Kernighan heuristic is known to be one of the most successful
heuristics for the Traveling Salesman Problem (TSP). It has also proven its
efficiency in application to some other problems. In this paper we discuss
possible adaptations of TSP heuristics for the Generalized Traveling Salesman
Problem (GTSP) and focus on the case of the Lin-Kernighan algorithm. At first,
we provide an easy-to-understand description of the original Lin-Kernighan
heuristic. Then we propose several adaptations, both trivial and complicated.
Finally, we conduct a fair competition between all the variations of the
Lin-Kernighan adaptation and some other GTSP heuristics. It appears that our
adaptation of the Lin-Kernighan algorithm for the GTSP reproduces the success
of the original heuristic. Different variations of our adaptation outperform
all other heuristics in a wide range of trade-offs between solution quality and
running time, making Lin-Kernighan the state-of-the-art GTSP local search.Comment: 25 page
Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence
In recent years Grammatical Evolution (GE) has been used as a representation of Genetic Programming (GP) which has been applied to many optimization problems such as symbolic regression, classification, Boolean functions, constructed problems, and algorithmic problems. GE can use a diversity of searching strategies including Swarm Intelligence (SI). Particle Swarm Optimisation (PSO) is an algorithm of SI that has two main problems: premature convergence and poor diversity. Particle Evolutionary Swarm Optimization (PESO) is a recent and novel algorithm which is also part of SI. PESO uses two perturbations to avoid PSOâs problems. In this paper we propose using PESO and PSO in the frame of GE as strategies to generate heuristics that solve the Bin Packing Problem (BPP); it is possible however to apply this methodology to other kinds of problems using another Grammar designed for that problem. A comparison between PESO, PSO, and BPPâs heuristics is performed through the nonparametric Friedman test. The main contribution of this paper is proposing a Grammar to generate online and offline heuristics depending on the test instance trying to improve the heuristics generated by other grammars and humans; it also proposes a way to implement different algorithms as search strategies in GE like PESO to obtain better results than those obtained by PSO
The enhanced best performance algorithm for global optimization with applications.
Doctor of Philosophy in Computer Science. University of KwaZulu-Natal, Durban, 2016.Abstract available in PDF file
Traveling Salesman Problem
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance
Model-based human upper body tracking using interest points in real-time video
Vision-based human motion analysis has received huge attention from researchers because of the number of applications, such as automated surveillance, video indexing, human machine interaction, traffic monitoring, and vehicle navigation. However, it contains several open problems. To date, despite very promising proposed approaches, no explicit solution has been found to solve these open problems efficiently. In this regard, this thesis presents a model-based human upper body pose estimation and tracking system using interest points
(IPs) in real-time video.
In the first stage, we propose a novel IP-based background-subtraction algorithm to segment the foreground IPs of each frame from the background ones. Afterwards, the foreground IPs of any two consecutive frames are matched to each other using a dynamic hybrid localspatial IP matching algorithm, proposed in this research.
The IP matching algorithm starts by using the local feature descriptors of the IPs to find an initial set of possible matches. Then two filtering steps are applied to the results to increase the precision by deleting the mismatched pairs. To improve the recall, a spatial matching process is applied to the remaining unmatched points.
Finally, a two-stage hierarchical-global model-based pose estimation and tracking algorithm based on Particle Swarm Optimiation (PSO) is proposed to track the human upper body through consecutive frames. Given the pose and the foreground IPs in the previous frame and the matched points in the current frame, the proposed PSO-based pose estimation and tracking algorithm estimates the current pose hierarchically by minimizing the discrepancy between the hypothesized pose and the real matched observed points in the first stage. Then a global PSO is applied to the pose estimated by the first stage to do a consistency check and pose refinement
Hochflexibles Workforce Management
It can be observed that companies tend to use a very demand driven personnel scheduling instead of using fixed shifts. In this context the term highly flexible workforce management (WFM) is used. With instruments such as the planning of subdaily workplace rotations, the combination of working time model generation and personnel scheduling or the combination of personnel scheduling and vehicle routing the demand for personnel can be covered very well. Such problems are novel and found little attention by researchers up to now.In this work classical OR-algorithms, metaheuristics and multi-agent systems (MAS) are evaluated on real world problems from logistics, retail and British Telecom. It can be shown, that classical OR-algorithms are not appropriate for these problems of highly flexible WFM, because of impractical CPU-times. On the other hand selected metaheuristics are very suitable. MAS should not be favoured, because selected metaheuristics performed always better. It must point out that a hybrid algorithm (a metaheuristic with a problem-specific repair) is responsible for the success of metaheuristics. MAS lack of a central planning instance that makes major changes for which agents are not able to do. Numerous algorithms of this work where originally developed for continuous problems. The adaption to combinatorial problems is described too. The appropriate adaption of parameters is also addressed.Zunehmend ist bei Unternehmen ein Trend weg von der starren Schicht- oder Dienstplanung hin zu einer auf den Personalbedarf ausgerichteten Planung festzustellen. In diesem Zusammenhang wird der Begriff hochflexibles Workforce Management (WFM) geprÀgt. Mit Instrumenten wie der Planung untertÀgiger Arbeitsplatzwechsel, der Kombination aus Arbeitszeitmodellerstellung und Einsatzplanung sowie der kombinierten Personaleinsatz- und Tourenplanung kann der Personaleinsatz sehr gut an den Personalbedarf angepasst werden. Derartige Problemstellungen sind neuartig und fanden in der Forschung bisher wenig Beachtung