Pages that link to "Item:Q1197688"

The following pages link to Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688):

Displaying 50 items.

• Fast local search for single row facility layout (Q319872) (← links)
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← links)
• Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm (Q337195) (← links)
• Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
• A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
• Single row facility layout problem using a permutation-based genetic algorithm (Q545111) (← links)
• A new lower bound for the single row facility layout problem (Q1003774) (← links)
• Recent models and techniques for solving the layout problem (Q1197682) (← links)
• Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes (Q1266662) (← links)
• A neural network approach to facility layout problems (Q1266731) (← links)
• Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations (Q1390207) (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
• Hope: A genetic algorithm for the unequal area facility layout problem. (Q1406662) (← links)
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
• Layout designs in cellular manufacturing (Q1806908) (← links)
• Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
• Simulated annealing heuristics for managing resources during planned outages at electric power plants (Q1886731) (← links)
• An ant algorithm for the single row layout problem in flexible manufacturing systems (Q1886861) (← links)
• A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Optimal solutions for the double row layout problem (Q1940444) (← links)
• The single row facility layout problem: state of the art (Q1947218) (← links)
• Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models (Q2173001) (← links)
• An efficient tabu algorithm for the single row facility layout problem (Q2270298) (← links)
• Layout design for flexible manufacturing systems considering single-loop directional flow patterns (Q2387230) (← links)
• An efficient genetic algorithm for single row facility layout (Q2448146) (← links)
• Simulated annealing heuristics for the dynamic facility layout problem (Q2489299) (← links)
• On the exact solution of a facility layout problem (Q2496073) (← links)
• Hybrid ant systems for the dynamic facility layout problem (Q2566943) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty (Q2940068) (← links)
• A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices (Q3163315) (← links)
• The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms (Q3296257) (← links)
• A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems (Q3439876) (← links)
• Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
• A practical method for design of hybrid-type production facilities (Q4230113) (← links)
• A new simulated annealing algorithm for the facility layout problem (Q4230174) (← links)
• An improved tabu search heuristic for solving facility layout design problems (Q4230253) (← links)
• Machine layout problem in modern manufacturing facilities (Q4394376) (← links)
• Optimization of cube-per-order index warehouse layouts with zoning constraints (Q4398921) (← links)
• Simulated annealing algorithm for solving the single machine early/tardy problem (Q4895700) (← links)
• (Q5020887) (← links)
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)
• Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm (Q5690288) (← links)
• Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) (← links)