The Shortest-Path Problem: Analysis and Comparison of Methods

Ortega–Arranz, Hector; Llanos, Diego R.; González-Escribano, Arturo

doi:10.2200/s00618ed1v01y201412tcs001

Cited by 24 publications

(13 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To compute the shortest path between customers, the most commonly applied algorithms are Dijkstra, Bellman-Ford, A * , contraction hierarchies, etc. [108,120]. By taking into account the recuperated energy of BEV, some arc weights could have a negative value, which makes most of the shortest path algorithms inapplicable.…”

Section: Energy Shortest Path Problem and The Electric Travelingmentioning

confidence: 99%

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Erdelić

Carić

2019

Journal of Advanced Transportation

175

View full text Add to dashboard Cite

In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.

show abstract

Section: Energy Shortest Path Problem and The Electric Travelingmentioning

confidence: 99%

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Erdelić

Carić

2019

Journal of Advanced Transportation

175

View full text Add to dashboard Cite

show abstract

“…Aggarwal et al [1] have illustrated the application of the isometric path cover problem in the design of VLSI layouts. The theory of isometric path problems is the backbone in the design of efficient algorithms in transport networks [20], computer networks [14,24], parallel architectures [25], social networks [3,12], VLSI layout design [1], wireless sensor networks [6], multimedia networks [5] and in other networks such as GIS networks [26], large network systems [2] and stochastic networks [23].…”

Section: Introductionmentioning

confidence: 99%

On the isometric path partition problem

Manuel¹

2021

Discuss. Math. Graph Theory

View full text Add to dashboard Cite

The isometric path cover (partition) problem of a graph is to find a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality a minimum isometric path cover (partition). We prove that the isometric path partition problem and the isometric k-path partition problem for k ≥ 3 are NP-complete on general graphs. Fisher and Fitzpatrick [7] have shown that the isometric path cover number of (r × r)-dimensional grid is 2r/3 . We show that the isometric path cover (partition) number of (r × s)-dimensional grid is s when r ≥ s(s − 1). We establish that the isometric path cover (partition) number of (r × r)-dimensional torus is r when r is even and is either r or r + 1 when r is odd. Then, we demonstrate that the isometric path cover (partition) number of an r-dimensional Benes network is 2 r . In addition, we provide partial solutions for the isometric path cover (partition) problems for cylinder and multi-dimensional grids.

show abstract

“…Many algorithms have been developed so far to solve the shortest path problem from a source vertex to a target vertex. A thoroughly revision of the state of the art, and a comparison of their relative strengths/weakness through an case-study application is shown in [20]. The following sections describe the problem of routing between two points, the classic algorithms that solve it, and also the modern techniques in roadmaps together with their corresponding preprocessing phases.…”

Section: Application Example: Shortest-path Algorithms Applied To Roamentioning

confidence: 99%

“…If the requesting slave is an old GPU (pre-Fermi) or a CPU core, the master only sends a single task to the slave (lines 12-15), thus, the task counter is simply incremented. When all tasks have been scheduled and carried out, the master sends the termination signal to the rest of active slaves when they request more tasks (lines [17][18][19][20][21].…”

Section: Scheduling Plug-insmentioning

confidence: 99%

Parallel approaches to shortest-path problems for multilevel heterogeneous computing

Arranz¹

View full text Add to dashboard Cite

Modelo paralelo abstracto, APSP, tuning automático de kernels, Boost Graph Library, configuración de la Cache L1, ejecución concurrente de kernels, CUDA, Dijkstra, GPGPU, sistemas heterogéneos, framework HPC, modelo de caracterización de kernels, proceso de caracterización de kernels, balanceo de carga, MPI, comparativa de plataformas de NVIDIA, OpenMP, técnicas de optimización, algoritmos paralelos, SSSP, geometría del bloque de hilos.

show abstract

The Shortest-Path Problem: Analysis and Comparison of Methods

Cited by 24 publications

References 42 publications

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

On the isometric path partition problem

Parallel approaches to shortest-path problems for multilevel heterogeneous computing

Contact Info

Product

Resources

About