A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows.
Jésica de ArmasEduardo Lalla-RuizChristopher Expósito IzquierdoDario Landa-SilvaBelén Melián-BatistaPublished in: Eng. Appl. Artif. Intell. (2015)
Keyphrases
- tabu search
- scheduling problem
- vehicle routing problem
- variable neighborhood search
- routing problem
- metaheuristic
- flowshop
- vehicle routing
- path relinking
- single machine
- simulated annealing
- feasible solution
- memetic algorithm
- benchmark instances
- setup times
- hybrid algorithm
- np hard
- hybrid method
- precedence constraints
- grasp with path relinking
- traveling salesman problem
- heuristic methods
- processing times
- scatter search
- permutation flowshop
- minimizing makespan
- search algorithm
- single machine scheduling problem
- travel time
- job shop scheduling problem
- lot sizing
- continuous attributes
- genetic algorithm
- search procedure
- network topologies
- routing algorithm
- solution quality
- routing protocol
- release dates
- special case
- evolutionary algorithm
- total tardiness
- search space
- optimal solution