Towards practical `neural' computation for combinatorial optimization problems
AIP Conference Proceedings 151 on Neural Networks for Computing
An overview of representative problems in location research
Management Science
Modern heuristic techniques for combinatorial problems
Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Computers and Operations Research
Discrete Mathematics
Tabu Search
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Toward Self-Integrating Software Applications for Supply Chain Management
Information Systems Frontiers
Parallelization of the scatter search for the p-median problem
Parallel Computing - Special issue: Parallel computing in logistics
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
Computers and Operations Research
Cooperative Parallel Variable Neighborhood Search for the p-Median
Journal of Heuristics
A hybrid evolutionary algorithm for the p-median problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs
Journal of Heuristics
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
Variable neighborhood search for the linear ordering problem
Computers and Operations Research
Solving the p-Median Problem with a Semi-Lagrangian Relaxation
Computational Optimization and Applications
Learning multicriteria fuzzy classification method PROAFTN from data
Computers and Operations Research
Modified global k-means algorithm for clustering in gene expression data sets
WISB '06 Proceedings of the 2006 workshop on Intelligent systems for bioinformatics - Volume 73
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Categorical data fuzzy clustering: An analysis of local search heuristics
Computers and Operations Research
Computational Optimization and Applications
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
Journal of Global Optimization
Modified global k-means algorithm for minimum sum-of-squares clustering problems
Pattern Recognition
A memetic genetic algorithm for the vertex p-center problem
Evolutionary Computation
Soft computing and cooperative strategies for optimization
Applied Soft Computing
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Variable neighbourhood decomposition search for 0-1 mixed integer programs
Computers and Operations Research
The OA-based swap method for the p-median problem
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Expert Systems with Applications: An International Journal
Advanced generic neighborhood heuristics for VNS
Engineering Applications of Artificial Intelligence
Expert Systems with Applications: An International Journal
Fast modified global k-means algorithm for incremental cluster construction
Pattern Recognition
New hybrid matheuristics for solving the multidimensional knapsack problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Computers and Operations Research
An aggregation heuristic for large scale p-median problem
Computers and Operations Research
Decomposition and parallelization of multi-resource timetabling problems
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A hybrid VNS/Tabu search algorithm for apportioning the european parliament
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Journal of Intelligent Manufacturing
Composing fifth species counterpoint music with a variable neighborhood search algorithm
Expert Systems with Applications: An International Journal
Iterated local search in nurse rostering problem
Proceedings of the Fourth Symposium on Information and Communication Technology
Applied p-median and p-center algorithms for facility location problems
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on the p-median problem. Results on 1400, 3038 and 5934 node instances from the TSP library show VNDS improves notably upon VNS in less computing time, and gives much better results than Fast Interchange (FI), in the same time that FI takes for a single descent. Moreover, Reduced VNS (RVNS), which does not use a descent phase, gives results similar to those of FI in much less computing time.