A comparison of heuristic best-first algorithms for bicriterion shortest path problems
From MaRDI portal
(Redirected from Publication:439323)
artificial intelligencebest-first searchcombinatorial optimizationheuristic searchmultiobjective shortest path problemsearch theory
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- An empirical investigation of some bicriterion shortest path algorithms
- Efficient solution generation for the bicriterion shortest path problems
- A parametric approach to solving bicriterion shortest path problems
- Heuristics for the bi-objective path dissimilarity problem
- scientific article; zbMATH DE number 1783874
- Algorithms for time-dependent bicriteria shortest path problems
- A heuristic approach to hard constrained shortest path problems
- A comparison of solution strategies for biobjective shortest path problems
- scientific article; zbMATH DE number 4179156
- Heuristics for biquadratic assignment problems and their computational comparison
Cites work
- A bicriterion approach for routing problems in multimedia networks
- A comparison of solution strategies for biobjective shortest path problems
- A multicriteria Pareto-optimal path algorithm
- A note on two problems in connexion with graphs
- A parametric approach to solving bicriterion shortest path problems
- An aggregate label setting policy for the multi-objective shortest path problem
- An empirical investigation of some bicriterion shortest path algorithms
- An extension of labeling techniques for finding shortest path trees
- Generalized best-first search strategies and the optimality of A*
- scientific article; zbMATH DE number 4179156 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 1488066 (Why is no real title available?)
- Multi-objective vehicle routing problems
- Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
- Multiobjective A*
- On the cardinality of the Pareto set in bicriteria shortest path problems
Cited in
(8)- Non-additive shortest path in the context of traffic assignment
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- Shortest paths with a cost constraint: a probabilistic analysis
- An exact method for the biobjective shortest path problem for large-scale road networks
- Multiobjective shortest path problems with lexicographic goal-based preferences
- Dimensionality reduction in multiobjective shortest path search
- A parametric approach to solving bicriterion shortest path problems
- Lower bound sets for biobjective shortest path problems
This page was built for publication: A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439323)
