Guidelines for the use of meta-heuristics in combinatorial optimization.
From MaRDI portal
Publication:1410607
DOI10.1016/S0377-2217(02)00823-8zbMath1053.90053OpenAlexW1966208092MaRDI QIDQ1410607
No author found.
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00823-8
Search theory (90B40) Proceedings of conferences of miscellaneous specific interest (00B25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
Integrated production and multiple trips vehicle routing with time windows and uncertain travel times ⋮ A memetic algorithm with dynamic population management for an integrated production-distribution problem ⋮ Computing the metric dimension of graphs by genetic algorithms ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Hybrid meta-heuristic algorithms for solving network design problem ⋮ The close-open mixed vehicle routing problem ⋮ Research trends in combinatorial optimization ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ A diversification operator for genetic algorithms ⋮ On scheduling around large restrictive common due windows ⋮ \(\text{MA}\mid\text{PM}\): memetic algorithms with population management ⋮ Soccer game optimization with substitute players ⋮ An overview of population-based algorithms for multi-objective optimisation ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ A novel kernel extreme learning machine algorithm based on self-adaptive artificial bee colony optimisation strategy ⋮ A Heuristic Approach to Assist Side Channel Analysis of the Data Encryption Standard ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Finding a feasible course schedule using Tabu search
- Variable neighborhood search
- Future paths for integer programming and links to artificial intelligence
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- Probabilistic diversification and intensification in local search for vehicle routing
- Hybrid evolutionary algorithms for graph coloring
- A Tabu Search Heuristic for the Vehicle Routing Problem
