Vibrational genetic algorithm (Vga) for solving continuous covering location problems

DOI10.1007/3-540-36077-8_30MaRDI QIDQ4410986zbMATH OpenFDO

Authors Murat Ermis, Füsun Ülengin, Abdurrahman Hacioglu

Publication date 7 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2457/24570293.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
• Generalized particular covering problem with genetic algorithms
• A genetic algorithm for solving variational inequality problem
• Vibrational genetic algorithm (VGA) and dynamic mesh in the optimization of 3D wing geometries
• Gaussian variable neighborhood search and enhanced genetic algorithm for continuous optimization
• Fixed-parameter evolutionary algorithms and the vertex cover problem
• An efficient hybrid genetic algorithm for continuous optimization problems

Cited in

(1)

• Coupling dynamic mesh technique and heuristic algorithms in 3-D-tapered wing design

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Vibrational genetic algorithm (Vga) for solving continuous covering location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410986)