Skewed general variable neighborhood search for the location routing scheduling problem.
Rita MacedoCláudio AlvesSaïd HanafiBassem JarbouiNenad MladenovicBruna RamosJosé M. Valério de CarvalhoPublished in: Comput. Oper. Res. (2015)
Keyphrases
- scheduling problem
- tabu search
- variable neighborhood search
- special case
- total weighted tardiness
- routing problem
- single machine
- metaheuristic
- flowshop
- np hard
- shortest path
- routing algorithm
- simulated annealing
- worst case
- traveling salesman problem
- vehicle routing problem
- sensor networks
- precedence constraints
- path relinking
- neural network