DPSO Based on Random Particle Priority Value and Decomposition Procedure as a Searching Strategy for the Evacuation Vehicle Routing Problem.
Marina YusoffJunaidah AriffinAzlinah MohamedPublished in: ICONIP (3) (2012)
Keyphrases
- np hard
- vehicle routing problem
- discrete particle swarm optimization
- routing problem
- greedy randomized adaptive search procedure
- vehicle routing
- special case
- vehicle routing problem with time windows
- knapsack problem
- search strategies
- particle swarm optimization
- travel time
- benchmark instances
- hybrid metaheuristic
- multi depot
- constraint satisfaction problems
- neural network
- combinatorial optimization
- traveling salesman problem
- tabu search
- iterated local search
- variable neighborhood search
- heuristic search
- search strategy
- global optimization