Suchergebnisse - "Shortest-path algorithms"

Path Planning for Single Unmanned Aerial Vehicle by Separately Evolving Waypoints von Peng Yang, Ke Tang, Lozano, Jose A., Xianbin Cao

“… Evolutionary algorithm-based unmanned aerial vehicle (UAV) path planners have been extensively studied for their effectiveness and flexibility. However, they …”
Volltext

Design of Simulation Program for Analysis of Shortest Path Algorithms in Grid-Based Path Planning von Şanlialp, İbrahim, Yandı, İbrahim

“… This study examines the analysis of algorithms used to find the shortest path between cells with different terrain types and elevation levels on a map …”
Volltext

A comparison of solution strategies for biobjective shortest path problems von Raith, Andrea, Ehrgott, Matthias

“… We consider the biobjective shortest path (BSP) problem as the natural extension of the single-objective shortest path problem. BSP problems arise in various …”
Volltext

Graph-Based Generation and Validation of Use Case Diagrams von Nair, Reshma P, Thushara, M G, Somasundaram, K

“… As we know in today’s modern software engineering, use case diagrams for representing the functionalities of the system act significantly in mediating the gap …”
Volltext

Detection of core–periphery structure in networks using spectral methods and geodesic paths von CUCURINGU, MIHAI, ROMBACH, PUCK, LEE, SANG HOON, PORTER, MASON A.

“… We introduce several novel and computationally efficient methods for detecting “core–periphery structure” in networks. Core–periphery structure is a type of …”
Volltext

A branch and price approach for routing and refueling station location model von Yıldız, Barış, Arslan, Okan, Karaşan, Oya Ekin

“… •We study the refueling station location problem with routing considerations.•We propose a branch and price algorithm based on the notion of path-segments.•The …”
Volltext

Procedure Mix-The Path to Pay Equity von Kuo, Lindsay E, Kelz, Rachel R

Weitere Angaben

Energy-efficient routing protocols for solving energy hole problem in wireless sensor networks von Mohemed, Reem E., Saleh, Ahmed I., Abdelrazzak, Maher, Samra, Ahmed S.

“… Recently, researchers introduced energy-efficient dynamic routing protocols for wireless sensor networks to avoid the premature end of network lifetime. This …”
Volltext

A Performance Comparison of Shortest Path Algorithms in Directed Graphs von Fatima Sapundzhi, Kristiyan Danev, Antonina Ivanova, Metodi Popstoilov, Slavi Georgiev

“… This study examines the performance characteristics of four commonly used short-path algorithms, including Dijkstra, Bellman–Ford, Floyd–Warshall, and Dantzig, …”
Volltext

Time dependent vehicle routing problem with a multi ant colony system von Donati, Alberto V., Montemanni, Roberto, Casagrande, Norman, Rizzoli, Andrea E., Gambardella, Luca M.

“… The Time Dependent Vehicle Routing Problem (TDVRP) consists in optimally routing a fleet of vehicles of fixed capacity when travel times are time dependent, in …”
Volltext

Min–max and min–max regret versions of combinatorial optimization problems: A survey von Aissi, Hassene, Bazgan, Cristina, Vanderpooten, Daniel

“… Min–max and min–max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, …”
Volltext

The α-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm von Chen, Peng, Tong, Rui, Lu, Guangquan, Wang, Yunpeng

“… •A moment-matching-based hybrid genetic algorithm is proposed to search RSP.•Empirical travel time data from probe vehicles are utilized to measure TTR.•A …”
Volltext

Integer programming formulations for the elementary shortest path problem von Taccari, Leonardo

“… •We compare integer programming formulations for the elementary shortest path problem.•We describe IP formulations with exponentially-many SECs and MIP …”
Volltext

Missing value replacement in strings and applications von Bernardini, Giulia, Liu, Chang, Loukides, Grigorios, Marchetti-Spaccamela, Alberto, Pissis, Solon P., Stougie, Leen, Sweering, Michelle

“… Missing values arise routinely in real-world sequential (string) datasets due to: (1) imprecise data measurements; (2) flexible sequence modeling, such as …”
Volltext

Algorithms and complexity results for the single-cut routing problem in a rail yard von Enayaty Ahangar, Negin, Sullivan, Kelly M., Spanton, Shantih M., Wang, Yu

“… Rail yards are facilities that play a critical role in the freight rail transportation system. A number of essential rail yard functions require moving …”
Volltext

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach von Gendreau, Michel, Manerba, Daniele, Mansini, Renata

“… •We study the unitary demand case of the multi-vehicle TPP with incompatibilities among products.•We propose a new set-covering formulation and a …”
Volltext

Analysis of FPTASes for the multi-objective shortest path problem von Breugem, Thomas, Dollevoet, Twan, van den Heuvel, Wilco

“… We propose a new FPTAS for the multi-objective shortest path problem with non-negative and integer arc costs. The algorithm uses elements from both an exact …”
Volltext

A Hybrid Link-Node Approach for Finding Shortest Paths in Road Networks with Turn Restrictions von Li, Qingquan, Chen, Bi Yu, Wang, Yafei, Lam, William H. K.

“… Turn restrictions, such as ‘no left turn’ or ‘no U‐turn’, are commonly encountered in real road networks. These turn restrictions must be explicitly considered …”
Volltext

A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem von Sedeño-Noda, Antonio, Raith, Andrea

“… We address the problem of determining all extreme supported solutions of the biobjective shortest path problem. A novel Dijkstra-like method generalizing …”
Volltext

Finding shortest paths on real road networks: the case for A von Zeng, W., Church, R. L.

“… The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation …”
Volltext