Pages that link to "Item:Q1764767"
From MaRDI portal
The following pages link to Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767):
Displayed 17 items.
- Compiling finite linear CSP into SAT (Q842794) (← links)
- A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling (Q2426522) (← links)
- A modified ant colony system for solving the travelling salesman problem with time windows (Q2472698) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- Ant colony optimization theory: a survey (Q2575081) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- ANALYTICAL AND NUMERICAL INVESTIGATION OF ANT BEHAVIOR UNDER CROWDED CONDITIONS (Q3439939) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)