The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics between themselves. The identification of such solution is an NP-hard problem. Some heuristics are available to obtain approximate solutions for this problem. In this paper we propose different GRASP heuristics fo...

This paper introduces the family traveling salesperson problem (FTSP), a variant of the generalized traveling salesman problem. In the FTSP, a subset of nodes must be visited for each node cluster in the graph. The objective is to minimize the distance traveled. We describe an integer programming formulation for the FTSP and show that the commercial-grade integer programming solver CPLEX 11 can...

We solve robot trajectory planning problems at industry-relevant scales. Our end-to-end solution integrates highly versatile random-key algorithms with model stacking and ensemble techniques, as well path relinking for refinement. The core optimization module consists of a biased genetic algorithm. Through distinct separation problem-independent problem-dependent modules, we achieve an efficien...

This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of uniformly deployed set problems from solution for that specific instance. The research presented in this is focused methods construction sets solutions and examination their impact efficiency subsequent optimization algorithms. approaches to are used constitution predetermined fa...

Network migration scheduling is the problem where inter-nodal traffic from an outdated telecommunications network is to be migrated to a new network. Nodes are migrated, one at each time period, from the old to the new network. All traffic originating or terminating at given node in the old network is moved to a specific node in the new network. Routing is predetermined on both networks and the...

W. Art Chaovalitwongse Department of Industrial and Systems Engineering, Rutgers University 96 Frelinghuysen Rd., Piscataway, New Jersey 08854, USA [email protected] Carlos A.S. Oliveira Princeton Consultants Inc. 2 Research Way, Princeton, NJ 08540 [email protected] Bruno Chiarini PO Box 522274, Miami, FL 33152. [email protected] Panos M. Pardalos Department of Industrial and Syst...

In the last decade, image registration has proven to be a very active research area when tackling computer vision problems, especially in medical applications. In general, image registration methods aim to find a transformation between two images taken under different conditions. Point matching is an image registration approach based on searching for the right pairing of points between the two ...

In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition (maximizing a social welfare) of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning (set covering machines, clustering), Data Mining (decision tree, discreti...