A comparison of distance metrics for the multi-objective pathfinding problem

DOI10.1007/S11047-022-09908-ZMaRDI QIDQ6535739

Jens Weise, Sanaz Mostaghim

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

zbMATH Keywords

multi-objective optimizationshortest pathevolutionary algorithmnichingpathfindingpath similarities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Dimensionality reduction in multiobjective shortest path search
• Fréchet distance with speed limits
• On a multicriteria shortest path problem
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• Sur quelques points du calcul fonctionnel.
• An improved approximation algorithm for the discrete Fréchet distance
• New similarity measures between polylines with applications to morphing and polygon sweeping
• A comparison of genetic representations for multi-objective shortest path problems on multigraphs
• Approximability of the discrete Fréchet distance
• Fréchet-Distance on Road Networks
• Multiobjective A ^* search with consistent heuristics
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• The Effects of Crowding Distance and Mutation in Multimodal and Multi-objective Optimization Problems
• Combining Manhattan and Crowding Distances in Decision Space for Multimodal Multi-objective Optimization Problems
• Evolutionary Multi-Criterion Optimization

This page was built for publication: A comparison of distance metrics for the multi-objective pathfinding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535739)