Filters








736 Hits in 6.2 sec

A combinatorial cooperative-tabu search feature reduction approach

E. Ansari, M.H. Sadreddini, B. Sadeghi Bigham, F. Alimardani
2013 Scientia Iranica. International Journal of Science and Technology  
In this paper, a combinatorial approach has been proposed, which consists of three feature reduction algorithms that have been applied in a parallel manner to cooperate.  ...  The proposed algorithm, called the Cooperative-Tabu-Search (CTS), and also a revised version of this new method, is introduced to accelerate the convergence.  ...  Presented ''cooperative-tabu-search'' algorithm In this study, a new algorithm is introduced and entitled, the Cooperative-Tabu Search (CTS).  ... 
doi:10.1016/j.scient.2012.12.020 fatcat:cstpkutlibeejlf4qh3xe3kfwe

A combinatorial cooperative-tabu search feature reduction approach

MH Sadreddini E Ansari
2013 Zenodo  
In this paper, a combinatorial approach has been proposed, which consists of three feature reduction algorithms that have been applied in a parallel manner to cooperate.  ...  For each component, among all various attribute selection algorithms, the Tabu Search (TS) a useful and state of the art algorithm, is used.  ...  Presented ''cooperative-tabu-search'' algorithm In this study, a new algorithm is introduced and entitled, the Cooperative-Tabu Search (CTS).  ... 
doi:10.5281/zenodo.3783790 fatcat:kuj2kwaju5d5jbd3htdbqpamyq

Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem

Ireneusz Czarnowski, Piotr Jędrzejowicz
2011 International Journal of Applied Mathematics and Computer Science  
Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem The problem considered concerns data reduction for machine learning.  ...  The paper proposes an agent-based data reduction approach with the learning process executed by a team of agents (A-Team).  ...  Acknowledgment This research has been supported by the Polish Ministry of Science and Higher Education within a grant for the years 2008-2010 and a grant for the years 2010-2013.  ... 
doi:10.2478/v10006-011-0004-3 fatcat:4rhvquxqtrfcnlvjnczjf4xo24

Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions

Ashish Sureka, Peter R. Wurman
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
Best response dynamics is a method of searching for pure-strategy equilibria in games that is attractive for its simplicity and scalability (relative to more analytical approaches).  ...  Thus, we study metaheuristic approachesgenetic algorithms and tabu search in particular-to explore the strategy space.  ...  We apply tabu search and genetic algorithms to search the very large space of bidding strategies in combinatorial auctions to find a good strategy in a reasonable amount of time.  ... 
doi:10.1145/1068009.1068356 dblp:conf/gecco/SurekaW05 fatcat:qo4d5nclzzbnriqymjpphuhtqu

Hybrid Techniques of Combinatorial Optimization with Application to Retail Credit Risk Assessment

Stjepan Oreski
2014 Artificial Intelligence and Applications  
The importance of such cooperation is confirmed by the results that are presented in the experimental part of the paper, which were obtained on a German credit dataset using the hybrid technique of combinatorial  ...  This study emphasizes the importance of hybridization as a concept of cooperation among metaheuristics and other optimization techniques.  ...  CONCLUSIONS The hybrid techniques of combinatorial optimization have been a subject of interest to many researchers in recent years.  ... 
doi:10.15764/aia.2014.01002 fatcat:jeqgqdkoxnh2za66qwhofqbkoq

How To Build And Evaluate A Solution Method: An Illustration For The Vehicle Routing Problem

Nicolas Zufferey
2013 Zenodo  
The vehicle routing problem (VRP) is a famous combinatorial optimization problem.  ...  Such elements can obviously be used to build solution methods for other combinatorial optimization problems, at least in the deterministic field.  ...  To escape from a local optimum, simulated annealing has an acceptation probability [29] , tabu search has a tabu list [12] , and variable neighborhood search uses various neighborhood structures with  ... 
doi:10.5281/zenodo.1328946 fatcat:fclhxscounertpf277ga6hrdoe

A cooperative parallel tabu search algorithm for the quadratic assignment problem

Tabitha James, Cesar Rego, Fred Glover
2009 European Journal of Operational Research  
In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP).  ...  CPTS is a cooperative parallel algorithm in which the processors exchange information throughout the run of the algorithm as opposed to independent concurrent search strategies that aggregate data only  ...  The main feature of the cooperative parallel tabu search (CPTS) is to take advantage of parallel computing in the implementation of adaptive memory programming.  ... 
doi:10.1016/j.ejor.2007.06.061 fatcat:gufwlir55vck5pklp4mnsve4cy

A New Constructive Method for Electric Power System Reconfiguration Using Ant Colony

Habib HAMDAOUI, Samir HADJERI, Abdelkader ZEBLAH
2008 Leonardo Electronic Journal of Practices and Technologies  
In fact, the paper addresses an ant colony met-heuristic optimization method to solve this combinatorial problem.  ...  The algorithm of ant colony approach (ACA) is required to identify the optimal combination of adding or cut off feeders with different parameters for the new topology design.  ...  Ant Colony Optimization Approach The problem formulated in this paper is a complicated combinatorial optimization problem.  ... 
doaj:27c30e6025d3435a8470dd6a2be311bf fatcat:oropydjdvfhrzh2six5lzrrtg4

Capacitated Centralized Carrier Collaboration Multihub Location Problem

Hao Wang, Avinash Unnikrishnan, Salvador Hernández, Ruey (Kelvin) Cheu
2014 Transportation Research Record  
A mathematical programming formulation is provided for the CAP-CCCMLP and shown to be NP-hard. The model was solved with two-phase tabu search heuristics.  ...  The tabu search heuristic was found to deliver significant computational savings over CPLEX and the optimality gap between the true optimal solution and the tabu search solution was found to be low for  ...  Krajewska and Kopfer applied principles of combinatorial auctions and cooperative game theory to aid cooperation among freight forwarders (12) .  ... 
doi:10.3141/2466-03 fatcat:yvh3glj6wnbcdosjpbt6yrap24

Parallelizing Combinatorial Optimization Heuristics with GPUs

Mohammad Harun Rashid, Lixin Tao
2018 Advances in Science, Technology and Engineering Systems  
Combinatorial optimization problems are often NP-hard and too complex to be solved within a reasonable time frame by exact methods.  ...  Heuristic methods which do not offer a convergence guarantee could obtain some satisfactory resolution for combinatorial optimization problems.  ...  iterated local search, tabu search, and genetic algorithm etc.  ... 
doi:10.25046/aj030635 fatcat:566v2rey2bgyhfrjqqjvdnpihq

A cooperative parallel metaheuristic for the capacitated vehicle routing problem

Jianyong Jin, Teodor Gabriel Crainic, Arne Løkketangen
2014 Computers & Operations Research  
The proposed metaheuristic consists of multiple parallel tabu search threads that cooperate by asynchronously exchanging best found solutions through a common solution pool.  ...  This paper introduces a cooperative parallel metaheuristic for solving the capacitated vehicle routing problem.  ...  The proposed algorithm incorporates multiple tabu search threads which cooperate by asynchronously exchanging best found solutions through a common solution pool, and includes several novel features.  ... 
doi:10.1016/j.cor.2013.10.004 fatcat:nixjh3cchrab7a3pxtcat2srnm

Metaheuristics: A Canadian Perspective

Michel Gendreau, Jean-Yves Potvin
2008 INFOR. Information systems and operational research  
The tabu search implementation also contains features that were quite innovative at the time.  ...  A somewhat different approach consists in applying cooperative search principles: several search threads perform VNS simultaneously and exchange information when they encounter globally improving solutions  ... 
doi:10.3138/infor.46.1.71 fatcat:zconnypg4jfytmhwxzibrkc3k4

Solution to Economic Power Dispatch Planning Problem considering Generator Constraints using Artificial Bee Colony Algorithm

Navpreet Singh Tung, Sandeep Chakravorty
2016 International Journal of Hybrid Information Technology  
It possesses a flexible and well-balanced operator to enhance and adapt the global and fine tune local search to follow the minimum cost path in the search boundary.  ...  for this multi-decision, multi-objective combinatorial problem subjected to different constraints.  ...  Christober C. et al [6] proposed a neural network based tabu search for unit commitment optimization which is more efficient than conventional tabu search.  ... 
doi:10.14257/ijhit.2016.9.5.34 fatcat:khlu7mjlu5fkjccj6humlzyjgy

Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges [chapter]

Fred Glover
1997 Operations Research/Computer Science Interfaces Series  
Specific tabu search applications are also summarized to provide a clearer understanding of settings where the method is being used.  ...  Tabu search (TS) has provided advances for solving difficult optimization problems in many domains.  ...  A novel algorithm for the global optimization of functions (C-RTS) is presented in Battiti and Tecchiolli (1995a) , in which a combinatorial optimization method cooperates with a stochastic local minimizer  ... 
doi:10.1007/978-1-4615-4102-8_1 fatcat:c2mxzmtf7zbxnftbgcy4o7rfoa

Comet in context

Laurent Michel, Pascal Van Hentenryck
2003 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday - PCK50  
This paper contains a brief description of Comet, an object-oriented language supporting a constraint-based architecture for neighborhood search.  ...  In particular, Comet supports a layered architecture cleanly separating modeling and search aspects of the programs, constraints encapsulating incremental algorithms, and various control abstraction to  ...  The Comet program illustrates the use of a constraint system and combinatorial constraints. It also features a tabu search with an intensification component.  ... 
doi:10.1145/778348.778361 fatcat:t7kzt3awtnc2bb5qh7gnzow2r4
« Previous Showing results 1 — 15 out of 736 results