Pages that link to "Item:Q2489299"

The following pages link to Simulated annealing heuristics for the dynamic facility layout problem (Q2489299):

Displaying 16 items.

• A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
• Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
• The museum visitor routing problem (Q969135) (← links)
• An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem (Q1048304) (← links)
• A cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264) (← links)
• Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments (Q1652644) (← links)
• Optimization of consignment-store-based supply chain with black hole algorithm (Q1688092) (← links)
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• A new approach to weapon-target assignment in cooperative air combat (Q1992564) (← links)
• Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations (Q2399343) (← links)
• A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem (Q2954357) (← links)
• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem (Q3055216) (← links)
• Recent advances in dynamic facility layout research (Q5882275) (← links)
• The zone-based dynamic facility layout problem (Q5884346) (← links)
• A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach (Q5889164) (← links)