Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm

DOI10.1016/J.COR.2014.07.008MaRDI QIDQ337195zbMATH OpenOpenAlexFDO

Authors Zahnupriya Kalita, Dilip Datta

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

zbMATH Keywords

combinatorial optimizationgenetic algorithmmulti-objective optimizationcorridor allocation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm
• The corridor allocation problem
• Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Single row facility layout problem using a permutation-based genetic algorithm

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A heuristic procedure for the single-row facility layout problem
• A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• An efficient constraint handling method for genetic algorithms
• An efficient tabu algorithm for the single row facility layout problem
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Efficient models for the facility layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Multi-objective optimization using evolutionary algorithms
• On Solving A One-Dimensional Space Allocation Problem With Integer Programming
• On the One-Dimensional Space Allocation Problem
• On the exact solution of a facility layout problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Optimal solutions for the double row layout problem
• Single row facility layout problem using a permutation-based genetic algorithm
• Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• The corridor allocation problem
• The double row layout problem

Cited in

(6)

• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• The corridor allocation problem
• 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

This page was built for publication: Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337195)