A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints.
Kamyla Maria FerreiraThiago Alves de QueirozPublished in: Appl. Soft Comput. (2022)
Keyphrases
- simulated annealing
- tabu search
- genetic algorithm
- three dimensional
- solution quality
- metaheuristic
- packing problem
- optimization method
- evolutionary algorithm
- combinatorial optimization
- constraint satisfaction
- hill climbing
- depth first search
- benchmark problems
- simulated annealing algorithm
- neighborhood search
- linear constraints
- solution space
- vehicle routing problem
- global optimum
- search procedure
- reversible jump mcmc
- dantzig wolfe
- heuristic methods
- constrained optimization
- optimal solution
- lower and upper bounds
- search strategies
- constraint programming
- exact algorithms
- search algorithm
- search space
- mixed integer program
- multi dimensional
- threshold accepting
- dynamic programming
- hybrid meta heuristic
- special case