A genetic algorithm for a bi-objective capacitated arc routing problem.
Philippe LacommeChristian PrinsMarc SevauxPublished in: Comput. Oper. Res. (2006)
Keyphrases
- bi objective
- genetic algorithm
- multi objective
- multi objective optimization
- ant colony optimization
- efficient solutions
- multiple objectives
- nsga ii
- memetic algorithm
- evolutionary algorithm
- set covering problem
- routing problem
- optimization algorithm
- lower bound
- fitness function
- network design
- neural network
- objective function
- simulated annealing
- shortest path problem
- lower and upper bounds
- crossover operator
- multi objective evolutionary algorithms
- knapsack problem
- evolutionary computation
- particle swarm optimization
- metaheuristic
- artificial neural networks
- genetic programming
- job shop scheduling problem
- branch and bound
- search algorithm
- mathematical model