187 research outputs found
Local search heuristics for multi-index assignment problems with decomposable costs.
The multi-index assignment problem (MIAP) with decomposable costs is a natural generalization of the well-known assignment problem. Applications of the MIAP arise for instance in the field of multi-target multi-sensor tracking. We describe an (exponentially sized) neighborhood for a solution of the MIAP with decomposable costs, and show that one can find a best solution in this neighborhood in polynomial time. Based on this neighborhood, we propose a local search algorithm. We empirically test the performance of published constructive heuristics and the local search algorithm on random instances; a straightforward tabu search is also tested. Finally, we compute lower bounds to our problem, which enable us to assess the quality of the solutions found.Assignment; Costs; Heuristics; Problems; Applications; Performance;
Combinatorics and Geometry of Transportation Polytopes: An Update
A transportation polytope consists of all multidimensional arrays or tables
of non-negative real numbers that satisfy certain sum conditions on subsets of
the entries. They arise naturally in optimization and statistics, and also have
interest for discrete mathematics because permutation matrices, latin squares,
and magic squares appear naturally as lattice points of these polytopes.
In this paper we survey advances on the understanding of the combinatorics
and geometry of these polyhedra and include some recent unpublished results on
the diameter of graphs of these polytopes. In particular, this is a thirty-year
update on the status of a list of open questions last visited in the 1984 book
by Yemelichev, Kovalev and Kravtsov and the 1986 survey paper of Vlach.Comment: 35 pages, 13 figure
Geometric versions of the 3-dimensional assignment problem under general norms
We discuss the computational complexity of special cases of the 3-dimensional
(axial) assignment problem where the elements are points in a Cartesian space
and where the cost coefficients are the perimeters of the corresponding
triangles measured according to a certain norm. (All our results also carry
over to the corresponding special cases of the 3-dimensional matching problem.)
The minimization version is NP-hard for every norm, even if the underlying
Cartesian space is 2-dimensional. The maximization version is polynomially
solvable, if the dimension of the Cartesian space is fixed and if the
considered norm has a polyhedral unit ball. If the dimension of the Cartesian
space is part of the input, the maximization version is NP-hard for every
norm; in particular the problem is NP-hard for the Manhattan norm and the
Maximum norm which both have polyhedral unit balls.Comment: 21 pages, 9 figure
Fast separation for the three-index assignment problem
A critical step in a cutting plane algorithm is separation, i.e., establishing whether a given vector x violates an inequality belonging to a specific class. It is customary to express the time complexity of a separation algorithm in the number of variables n. Here, we argue that a separation algorithm may instead process the vector containing the positive components of x, denoted as supp(x), which offers a more compact representation, especially if x is sparse; we also propose to express the time complexity in terms of |supp(x)|. Although several well-known separation algorithms exploit the sparsity of x, we revisit this idea in order to take sparsity explicitly into account in the time-complexity of separation and also design faster algorithms. We apply this approach to two classes of facet-defining inequalities for the three-index assignment problem, and obtain separation algorithms whose time complexity is linear in |supp(x)| instead of n. We indicate that this can be generalized to the axial k-index assignment problem and we show empirically how the separation algorithms exploiting sparsity improve on existing ones by running them on the largest instances reported in the literature
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
Memetic algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting the population size is one of the most important among them. Most of the algorithms in the literature fix the population size to a certain constant value. This reduces the algorithm's quality since the optimal population size varies for different instances, local search procedures, and runtimes. In this paper we propose an adjustable population size. It is calculated as a function of the runtime of the whole algorithm and the average runtime of the local search for the given instance. Note that in many applications the runtime of a heuristic should be limited and, therefore, we use this bound as a parameter of the algorithm. The average runtime of the local search procedure is measured during the algorithm's run. Some coefficients which are independent of the instance and the local search are to be tuned at the design time;we provide a procedure to find these coefficients. The proposed approach was used to develop a memetic algorithm for the multidimensional assignment problem (MAP). We show that our adjustable population size makes the algorithm flexible to perform efficiently for a wide range of running times and local searches and this does not require any additional tuning of the algorithm
Local Search Heuristics For The Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case
of s dimensions) is an extension of the well-known assignment problem. The most
studied case of MAP is 3-AP, though the problems with larger values of s also
have a large number of applications. We consider several known neighborhoods,
generalize them and propose some new ones. The heuristics are evaluated both
theoretically and experimentally and dominating algorithms are selected. We
also demonstrate a combination of two neighborhoods may yield a heuristics
which is superior to both of its components.Comment: 30 pages. A preliminary version is published in volume 5420 of
Lecture Notes Comp. Sci., pages 100-115, 200
Heuristic Solution Approaches to the Solid Assignment Problem
The 3-dimensional assignment problem, also known as the Solid Assignment Problem (SAP), is a challenging problem in combinatorial optimisation. While the ordinary or 2-dimensional assignment problem is in the P-class, SAP which is an extension of it, is NP-hard. SAP is the problem of allocating n jobs to n machines in n factories such that exactly one job is allocated to one machine in one factory. The objective is to minimise the total cost of getting these n jobs done. The problem is commonly solved using exact methods of integer programming such as Branch-and-Bound B&B. As it is intractable, only approximate solutions are found in reasonable time for large instances. Here, we suggest a number of approximate solution approaches, one of them the Diagonals Method (DM), relies on the Kuhn-Tucker Munkres algorithm, also known as the Hungarian Assignment Method. The approach was discussed, hybridised, presented and compared with other heuristic approaches such as the Average Method, the Addition Method, the Multiplication Method and the Genetic Algorithm. Moreover, a special case of SAP which involves Monge-type matrices is also considered. We have shown that in this case DM finds the exact solution efficiently.
We sought to provide illustrations of the models and approaches presented whenever appropriate. Extensive experimental results are included and discussed. The thesis ends with a conclusions and some suggestions for further work on the same and related topics
The discovery of population differences in network community structure: New methods and applications to brain functional networks in schizophrenia
The modular organization of the brain network can vary in two fundamental ways. The amount of interversus intra-modular connections between network nodes can be altered, or the community structure itself can be perturbed, in terms of which nodes belong to which modules (or communities). Alterations have previously been reported in modularity, which is a function of the proportion of intra-modular edges over all modules in the network. For example, we have reported that modularity is decreased in functional brain networks in schizophrenia: There are proportionally more inter-modular edges and fewer intra-modular edges. However, despite numerous and increasing studies of brain modular organization, it is not known how to test for differences in the community structure, i.e., the assignment of regional nodes to specific modules. Here, we introduce a method based on the normalized mutual information between pairs of modular networks to show that the community structure of the brain network is significantly altered in schizophrenia, using resting-state fMRI in 19 participants with childhood-onset schizophrenia and 20 healthy participants. We also develop tools to show which specific nodes (or brain regions) have significantly different modular communities between groups, a subset that includes right insular and perisylvian cortical regions. The methods that we propose are broadly applicable to other experimental contexts, both in neuroimaging and other areas of network science
Quadratic assignment problem : linearizations and polynomial time solvable cases
Cataloged from PDF version of article.The Quadratic Assignment Problem (QAP) is one of the hardest
combinatorial optimization problems known. Exact solution attempts proposed
for instances of size larger than 15 have been generally unsuccessful even though
successful implementations have been reported on some test problems from the
QAPLIB up to size 36. In this dissertation, we analyze the binary structure of the
QAP and present new IP formulations. We focus on “flow-based” formulations,
strengthen the formulations with valid inequalities, and report computational
experience with a branch-and-cut algorithm. Next, we present new classes of
instances of the QAP that can be completely or partially reduced to the Linear
Assignment Problem and give procedures to check whether or not an instance is
an element of one of these classes. We also identify classes of instances of the
Koopmans-Beckmann form of the QAP that are solvable in polynomial time.
Lastly, we present a strong lower bound based on Bender’s decomposition.Erdoğan, GüneşPh.D
- …