Memetic algorithms
DOI10.1007/S10732-005-1509-4zbMATH Open1122.90415OpenAlexW2060772174MaRDI QIDQ2573010FDOQ2573010
Authors: José Luis González-Velarde, Karim De-Alba, Ada Alvarez 
Publication date: 7 November 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-005-1509-4
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A dual ascent approach to the fixed-charge capacitated network design problem
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Analysis of a flow problem with fixed charges
- A probabilistic heuristic for a computationally difficult set covering problem
- A GRASP for aircraft routing in response to groundings and delays
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The complexity of the network design problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Tailoring Benders decomposition for uncapacitated network design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- GRASP for seam drawing in mosaicking of aerial photographic maps
- A grasp for job shop scheduling
- Title not available (Why is that?)
- Minimizing labor requirements in a periodic vehicle loading problem
Cited In (6)
- A Gentle Introduction to Memetic Algorithms
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
- Adaptive memory in multistart heuristics for multicommodity network design
- Evolutionary Computation in Combinatorial Optimization
- Scatter search for network design problem
Uses Software
This page was built for publication: Memetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573010)
