Matlab algorithms for traffic light assignment using fuzzy graph, fuzzy chromatic number, and fuzzy inference system

Rosyida, Isnaini; Nurhaida,; Narendra, Alfa; Widodo, Widodo

doi:10.1016/j.mex.2020.101136

Cited by 8 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this part, we compare the result in Table 4 with a traffic signal phasing obtained from the fuzzy graph coloring method based on δ-fuzzy independent vertices (δ ∈ [0, 1]) as given in [33]. The fuzzy graph model of traffic flows in the Pingit intersection is depicted in Figure 11.…”

Section: Comparison To the Fuzzy Graph Coloring Methodsmentioning

confidence: 99%

“…An essential idea that can be used in making decisions on various networks of realworld problems is the coloring method of fuzzy graphs and IFGs ( [3,4,25,33]). 2.…”

mentioning

confidence: 99%

“…An implementation of the coloring method of fuzzy graphs in road networks has been proposed in [33]. However, it did not consider three types of connections between traffic movements and three conditions of crowdedness of traffic flows at an intersection.…”

mentioning

confidence: 99%

See 2 more Smart Citations

An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application

Rosyida,

Indrati

2023

Algorithms

Self Cite

View full text Add to dashboard Cite

The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no”. Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to these properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is useful when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been carried to evaluate the method.

show abstract

Section: Comparison To the Fuzzy Graph Coloring Methodsmentioning

confidence: 99%

“…An essential idea that can be used in making decisions on various networks of realworld problems is the coloring method of fuzzy graphs and IFGs ( [3,4,25,33]). 2.…”

mentioning

confidence: 99%

See 1 more Smart Citation

An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application

Rosyida,

Indrati

2023

Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is also known as the greedy algorithm, which is an algorithm that solves problems by finding the maximum value. The Dijkstra's algorithm performs in searching the shortest path through the calculation from the original vertex to the nearest vertex, then to the second vertex, and so on [2]. A fast and reliable Dijkstra Algorithm for online shortest path was investigated by [3] where the shortest path was applied to send emergency vehicles such as ambulances, fire fighting vehicles and others.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, this study examines: (1) How to search the shortest path of Ojek Online using Dijkstra's Algorithm, (2) How to find the terrain difficulty in the area traversed along the shortest path, (3) How are the fares based on the Mamdani fuzzy inference system (FIS) with the input the distance and difficulty level of the terrain on the geographical map in the Semarang City area.…”

Section: Introductionmentioning

confidence: 99%

Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

Sebayang¹,

Rosyida²

2022

Advances in Computer Science Research

Self Cite

View full text Add to dashboard Cite

Ojek Online is a motorcycle taxi that is usually used by people that need a short time for traveling. It is one of the easiest forms of transportation, but there are some obstacles in hilly areas such as Semarang City. The fare produced by online motorcycle taxis is sometimes not in accordance with the distance and difficulty of the terrain. The problems in this research are as follows: (1) How to find the shortest route of Ojek Online using the Dijkstra Algorithm, (2) How are the difficulties of the terrain along the shortest routes, (3) How to determine the fare using a fuzzy inference system (FIS) where the inputs are distance and the level of difficulty of the terrain on the geographical map in Semarang City area. The Dijkstra's Algorithm is used to assist in finding the shortest path and the Mamdani FIS is applied for fixing the fares. The results show that the Dijkstra Algorithm can find the shortest routes of ojek online from UNNES (initial node) to some destinantions in Semarang City. The result using fuzzy logic toolbox in matlab with the input of distance 5.5 km and terrain difficulty 300 m produced an output fare of 13,500 IDR. Further, the input of distance 5.5 km and the terrain difficulty of 100 m poduced an output fare of 13,100 IDR. Some routes with the same distance and different terrain heights have different fares.

show abstract

A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection

Rosyida

Indrati

Kalayathankal

2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Matlab algorithms for traffic light assignment using fuzzy graph, fuzzy chromatic number, and fuzzy inference system

Cited by 8 publications

References 13 publications

An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application

An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application

Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection

Contact Info

Product

Resources

About