Memetic algorithms
From MaRDI portal
Publication:2573010
DOI10.1007/s10732-005-1509-4zbMath1122.90415OpenAlexW2060772174MaRDI QIDQ2573010
José Luis González-Velarde, Karim De-Alba, Ada M. 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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- A dual ascent approach to the fixed-charge capacitated network design problem
- A GRASP for aircraft routing in response to groundings and delays
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Minimizing labor requirements in a periodic vehicle loading problem
- GRASP for seam drawing in mosaicking of aerial photographic maps
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- Tailoring Benders decomposition for uncapacitated network design
- Analysis of a flow problem with fixed charges
- The complexity of the network design problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
