Determination of the Grid-Shaped Transportation Network's Optimization Value via Graph Labelling

In order to move people, commodities, and services in an efficient and effective manner, transportation networks are essential. To increase these networks' efficiency and save expenses, they must be optimised. In this research, we offer a unique method that makes use of graph labelling techniques to determine the optimization value of a transportation network. The goal is to give the network's constituent parts labels that accurately represent their potential for optimisations. We start by creating a graph model of the transportation network, with vertices standing in for important places and edges for the links between them. The process of labelling a graph entail giving vertices and edges labels according to their attributes. When choosing the labels, we consider several variables, including capacity, distance, traffic flow, and transportation costs. These elements allow us to record the optimization value of various network components throughout the labelling process. After the graph labelling process is finished, we examine the labelled network to find regions that could want more effort and optimization. The labels aid in decision-making and offer insightful information about how well the network is doing. Based on the optimization values obtained from the graph labelling, we may set priorities for investments and distribute resources accordingly. We apply our method to a real-world transport network case study to verify its efficacy. The outcomes show that the optimization value of network components may be efficiently determined by the graph labelling technique. Targeted interventions, such as infrastructure upgrades, traffic control plans, or route optimizations, might be used to address the areas that have been identified for optimization. In conclusion, network planners and decision-makers can benefit greatly from our method of calculating a transportation network's optimization value using graph labelling. Making well-informed decisions to improve the effectiveness and efficiency of transportation networks can result in increased system performance and cost savings by utilizing the insights obtained from the labelled network.

Authors

Institutions

Publication Details

Journal
Journal of Advanced Research in Applied Sciences and Engineering Technology
Published
2024-10-07
DOI
https://doi.org/10.37934/araset.57.2.96105
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Determination of the Grid-Shaped Transportation Network's Optimization Value via Graph Labelling

Muhammad Kamran Siddiqui, Amil Ahmad Ilham, Nurtiti Sunusi, I Gede Nyoman Mindra Jaya et al.
Journal of Advanced Research in Applied Sciences and Engineering Technology
Graph Theory and Algorithms
article

Determination of the Grid-Shaped Transportation Network's Optimization Value via Graph Labelling

Muhammad Kamran Siddiqui, Amil Ahmad Ilham, Nurtiti Sunusi, I Gede Nyoman Mindra Jaya, Amir Kamal Amir, Jusmawati Massalesse, Nurdin Hinding, Ali Ahmad, Nur Annisa Syahron, Cahyudi Gratio
article en

Abstract

In order to move people, commodities, and services in an efficient and effective manner, transportation networks are essential. To increase these networks' efficiency and save expenses, they must be optimised. In this research, we offer a unique method that makes use of graph labelling techniques to determine the optimization value of a transportation network. The goal is to give the network's constituent parts labels that accurately represent their potential for optimisations. We start by creating a graph model of the transportation network, with vertices standing in for important places and edges for the links between them. The process of labelling a graph entail giving vertices and edges labels according to their attributes. When choosing the labels, we consider several variables, including capacity, distance, traffic flow, and transportation costs. These elements allow us to record the optimization value of various network components throughout the labelling process. After the graph labelling process is finished, we examine the labelled network to find regions that could want more effort and optimization. The labels aid in decision-making and offer insightful information about how well the network is doing. Based on the optimization values obtained from the graph labelling, we may set priorities for investments and distribute resources accordingly. We apply our method to a real-world transport network case study to verify its efficacy. The outcomes show that the optimization value of network components may be efficiently determined by the graph labelling technique. Targeted interventions, such as infrastructure upgrades, traffic control plans, or route optimizations, might be used to address the areas that have been identified for optimization. In conclusion, network planners and decision-makers can benefit greatly from our method of calculating a transportation network's optimization value using graph labelling. Making well-informed decisions to improve the effectiveness and efficiency of transportation networks can result in increased system performance and cost savings by utilizing the insights obtained from the labelled network.

Journal of Advanced Research in Applied Sciences and Engineering TechnologyVol. 57(2)
COMSATS University Islamabad (PK), Jazan University (SA), Hasanuddin University (ID)
Universitas Hasanuddin
Openalex Percentile: Top 71%
Graph Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.