An ILP-refined tabu search for the Directed Profitable Rural Postman Problem.
Claudia ArchettiGianfranco GuastarobaMaria Grazia SperanzaPublished in: Discret. Appl. Math. (2014)
Keyphrases
- tabu search
- metaheuristic
- simulated annealing
- inductive logic programming
- feasible solution
- vehicle routing problem
- routing problem
- traveling salesman problem
- scheduling problem
- memetic algorithm
- path relinking
- search algorithm
- search procedure
- heuristic methods
- test problems
- hybrid algorithm
- job shop scheduling problem
- benchmark instances
- iterated local search
- scatter search
- multidimensional knapsack problem
- genetic algorithm
- initial solution
- quadratic assignment problem
- combinatorial optimization
- multi start
- tabu search algorithm
- candidate list
- search heuristics
- combinatorial problems
- combinatorial optimization problems
- job shop
- neural network
- simulated annealing and tabu search