Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach.
Crina GrosanAjith AbrahamPublished in: Asia International Conference on Modelling and Simulation (2007)
Keyphrases
- bi objective
- shortest path
- shortest path problem
- set covering problem
- routing problem
- efficient solutions
- multi objective
- vehicle routing problem with stochastic demands
- combinatorial optimization
- optimal solution
- hybrid algorithms
- multi objective optimization
- network flow problem
- path length
- heuristic methods
- multiple objectives
- ant colony optimization
- heuristic solution
- network design
- search algorithm
- solution quality
- np hard
- lot sizing
- tabu search
- routing algorithm
- simulated annealing
- dynamic programming
- cost function
- objective function
- network design problem
- lagrangian relaxation
- search strategies
- road network
- neural network model