In the present study, a large scale, structured problem regarding the routing and rostering of security personnel is investigated. Structured problems are combinatorial optimization problems that encompass characteristics of more than one known problem in operational research. The problem deals with assigning the available personnel to visits associated with a set of customers. This objective j...

Surrogate constraint methods have been embedded in a variety of mathematical programming applications over the past thirty years, yet their potential uses and underlying principles remain incompletely understood by a large segment of the optimization community. In a number of significant domains of combinatorial optimization, researchers have produced solution strategies without recognizing tha...

The objective of this paper is the introduction to a unified optimization framework for research and education. The OPTILIB framework implements different general purpose algorithms for combinatorial optimization and minimum search on standard continuous test functions. The preferences of this library are the straightforward integration of new optimization algorithms and problems as well as the...

Parallel Memetic Algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have shown that they converge to high quality solutions significantly faster than canonical GAs and MAs. Ho...

The Non-Deterministic and Polynomial Time Problem is a problem in combinatorial optimization. Finding the quickest route for an object to travel through list of cities return starting city goal this problem. Cities are listed, along with distance between each pair. It belongs category computer problems known as NP-complete problems, which no effective algorithmic solution has yet been discovere...

Configuration checking (CC) has been confirmed to alleviate the cycling problem in local search for combinatorial optimization problems (COPs). When using CC heuristics graph problems, a critical concept is configuration of vertices. All existing variants employ either 1- or 2-level neighborhoods vertex as its configuration. Inspired by idea that with different levels should have contributions ...