Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling

DOI10.1016/j.cor.2003.11.018zbMath1122.90427MaRDI QIDQ1764767

Publication date: 22 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.018

zbMATH Keywords

Ant colony optimization; Beam search; Open shop scheduling; Tree search

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem, A decomposition approach for the car resequencing problem with selectivity banks, An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed, On the part inventory model sequencing problem: complexity and beam search heuristic, A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem, Fidelity-based ant colony algorithm with Q-learning of quantum system, Compiling finite linear CSP into SAT, A beam search approach for the optimization version of the car sequencing problem, Ant colony optimization combined with taboo search for the job shop scheduling problem, ACS-TS: Train scheduling using ant colony system, A beam search implementation for the irregular shape packing problem, The museum visitor routing problem, Hybridizing exact methods and metaheuristics: a taxonomy, An effective heuristic algorithm for the partial shop scheduling problem, Solving integrated process planning and scheduling problem with constructive meta-heuristics, Open shop cyclic scheduling, Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates, Beam-ACO for the travelling salesman problem with time windows, Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling, A tabu search approach for proportionate multiprocessor open shop scheduling, A modified ant colony system for solving the travelling salesman problem with time windows, A new particle swarm optimization for the open shop scheduling problem, A Lagrangian-ACO matheuristic for car sequencing, Ant colony optimization theory: a survey, An Optimal Constraint Programming Approach to the Open-Shop Problem, A new particle swarm optimization for multi-objective open shop scheduling, Hybrid Metaheuristics: An Introduction, Hybridizations of Metaheuristics With Branch & Bound Derivates, Evolutionary Computational Technique in Automatic Generation Control of Multi-area Power Systems with Nonlinearity and Energy Storage Unit, Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan, q-Analogs of Packing Designs, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, ANALYTICAL AND NUMERICAL INVESTIGATION OF ANT BEHAVIOR UNDER CROWDED CONDITIONS, Multiple colony ant algorithm for job-shop scheduling problem, Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach

Uses Software

Cites Work