Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm
From MaRDI portal
Publication:3296256
Recommendations
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Optimization design of multiple services for urban bus corridor with genetic algorithm
- The corridor allocation problem
- scientific article; zbMATH DE number 5152600
- A genetic algorithm based approach to optimal toll level and location problems
- A biased random-key genetic algorithm for road congestion minimization
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
Cites work
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- The corridor allocation problem
- The double row layout problem
Cited in
(5)- 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
- scientific article; zbMATH DE number 5152600 (Why is no real title available?)
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- The corridor allocation problem
This page was built for publication: Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296256)