Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

07/07/2012
by   Daniel Karapetyan, et al.
0

Combinatorial optimization is widely applied in a number of areas nowadays. Unfortunately, many combinatorial optimization problems are NP-hard which usually means that they are unsolvable in practice. However, it is often unnecessary to have an exact solution. In this case one may use heuristic approach to obtain a near-optimal solution in some reasonable time. We focus on two combinatorial optimization problems, namely the Generalized Traveling Salesman Problem and the Multidimensional Assignment Problem. The first problem is an important generalization of the Traveling Salesman Problem; the second one is a generalization of the Assignment Problem for an arbitrary number of dimensions. Both problems are NP-hard and have hosts of applications. In this work, we discuss different aspects of heuristics design and evaluation. A broad spectrum of related subjects, covered in this research, includes test bed generation and analysis, implementation and performance issues, local search neighborhoods and efficient exploration algorithms, metaheuristics design and population sizing in memetic algorithm. The most important results are obtained in the areas of local search and memetic algorithms for the considered problems. In both cases we have significantly advanced the existing knowledge on the local search neighborhoods and algorithms by systematizing and improving the previous results. We have proposed a number of efficient heuristics which dominate the existing algorithms in a wide range of time/quality requirements. Several new approaches, introduced in our memetic algorithms, make them the state-of-the-art metaheuristics for the corresponding problems. Population sizing is one of the most promising among these approaches; it is expected to be applicable to virtually any memetic algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2022

Learning to Control Local Search for Combinatorial Optimization

Combinatorial optimization problems are encountered in many practical co...
research
11/22/2019

On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware

Many combinatorial scientific computing problems are NP-hard which in pr...
research
12/08/2021

Pretrained Cost Model for Distributed Constraint Optimization Problems

Distributed Constraint Optimization Problems (DCOPs) are an important su...
research
04/29/2013

A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem

Generalized traveling salesman problem (GTSP) is an extension of classic...
research
07/07/2013

Fuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem

ETP is NP Hard combinatorial optimization problem. It has received treme...
research
11/18/2017

Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Network

Cascades represent rapid changes in networks. A cascading phenomenon of ...

Please sign up or login with your details

Forgot password? Click here to reset