A comparison of heuristic best-first algorithms for bicriterion shortest path problems.
Enrique MachucaLawrence MandowJosé-Luis Pérez-de-la-CruzAmparo Ruiz-SepúlvedaPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- combinatorial optimization
- exact algorithms
- solution quality
- orders of magnitude
- running times
- hill climbing
- combinatorial optimization problems
- times faster
- neural network
- benchmark datasets
- computationally efficient
- dynamic programming
- significant improvement
- search algorithm
- learning algorithm
- optimization problems
- computational efficiency
- worst case
- search strategies
- computational complexity
- packing problem
- optimal solution