A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem.
Agostinho AgraMarielle ChristiansenLars Magnus HvattumFilipe RodriguesPublished in: ICCL (2016)
Keyphrases
- mixed integer programming
- tabu search
- search algorithm
- optimal solution
- feasible solution
- simulated annealing
- combinatorial optimization
- job shop scheduling problem
- multi start
- neighborhood search
- search procedure
- domain independent planning
- hill climbing
- search strategies
- column generation
- stochastic approximation
- integer programming
- iterated local search
- search procedures
- metaheuristic
- decision support system
- scheduling problem
- genetic algorithm
- lot sizing
- memetic algorithm
- greedy search
- search space
- heuristic methods
- packing problem
- systematic search
- simulated annealing and tabu search
- stochastic local search
- initial solution
- guided local search
- global search
- solution quality
- dynamic programming
- tree search
- search heuristics
- lagrangian relaxation
- specially designed
- mathematical programming
- constraint programming
- heuristic search
- multistage
- mip solver
- objective function