The multiple shortest path problem with path deconfliction
type: Item
instance of: scholarly article
title: The multiple shortest path problem with path deconfliction
zbMATH Open document ID: 1487.90621
author: Michael S. Hughes
author: Brian J. Lunday
author: Jeffrey D. Weir
author: Kenneth M. Hopkinson
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7355978
zbMATH Keywords: routing
zbMATH Keywords: shortest path problem
zbMATH Keywords: path deconfliction
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: multi-agent
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.11.033
OpenAlex ID: W3108450668
cites work: Q3056948
cites work: Solving the \(k\)-shortest path problem with time windows in a time varying network
cites work: A review of TSP based approaches for flowshop scheduling
cites work: Onkth Best Policies
cites work: A heuristic approach to the overnight security service problem
cites work: Finding non-dominated bicriteria shortest pairs of disjoint simple paths
cites work: On the shortest route through a network
cites work: The truck dispatching problem
cites work: A branch and bound algorithm for symmetric 2-peripatetic salesman problems
cites work: A note on two problems in connexion with graphs
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Multicriteria Optimization
cites work: The Traveling-Salesman Problem
cites work: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
cites work: A Method for the Solution of the N th Best Path Problem
cites work: Shortest-path network interdiction
cites work: System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
cites work: Multi-objective routing within large scale facilities using open finite queueing networks
cites work: Q4068472
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: A lexicographic minimax approach to the vehicle routing problem with route balancing
cites work: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
cites work: A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
cites work: Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
cites work: The savings algorithm for the vehicle routing problem
cites work: Solutions of the kth best route through a network. A review
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: Multi-objective and multi-constrained non-additive shortest path problems
cites work: Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
cites work: Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
cites work: The \(k\)-dissimilar vehicle routing problem
cites work: Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
cites work: Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
cites work: Using a TSP heuristic for routing order pickers in warehouses
cites work: Improvement heuristics for the vehicle routing problem based on simulated annealing
cites work: Automata, Languages and Programming
cites work: Uncertain multiobjective traveling salesman problem
cites work: Q4943600
cites work: Finding the K Shortest Loopless Paths in a Network
cites work: A relationship between bounds on the sum of squares of degrees of a graph
cites work: Shortest path algorithms: An evaluation using real road networks
DOI: 10.1016/J.EJOR.2020.11.033
description: scientific article; zbMATH DE number 7355978