19 research outputs found
A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem
Get PDFAbstract. We propose a dedicated tabu search algorithm (TSX_WDP) for the winner determination problem (WDP) in combinatorial auctions. TSX_WDP integrates two complementary neighborhoods designed re-spectively for intensification and diversification. To escape deep local optima, TSX_WDP employs a backbone-based recombination opera-tor to generate new starting points for tabu search and to displace the search into unexplored promising regions. The recombination operator operates on elite solutions previously found which are recorded in an global archive. The performance of our algorithm is assessed on a set of 500 well-known WDP benchmark instances. Comparisons with five state of the art algorithms demonstrate the effectiveness of our approach
Stochastic Local Search Based Feature Selection Combined with K-means for Clients’ Segmentation in Credit Scoring
No full textA Novel Approach for Heart Disease Prediction Using Genetic Algorithm and Ensemble Classification
No full textLocal Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions
No full textA memetic algorithm with support vector machine for feature selection and classification
No full text
