scholarly journals Finding shortest path in static networks

2012 ◽  
Vol 1 (1) ◽  
pp. 29-34 ◽  
Author(s):  
Seher Abbasi ◽  
Fahimeh Moosavi
Keyword(s):  
Combinatorial Optimization ◽  
Shortest Path ◽  
Large Scale ◽  
Optimization Problem ◽  
Rare Event ◽  
Combinatorial Optimization Problem ◽  
Time Saving ◽  
Large Scale Network ◽  
Scale Network ◽  
Modified Algorithm

This paper considers the problem of finding the shortest path in a static network, where the costs are constant. The CE Algorithm based strategy that is presented by Rubinstein to solving rare event and combinatorial optimization problem is modified to finding shortest path in this research. To analyze the efficiency of the used algorithm three sets of small, medium and large sized problems that generated randomly are solved. The results on the set of problems show that the modified algorithm produces good solutions and time saving in computation of large-scale network.

Study on the K-Shortest Paths Searching Algorithm of Urban Mass Transit Network Based on the Network Characteristics

2014 ◽  
Vol 505-506 ◽  
pp. 689-697 ◽  
Author(s):  
Wei Teng Zhou ◽  
Bao Ming Han ◽  
Hao Dong Yin
Keyword(s):  
Double Layer ◽  
Shortest Path ◽  
Large Scale ◽  
Shortest Paths ◽  
Mass Transit ◽  
New Method ◽  
Large Scale Network ◽  
Urban Rail ◽  
Scale Network ◽  
Transit Operation

K-shortest path is of great significance for urban rail mass transit operation and management especially in large-scale network. The paper has analyzed composite structure characteristics and proposed the route features of the network. According to the former analyses, the author put forward a new method to build a double-layer network model based on the train operation with the corresponding double-layer searching algorithm to solve the model in order to obtain the k-shortest paths. Finally, the rationality and effectiveness of the algorithm had been verified through the examples, which prove that it could provide a new method to get the optimal k-shortest path between different O-D pairs in large scale network, and the search efficiency could be increased more than 13%. As a path searching algorithm based on the train running timetable, it demonstrate decision support for the operation of urban rail mass transit.

scholarly journals Selective Simulated Annealing for Large Scale Airspace Congestion Mitigation

Aerospace ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 288
Author(s):  
Julien Lavandier ◽  
Arianit Islami ◽  
Daniel Delahaye ◽  
Supatcha Chaimatanan ◽  
Amir Abecassis
Keyword(s):  
Simulated Annealing ◽  
Combinatorial Optimization ◽  
Assignment Problem ◽  
Large Scale ◽  
Optimization Problem ◽  
Traffic Assignment ◽  
Combinatorial Optimization Problem ◽  
Slot Allocation ◽  
Traffic Assignment Problem ◽  
Aircraft Trajectories

This paper presents a methodology to minimize the airspace congestion of aircraft trajectories based on slot allocation techniques. The traffic assignment problem is modeled as a combinatorial optimization problem for which a selective simulated annealing has been developed. Based on the congestion encountered by each aircraft in the airspace, this metaheuristic selects and changes the time of departure of the most critical flights in order to target the most relevant aircraft. The main objective of this approach is to minimize the aircraft speed vector disorder. The proposed algorithm was implemented and tested on simulated trajectories generated with real flight plans on a day of traffic over French airspace with 8800 flights.

Performance of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation

2012 ◽  
Vol E95.B (5) ◽  
pp. 1592-1601
Author(s):  
Yusuke SAKUMOTO ◽  
Hiroyuki OHSAKI ◽  
Makoto IMASE
Keyword(s):  
Shortest Path ◽  
Large Scale ◽  
Network Simulation ◽  
Shortest Path Algorithm ◽  
Large Scale Network ◽  
Scale Network

Large-Scale Network Analysis for Online Social Brand Advertising

MIS Quarterly ◽  
2016 ◽  
Vol 40 (4) ◽  
pp. 849-868 ◽  
Author(s):  
Kunpeng Zhang ◽  
◽  
Siddhartha Bhattacharyya ◽  
Sudha Ram ◽  
◽  
...  
Keyword(s):  
Network Analysis ◽  
Large Scale ◽  
Large Scale Network ◽  
Brand Advertising ◽  
Scale Network

Inverse version of the kth maximization combinatorial optimization problem

2018 ◽  
Vol 54(5) ◽  
pp. 72
Author(s):  
Quoc, H.D. ◽  
Kien, N.T. ◽  
Thuy, T.T.C. ◽  
Hai, L.H. ◽  
Thanh, V.N.
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problem ◽  
Combinatorial Optimization Problem
Sign in / Sign up

Export Citation Format

Share Document