Pages that link to "Item:Q320805"

The following pages link to Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805):

Displayed 9 items.

• A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics (Q1681320) ‎ (← links)
• A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) ‎ (← links)
• A new solution method of ant colony-based logistic center area layout problem (Q1789158) ‎ (← links)
• A decomposition-based algorithm for the double row layout problem (Q1988733) ‎ (← links)
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) ‎ (← links)
• New exact approaches to row layout problems (Q2295979) ‎ (← links)
• Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) ‎ (← links)
• Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields (Q2675707) ‎ (← links)
• Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) ‎ (← links)