A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem.
Luciano CostaThibaut LustRaphael KramerAnand SubramanianPublished in: Networks (2018)
Keyphrases
- bi objective
- routing problem
- pareto local search
- set covering problem
- variable neighborhood search
- vehicle routing problem
- traveling salesman problem
- shortest path
- efficient solutions
- routing algorithm
- neural network
- travel time
- ant colony optimization
- global optimization
- end to end
- neighborhood search
- search algorithm