The multiple shortest path problem with path deconfliction

DOI10.1016/j.ejor.2020.11.033zbMath1487.90621OpenAlexW3108450668MaRDI QIDQ2030451

Jeffrey D. Weir, Michael S. Hughes, Brian J. Lunday, 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

zbMATH Keywords

multi-objective optimizationroutingshortest path problemmulti-agentpath deconfliction

Mathematics Subject Classification ID

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

Related Items (1)

Finding shortest and dissimilar paths

Uses Software

• VRP

Cites Work

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

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