Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
From MaRDI portal
Publication:337195
DOI10.1016/j.cor.2014.07.008zbMath1348.90401OpenAlexW2156130598MaRDI QIDQ337195
Dilip Datta, Zahnupriya Kalita
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.008
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (4)
Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem ⋮ Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ Dynamic facility layout problem based on open queuing network theory
Cites Work
- The corridor allocation problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure for the single-row facility layout problem
- An efficient constraint handling method for genetic algorithms
- Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Optimal solutions for the double row layout problem
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- An efficient tabu algorithm for the single row facility layout problem
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- The double row layout problem
- On the One-Dimensional Space Allocation Problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
