Solving transportation problems with nonlinear side constraints with tabu search.
Buyang CaoGötz UebePublished in: Comput. Oper. Res. (1995)
Keyphrases
- tabu search
- transportation problem
- simulated annealing
- metaheuristic
- feasible solution
- memetic algorithm
- path relinking
- scheduling problem
- search heuristics
- mixed integer program
- multi start
- search algorithm for solving
- heuristic methods
- combinatorial optimization
- quadratic assignment problem
- search procedure
- genetic algorithm
- job shop scheduling problem
- test problems
- vehicle routing problem
- search algorithm
- scatter search
- multidimensional knapsack problem
- max sat
- benchmark instances
- timetabling problem
- hybrid algorithm
- simulated annealing and tabu search
- tabu search algorithm
- constraint satisfaction
- graph colouring
- tabu list
- iterated local search
- special case
- optimization problems
- flowshop
- lp relaxation
- integer program
- traveling salesman problem
- global constraints
- particle swarm optimization
- constraint programming
- cost function
- initial solution
- mixed integer
- distributed constraint optimization problems
- combinatorial problems
- candidate list
- integer programming