Beam-ACO

swMATH11745MaRDI QIDQ23684FDOQ23684

Author name not available (Why is that?)

Described by source

• Beam-ACO for simple assembly line balancing

Cited In (21)

• Beam-ACO for the travelling salesman problem with time windows
• A tabu search approach for proportionate multiprocessor open shop scheduling
• A new particle swarm optimization for the open shop scheduling problem
• A modified ant colony system for solving the travelling salesman problem with time windows
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• An effective heuristic algorithm for the partial shop scheduling problem
• The museum visitor routing problem
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A Lagrangian-ACO matheuristic for car sequencing
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Ant colony optimization theory: a survey
• A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem
• Hybridizing exact methods and metaheuristics: a taxonomy
• New efficient heuristics for scheduling open shops with makespan minimization
• A beam search approach for the optimization version of the car sequencing problem
• 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
• Compiling finite linear CSP into SAT
• Hybrid metaheuristics: an introduction

This page was built for software: Beam-ACO