Towards a Formalization of Combinatorial Local Search
نویسندگان
چکیده
Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. We are here concerned with the design of a generic framework to model local search as the computation of a fixed point of functions. This work allows one to simulate standard strategies used for local search, and to easily design new strategies in a uniform framework.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملParallel Local Search
Local search metaheuristics are a recognized means of solving hard combinatorial problems. Over the last couple of decades, significant advances have been made in terms of the formalization, applicability and performance of these methods. Key to the performance aspect is the increased availability of parallel hardware, which turns out to be largely exploitable by this class of procedures. As re...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملTowards the Empirical Analysis of SLS Algorithms for Multiobjective Combinatorial Optimization Problems through Experimental Design
Stochastic Local Search (SLS) algorithms for Multiobjective Combinatorial Optimization Problems (MCOPs) typically involve the selection and parameterization of many algorithm components whose role with respect to their overall performance and relation to certain instance features is often not clear. This fact is becoming more problematic because of the recent trend in solving MCOPs that is givi...
متن کامل