A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups.
Igor Machado CoelhoPablo Luiz Araújo MunhozMatheus Nohra HaddadMarcone Jamilson Freitas SouzaLuiz Satoru OchiPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- hybrid metaheuristic
- benchmark instances
- tabu search
- routing problem
- neighborhood search
- traveling salesman problem
- benchmark problems
- special case
- travel time
- combinatorial optimization
- np hard
- test instances
- particle swarm optimization
- search strategies
- combinatorial optimization problems
- memetic algorithm
- simulated annealing
- ant colony optimization
- vehicle routing problem with simultaneous
- shortest path
- optimization problems
- scatter search
- cost function
- evolutionary algorithm
- pick up and delivery