Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm

DOI10.1007/978-3-030-26458-1_19zbMath1436.90163OpenAlexW2999755286MaRDI QIDQ3296256

Zahnupriya Kalita, Dilip Datta

Publication date: 7 July 2020

Published in: Nature-Inspired Methods for Metaheuristics Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26458-1_19

zbMATH Keywords

combinatorial optimizationgenetic algorithmcorridor allocation problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
• The corridor allocation problem
• Single row facility layout problem using a permutation-based genetic algorithm
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• The double row layout problem

This page was built for publication: Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm