Grouping evolution strategies: an effective approach for grouping problems

DOI10.1016/J.APM.2014.11.001MaRDI QIDQ2009978zbMATH OpenOpenAlexFDO

Authors Ali Husseinzadeh Kashan, Ali Akbari, Bakhtiar Ostadi

Publication date 3 December 2019

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2014.11.001

zbMATH Keywords

batch-processing machine scheduling problembin-packing problemgrouping evolution strategiesgrouping genetic algorithmgrouping particle swarm optimizationgrouping problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 970353
• scientific article; zbMATH DE number 558543
• A particle swarm optimizer for grouping problems
• Impact of the replacement heuristic in a grouping genetic algorithm.
• scientific article; zbMATH DE number 2101401

Cites work

• A comparison of evolution strategies with other direct search methods in the presence of noise
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• A grouping genetic algorithm for the pickup and delivery problem with time windows
• A hybrid grouping genetic algorithm for the cell formation problem
• A new metaheuristic for optimization: optics inspired optimization (OIO)
• A particle swarm optimizer for grouping problems
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• CF-GGA: A grouping genetic algorithm for the cell formation problem
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Evolution strategies. A comprehensive introduction
• scientific article; zbMATH DE number 1728536 (Why is no real title available?)
• Lower bounds and reduction procedures for the bin packing problem
• Minimising material handling cost in cell formation with alternative processing routes by grouping genetic algorithm
• Scheduling a single batch processing machine with non-identical job sizes

Cited in

(13)

• Impact of the replacement heuristic in a grouping genetic algorithm.
• Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability
• Optimizing group learning: an evolutionary computing approach
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• scientific article; zbMATH DE number 2101401 (Why is no real title available?)
• A particle swarm optimizer for grouping problems
• scientific article; zbMATH DE number 970353 (Why is no real title available?)
• Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
• A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
• A new class of lower bounds for scheduling a batch processing machine to minimize makespan
• The two-dimensional orthogonal packing problem with item fragmentation: formulation and local search-based algorithms (applications on tank-farm layout planning)
• Integrated assortment and distribution planning in vendor-managed inventory systems: a clustering-based grouping evolution strategy and adaptive large neighborhood search approach

Describes a project that uses

Uses Software

• CF-GGA
• Bison

This page was built for publication: Grouping evolution strategies: an effective approach for grouping problems

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