A heuristic aided Stochastic Beam Search algorithm for solving the transit network design problem.
Kazi Ashik IslamIbraheem Muhammad MoosaJaiaid MobinMuhammad Ali NayeemM. Sohel RahmanPublished in: Swarm Evol. Comput. (2019)
Keyphrases
- network design problem
- capacitated fixed charge
- heuristic solution
- search algorithm for solving
- search algorithm
- branch and bound
- mixed integer programming
- lagrangian relaxation
- benders decomposition
- lower bound
- approximation algorithms
- network design
- lagrangian heuristic
- tabu search
- minimal cost
- mixed integer
- transportation networks
- valid inequalities
- feasible solution
- optimal solution
- integer programming
- branch and bound algorithm
- column generation
- combinatorial optimization
- upper bound
- exact algorithms
- np hard
- simulated annealing
- linear programming
- mathematical programming
- metaheuristic
- objective function
- worst case
- production planning
- neural network
- search strategies
- distributed databases