A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem.
Omer Berk OlmezCeren GultekinBurcu BalcikAli EkiciOkan Örsan ÖzenerPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- network design problem
- variable neighborhood search
- traveling salesman problem
- network design
- metaheuristic
- transportation networks
- valid inequalities
- approximation algorithms
- tabu search
- branch and bound
- minimal cost
- heuristic methods
- hybrid method
- single machine scheduling problem
- routing problem
- lagrangian relaxation
- mixed integer programming
- integer programming
- combinatorial optimization
- vehicle routing problem
- minimum spanning tree
- mixed integer
- benchmark instances
- exact solution
- communication networks
- ant colony optimization
- lower bound
- simulated annealing
- energy function
- neural network
- column generation