A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations.
Maurizio BruglieriDaniele FeronePaola FestaOrnella PisacanePublished in: Comput. Oper. Res. (2022)
Keyphrases
- vehicle routing problem
- objective function
- tabu search
- metaheuristic
- feasible solution
- optimization problems
- routing problem
- vehicle routing problem with time windows
- penalty term
- vehicle routing
- benchmark problems
- simulated annealing
- optimal solution
- multi objective
- penalty function
- test instances
- cost function
- lower bound
- hybrid metaheuristic
- memetic algorithm
- travel time
- traveling salesman problem
- linear programming
- np hard
- particle swarm optimization
- combinatorial optimization
- path relinking
- genetic algorithm
- logistics distribution
- scheduling problem
- search procedure
- greedy algorithm
- search methods
- scatter search
- variable neighborhood search
- knapsack problem
- linear program
- search algorithm
- multi depot
- vehicle routing problem with simultaneous
- heuristic search
- worst case
- neural network
- pick up and delivery
- greedy randomized adaptive search procedure