NeuroGenetic approach for combinatorial optimization: an exploratory analysis
From MaRDI portal
Publication:970182
DOI10.1007/s10479-009-0562-zzbMath1185.90167OpenAlexW2033142334MaRDI QIDQ970182
Selcuk Colak, Jason Deane, Anurag Agarwal
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0562-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- ``Neural computation of decisions in optimization problems
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- A genetic algorithm for the multidimensional knapsack problem
- Genetic algorithms and tabu search: Hybrids for optimization
- Augmented neural networks for task scheduling.
- An electromagnetism-like mechanism for global optimization
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- An Improved Augmented Neural-Network Approach for Scheduling Problems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Tabu Search—Part I
- A simulated annealing algorithm for resource constrained project scheduling problems
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A competitive heuristic solution technique for resource-constrained project scheduling
This page was built for publication: NeuroGenetic approach for combinatorial optimization: an exploratory analysis
