A heuristic approach for solving a rich min-max vehicle routing problem with mixed fleet and mixed demand.
Ertan YakiciPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- vehicle routing problem
- min max
- combinatorial optimization
- tabu search
- benchmark instances
- metaheuristic
- multi depot
- test instances
- simulated annealing
- tree search algorithm
- routing problem
- traveling salesman problem
- iterated local search
- vehicle routing problem with time windows
- vehicle routing
- variable neighborhood search
- hybrid metaheuristic
- neighborhood search
- benchmark problems
- memetic algorithm
- optimal solution
- logistics distribution
- np hard
- vehicle routing problem with simultaneous
- search algorithm
- search strategies
- max min
- travel time
- search heuristics
- particle swarm optimization
- timetabling problem
- optimization problems
- data structure
- multiobjective optimization
- path relinking
- dynamic programming
- branch and bound
- evolutionary algorithm
- exact algorithms
- neural network