First vs. best improvement: an empirical study
From MaRDI portal
Publication:2489903
DOI10.1016/j.dam.2005.05.020zbMath1120.90048OpenAlexW2153654605MaRDI QIDQ2489903
Pierre Hansen, Nenad Mladenović
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.020
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem, A local search heuristic for the \((r| p)\)-centroid problem in the plane, A simple and effective evolutionary algorithm for the capacitated location-routing problem, A VNS approach to multi-location inventory redistribution with vehicle routing, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Constructive-destructive heuristics for the safe set problem, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, The uncapacitated r‐allocation p‐hub center problem, Partial neighborhood local searches, An iterated greedy algorithm for finding the minimum dominating set in graphs, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, In-depth analysis of granular local search for capacitated vehicle routing, Variable neighborhood search: the power of change and simplicity, A new fuzzy model for multi-criteria project portfolio selection based on modified Kerre's inequality, Variable neighborhood search: basics and variants, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Variable neighbourhood search: methods and applications, Multistart search for the cyclic cutwidth minimization problem, Variable neighborhood search for the heaviest \(k\)-subgraph, Variable neighbourhood search: Methods and applications, Finding the maximum multi improvement on neighborhood exploration, Speed-up techniques for solving large-scale biobjective TSP, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Uses Software
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Variable neighborhood search
- TSPLIB—A Traveling Salesman Problem Library
- Fast Algorithms for Geometric Traveling Salesman Problems
- Variable Neighborhood Search
- Data Structures for Traveling Salesmen
- The Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Variable neighborhood search: Principles and applications
