The multiple shortest path problem with path deconfliction

DOI10.1016/J.EJOR.2020.11.033zbMATH Open1487.90621OpenAlexW3108450668MaRDI QIDQ2030451FDOQ2030451

Authors: Michael S. Hughes, Brian J. Lunday, Jeffrey D. Weir, Kenneth M. Hopkinson 

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.033

Recommendations

• Conflict-based search for optimal multi-agent pathfinding
• A penalty search algorithm for the obstacle neutralization problem
• Branch-and-cut-and-price for multi-agent path finding
• Optimal Coordinated Motions of Multiple Agents Moving on a Plane
• scientific article; zbMATH DE number 5863215

zbMATH Keywords

multi-objective optimizationshortest path problemroutingmulti-agentpath deconfliction

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A note on two problems in connexion with graphs
• Multicriteria Optimization
• The vehicle routing problem: An overview of exact and approximate algorithms
• The truck dispatching problem
• Title not available (Why is that?)
• Multi-objective and multi-constrained non-additive shortest path problems
• Shortest path algorithms: An evaluation using real road networks
• The multiobjective traveling salesman problem: A survey and a new approach
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Finding the K Shortest Loopless Paths in a Network
• An Appraisal of Some Shortest-Path Algorithms
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• Title not available (Why is that?)
• A Method for the Solution of the N th Best Path Problem
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• The savings algorithm for the vehicle routing problem
• A heuristic approach to the overnight security service problem
• The \(k\)-dissimilar vehicle routing problem
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• Shortest-path network interdiction
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• Using a TSP heuristic for routing order pickers in warehouses
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• On the shortest route through a network
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• The traveling-salesman problem
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths
• A review of TSP based approaches for flowshop scheduling
• Automata, Languages and Programming
• Multi-objective routing within large scale facilities using open finite queueing networks
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• A relationship between bounds on the sum of squares of degrees of a graph
• Onkth Best Policies
• Solutions of the kth best route through a network. A review
• Uncertain multiobjective traveling salesman problem
• A lexicographic minimax approach to the vehicle routing problem with route balancing

Cited In (3)

• Finding shortest and dissimilar paths
• Recent advances in artificial autonomous decision systems and their applications
• Finding Multi-Constrained Multiple Shortest Paths

Uses Software

• VRP

This page was built for publication: The multiple shortest path problem with path deconfliction

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