A new adaptive multi-start technique for combinatorial global optimizations

DOI10.1016/0167-6377(94)90065-5zbMath0812.90126OpenAlexW2032431794MaRDI QIDQ1342281

Kenneth D. Boese, Andrew B. Kahng, Sudhakar Muddu

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90065-5

zbMATH Keywords

traveling salesman graph bisection local minima heuristic search heuristic global optimization multi-start implementations stochastic hill-climbing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Hybrid simulated annealing with memory: an evolution-based diversification approach ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A step counting hill climbing algorithm applied to university examination timetabling ⋮ Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior ⋮ Iterated maxima search for the maximally diverse grouping problem ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ A 2-OPT procedure to reduce total inspection time in a serial inspection process ⋮ A review of metrics on permutations for search landscape analysis ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions ⋮ Local Search Based on Genetic Algorithms ⋮ Genetic local search with distance preserving recombination operator for a vehicle routing problem. ⋮ A variable neighborhood search for graph coloring. ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ A note on edge-based graph partitioning and its linear algebraic structure ⋮ Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Multi-start approach for an integer determinant maximization problem ⋮ Distance preserving recombination operator for Earth observation satellites operations scheduling ⋮ Variable neighborhood search: Principles and applications ⋮ Multiagent cooperative search for portfolio selection ⋮ Dynamics of local search trajectory in traveling salesman problem ⋮ Reformulation descent applied to circle packing problems ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ Predatory search algorithm with restriction of solution distance ⋮ Attraction probabilities in variable neighborhood search ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ Solving thep-Center problem with Tabu Search and Variable Neighborhood Search ⋮ J-MEANS: A new local search heuristic for minimum sum of squares clustering ⋮ Transport clustering and routing as a visual meshing process ⋮ The big valley conjecture for the flow Steiner tree problem ⋮ An adaptive, multiple restarts neural network algorithm for graph coloring ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem ⋮ Graph coloring by multiagent fusion search ⋮ Simple control rules in a cooperative system for dynamic optimisation problems ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem ⋮ Problem difficulty for tabu search in job-shop scheduling ⋮ Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability ⋮ A fuzzy genetic algorithm for driver scheduling

Cites Work