Memetic algorithms

DOI10.1007/S10732-005-1509-4MaRDI QIDQ2573010zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

network designGRASPScatter Search

Mathematics Subject Classification ID

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)

Recommendations

• Scatter search for network design problem
• A scatter search heuristic for the fixed-charge capacitated network design problem
• Adaptive memory in multistart heuristics for multicommodity network design
• A Gentle Introduction to Memetic Algorithms
• Evolutionary Computation in Combinatorial Optimization

Cites work

• scientific article; zbMATH DE number 2209655 (Why is no real title available?)
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A GRASP for aircraft routing in response to groundings and delays
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• A dual ascent approach to the fixed-charge capacitated network design problem
• A grasp for job shop scheduling
• A probabilistic heuristic for a computationally difficult set covering problem
• Analysis of a flow problem with fixed charges
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• GRASP for seam drawing in mosaicking of aerial photographic maps
• Greedy randomized adaptive search procedures
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Minimizing labor requirements in a periodic vehicle loading problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• Tailoring Benders decomposition for uncapacitated network design
• The complexity of the network design 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
• Scatter search for network design problem
• Evolutionary Computation in Combinatorial Optimization

Describes a project that uses

Uses Software

• Scatter Search
• CPLEX

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)