A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem.
Wojciech JaskowskiMarcin Grzegorz SzubertPiotr GawronPublished in: Ann. Oper. Res. (2016)
Keyphrases
- mip solver
- metaheuristic
- combinatorial optimization
- mixed integer programming
- constrained problems
- simulated annealing
- tabu search
- vehicle routing problem
- optimization problems
- strongly np hard
- feasible solution
- mixed integer program
- simulated annealing and tabu search
- optimal solution
- ant colony optimization
- mathematical programming
- particle swarm optimization
- scheduling problem
- variable ordering
- specially designed
- grasp with path relinking
- genetic algorithm
- parallel genetic algorithm
- search space
- search algorithm
- timetabling problem
- scheduling jobs
- flowshop
- branch and bound search
- vehicle routing
- exact algorithms
- exact solution
- column generation
- constraint propagation
- search strategies
- multistage
- multi objective
- evolutionary algorithm
- lower bound
- objective function