Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional Bin Packing Problem.
Joseph Gallart SuarezManuel Tupia AnticonaPublished in: Adv. Inf. Sci. Serv. Sci. (2010)
Keyphrases
- metaheuristic
- tabu search
- combinatorial optimization
- simulated annealing
- optimization problems
- ant colony optimization
- scatter search
- variable neighbourhood search
- mip solver
- vehicle routing problem
- memetic algorithm
- search space
- path relinking
- optimal solution
- combinatorial optimization problems
- genetic algorithm
- iterated local search
- grasp with path relinking
- particle swarm optimization
- lower bound
- hybrid algorithms
- timetabling problem
- suboptimal solutions
- feasible solution
- nature inspired
- combinatorial problems
- benchmark instances
- evolutionary algorithm
- variable neighborhood search
- traveling salesman problem
- search procedure
- heuristic methods
- knapsack problem
- job shop scheduling problem
- multi start
- np complete problems
- metaheuristic algorithms
- hybrid metaheuristic
- optimization algorithm
- candidate list
- np hard
- mixed integer program
- guided local search