Pages that link to "Item:Q3157308"
From MaRDI portal
The following pages link to Ant colonies for the quadratic assignment problem (Q3157308):
Displaying 50 items.
- HAS-QAP (Q32324) (← links)
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups (Q868130) (← links)
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization (Q932221) (← links)
- Optimum exact/approximate point synthesis of planar mechanisms (Q954017) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- Ant colony approach to constrained redundancy optimization in binary systems (Q969340) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
- Fresh seafood delivery routing problem using an improved ant colony optimization (Q1730650) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
- An ant algorithm for the single row layout problem in flexible manufacturing systems (Q1886861) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem (Q2055580) (← links)
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time (Q2281749) (← links)
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (Q2283785) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- An improved ant colony optimization for vehicle routing problem (Q2378461) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Time dependent vehicle routing problem with a multi ant colony system (Q2464200) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- A modified ant colony system for solving the travelling salesman problem with time windows (Q2472698) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- An aggregated clustering approach using multi-ant colonies algorithms (Q2495922) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- Hybrid ant systems for the dynamic facility layout problem (Q2566943) (← links)
- Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES (Q2931727) (← links)
- A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM (Q3401072) (← links)
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem (Q3616856) (← links)
- USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS (Q3638815) (← links)
