Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation.
Kay Chen TanChun Yew CheongChi Keong GohPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- evolutionary computation
- vehicle routing problem
- multi objective
- evolutionary algorithm
- stochastic demand
- combinatorial optimization
- optimization problems
- particle swarm optimization
- metaheuristic
- simulated annealing
- genetic algorithm
- tabu search
- evolutionary approaches
- benchmark problems
- memetic algorithm
- vehicle routing problem with simultaneous
- genetic programming
- swarm intelligence
- multi objective optimization
- optimization algorithm
- routing problem
- computational intelligence
- inventory control
- fitness function
- traveling salesman problem
- multiobjective optimization
- search strategies
- nsga ii
- vehicle routing
- infinite horizon
- travel time
- np hard
- differential evolution
- artificial bee colony
- combinatorial optimization problems
- knapsack problem
- ant colony optimization
- lead time
- pick up and delivery
- multiple objectives
- test problems
- scatter search
- branch and bound
- search space
- genetic operators
- lower bound
- artificial intelligence
- crossover operator
- dynamic programming
- fuzzy logic
- supply chain
- branch and bound algorithm
- genetic algorithm ga