Yudi Satria
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yudi Satria has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Helen Burhan
Department of Mathematics, Faculty of Mathematics and Natural Sciences (FMIPA), University of Indonesia, Depok 16424, Indonesia
6 shared publications - Suryadi Mt
Department of Mathematics, Universitas Indonesia, Depok 16424, Indonesia
4 shared publications - Hendri Murfi
Department of Mathematics, Universitas Indonesia, Depok 16424, Indonesia
2 shared publications - A Nurseptiani
Department of Mathematics, Faculty of Mathematics and Natural Sciences (FMIPA), University of Indonesia, Depok 16424, Indonesia
1 shared publication - Abdul Azis Abdillah1 shared publication
- Dian Maharani1 shared publication
Latest Publications
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1821 (1) , 012016
Application of agglomerative hierarchical clustering to optimize matching problems in ridesharing for maximize total distance savings
Ridesharing is transportation mode which brings together its participant whose similar itineraries and time schedule. The problem is how to compute matching requests with the large number of participants in short optimization time. For m driver n rider at the same time period, there is mxn driver-rider combination (possible match / pm) which will be considered whether time feasibility constraint is satisfied or not, if it satisfied then the pair is feasible match (fm). This paper purposed Agglomerative Hierarchical Clustering (AHC) to be applied for determining pm. By applying AHC, the pair which is not feasible based on their location is eliminated. AHC is clustering which merge two closest cluster, recursively, until all objects merge into one cluster. After we get fm set, we will check is there any pair whose distance saving less than zero? If it is, then it will be eliminated. To decide pairs that will do ridesharing trip (optimum match) we use Hungarian Algorithm. As the result, we obtain same number of optimum matched with and without applying AHC. At the process, by applying AHC, we can reduce the number of pm, so that total calculation of the driver-rider match that will be optimized is less.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1821 (1) , 012016
Open AccessApplication of agglomerative hierarchical clustering to optimize matching problems in ridesharing for maximize total distance savings
Ridesharing is transportation mode which brings together its participant whose similar itineraries and time schedule. The problem is how to compute matching requests with the large number of participants in short optimization time. For m driver n rider at the same time period, there is mxn driver-rider combination (possible match / pm) which will be considered whether time feasibility constraint is satisfied or not, if it satisfied then the pair is feasible match (fm). This paper purposed Agglomerative Hierarchical Clustering (AHC) to be applied for determining pm. By applying AHC, the pair which is not feasible based on their location is eliminated. AHC is clustering which merge two closest cluster, recursively, until all objects merge into one cluster. After we get fm set, we will check is there any pair whose distance saving less than zero? If it is, then it will be eliminated. To decide pairs that will do ridesharing trip (optimum match) we use Hungarian Algorithm. As the result, we obtain same number of optimum matched with and without applying AHC. At the process, by applying AHC, we can reduce the number of pm, so that total calculation of the driver-rider match that will be optimized is less.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1821 (1) , 012015
Application of Density-Based Spatial Clustering of Application With Noise to Optimize Matching Problems in Ridesharing for Maximize Total Distance Proximity Index
Ridesharing is one of models that attempt to reduce congestion problems due to increased use of private vehicles with low occupancy. The problem related to ridesharing is to get an optimal pair of drivers and riders, while the numbers of participants involved are very large and optimization must be done in a short amount of time. In this paper DBSCAN clustering will be used as the first step to optimize the matching problem in ridesharing with DP Index as the objective function. Driver and rider with similar distance will be a good match by using DP Index as the objective function if both origin and destination of driver and rider are in a close proximity. DBSCAN clustering is one of the methods of clustering based on the density of 2-dimensional objects. In the initial stage, the DBSCAN clustering method is used to cluster the origin and destination locations of the drivers and riders. After obtaining the clusters, the driver-rider pair will be matched based on the maximum DP Index by the Hungarian algorithm. This paper uses three times periods as the result of this experiment shows that DBSCAN clustering able to increase the total number of pairs of driver-rider matching.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1821 (1) , 012015
Open AccessApplication of Density-Based Spatial Clustering of Application With Noise to Optimize Matching Problems in Ridesharing for Maximize Total Distance Proximity Index
Ridesharing is one of models that attempt to reduce congestion problems due to increased use of private vehicles with low occupancy. The problem related to ridesharing is to get an optimal pair of drivers and riders, while the numbers of participants involved are very large and optimization must be done in a short amount of time. In this paper DBSCAN clustering will be used as the first step to optimize the matching problem in ridesharing with DP Index as the objective function. Driver and rider with similar distance will be a good match by using DP Index as the objective function if both origin and destination of driver and rider are in a close proximity. DBSCAN clustering is one of the methods of clustering based on the density of 2-dimensional objects. In the initial stage, the DBSCAN clustering method is used to cluster the origin and destination locations of the drivers and riders. After obtaining the clusters, the driver-rider pair will be matched based on the maximum DP Index by the Hungarian algorithm. This paper uses three times periods as the result of this experiment shows that DBSCAN clustering able to increase the total number of pairs of driver-rider matching.
- Open Access
- 1 March 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1490 (1) , 012046
The composition of the improved logistic map and the MS map in generating a new chaotic function
A new chaotic map is proposed from the composition of the improved logistic map and the MS map. The composition is done by mapping the MS map first, where the result is then mapped by the improved logistic map. The new map as the result of the composition is chaotic. This is shown by the Lyapunov Exponent analysis, bifurcation diagrams, and the NIST randomness test. The Lyapunov Exponent results with x0 = 0.1 are non-negative for r ∈ [1,4]. Its bifurcation diagrams with p ∈ (0,4) has a better density at r ∈ 2.5. The new chaotic function also passes 10 out of 16 NIST test, with initial value and parameter values x0 = 0.1, r = 2.5, and p = 2.5.
- 1 March 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1490 (1) , 012046
Open AccessThe composition of the improved logistic map and the MS map in generating a new chaotic function
A new chaotic map is proposed from the composition of the improved logistic map and the MS map. The composition is done by mapping the MS map first, where the result is then mapped by the improved logistic map. The new map as the result of the composition is chaotic. This is shown by the Lyapunov Exponent analysis, bifurcation diagrams, and the NIST randomness test. The Lyapunov Exponent results with x0 = 0.1 are non-negative for r ∈ [1,4]. Its bifurcation diagrams with p ∈ (0,4) has a better density at r ∈ 2.5. The new chaotic function also passes 10 out of 16 NIST test, with initial value and parameter values x0 = 0.1, r = 2.5, and p = 2.5.
- Open Access
- 1 December 2019
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 9 (6) , 734-742
Performance of Deep Neural Network for Tabular Data — A Case Study of Loss Cost Prediction in Fire Insurance
- 1 December 2019
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 9 (6) , 734-742
Open AccessPerformance of Deep Neural Network for Tabular Data — A Case Study of Loss Cost Prediction in Fire Insurance
- Open Access
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012007
Application of tabu search method in solving a taxi-sharing problem
Nowadays, a ride-sharing system is a trend among society for traveling. The ride-sharing system is a solution that can be developed to reduce the congestion because of the high amounts of the vehicle on the road. Taxi as an alternative transportation in an urban area can impose the ride-sharing system. Taxi-sharing aims to maximize the utilization of taxi capacity, thereby reduces the fare for passengers, increases the income for taxi operator, and reduces congestion, gas emission, as well as fuel consumption. In order to maximize the benefits of the taxi-sharing system usage, we need to optimize taxi routes and match requests that share taxi service. In this paper, we used a mixed integer programming problem as in Hosni et al (2014) to make a model of optimization of the taxi-sharing problem, then solved the problem by using a tabu search method. The experiments showed that the tabu search method could increase the income of taxi operator up to 10 - 14 %.
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012007
Open AccessApplication of tabu search method in solving a taxi-sharing problem
Nowadays, a ride-sharing system is a trend among society for traveling. The ride-sharing system is a solution that can be developed to reduce the congestion because of the high amounts of the vehicle on the road. Taxi as an alternative transportation in an urban area can impose the ride-sharing system. Taxi-sharing aims to maximize the utilization of taxi capacity, thereby reduces the fare for passengers, increases the income for taxi operator, and reduces congestion, gas emission, as well as fuel consumption. In order to maximize the benefits of the taxi-sharing system usage, we need to optimize taxi routes and match requests that share taxi service. In this paper, we used a mixed integer programming problem as in Hosni et al (2014) to make a model of optimization of the taxi-sharing problem, then solved the problem by using a tabu search method. The experiments showed that the tabu search method could increase the income of taxi operator up to 10 - 14 %.
- Open Access
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012010
Dynamic pickup and delivery problem with transfer in ridesharing to reduce congestion
Pickup and delivery problem with transfer (PDPT) consists of defining a set of optimum routes between a set of pickup points and delivery points of the request. During travel in the vehicle, the passenger may change vehicle in a fixed transfer point. Transfer passenger occurs when a passenger's delivery in a vehicle results in long travel route, while there are other vehicles which may take the passenger on a shorter travel route. Based on research conducted by Cortés et al (2010), this paper considers PDPT where customer location and service time are random variables that are realized dynamically during the plan execution. In this paper will use the insertion heuristic method to obtain the optimal solution of Dynamic PDPT. The objective solution is to minimize the operational cost of the transportation company by reducing the travel distance of each vehicle. This problem will be discussed with ridesharing approach to improve existing ridesharing services by using transfer point. Based on the result of simulation experiment obtained Dynamic PDPT can be used to optimize the existing ridesharing system that can fulfill more requests for 16.7% followed by increasing income.
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012010
Open AccessDynamic pickup and delivery problem with transfer in ridesharing to reduce congestion
Pickup and delivery problem with transfer (PDPT) consists of defining a set of optimum routes between a set of pickup points and delivery points of the request. During travel in the vehicle, the passenger may change vehicle in a fixed transfer point. Transfer passenger occurs when a passenger's delivery in a vehicle results in long travel route, while there are other vehicles which may take the passenger on a shorter travel route. Based on research conducted by Cortés et al (2010), this paper considers PDPT where customer location and service time are random variables that are realized dynamically during the plan execution. In this paper will use the insertion heuristic method to obtain the optimal solution of Dynamic PDPT. The objective solution is to minimize the operational cost of the transportation company by reducing the travel distance of each vehicle. This problem will be discussed with ridesharing approach to improve existing ridesharing services by using transfer point. Based on the result of simulation experiment obtained Dynamic PDPT can be used to optimize the existing ridesharing system that can fulfill more requests for 16.7% followed by increasing income.
- Open Access
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012008
Application of Large Neighborhood Search method in solving a dynamic dial-a-ride problem with money as an incentive
A Dynamic Dial-a-Ride Problem with Money as an Incentive (DARP-M) is a problem of finding optimal route to serve requests demand which uses taxi-sharing system with cost constraint. Taxi-sharing is a system where individual customer share vehicle with other customers, who has the same or similar origin, destination, and travel time. The optimal solution is the solution that can minimize the cost of each trip request. This study discusses DARP-M to optimize the use of taxi-sharing. The search for the DARP-M solution in this research uses the insertion heuristic method for construction of initial solution and the large neighborhood search method for the optimal solution determination. Then, the experiment uses three times periods, from which the experiment result shows the large neighborhood search method can minimize customers travel cost up to 27.40 % less than the cost of private rides.
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012008
Open AccessApplication of Large Neighborhood Search method in solving a dynamic dial-a-ride problem with money as an incentive
A Dynamic Dial-a-Ride Problem with Money as an Incentive (DARP-M) is a problem of finding optimal route to serve requests demand which uses taxi-sharing system with cost constraint. Taxi-sharing is a system where individual customer share vehicle with other customers, who has the same or similar origin, destination, and travel time. The optimal solution is the solution that can minimize the cost of each trip request. This study discusses DARP-M to optimize the use of taxi-sharing. The search for the DARP-M solution in this research uses the insertion heuristic method for construction of initial solution and the large neighborhood search method for the optimal solution determination. Then, the experiment uses three times periods, from which the experiment result shows the large neighborhood search method can minimize customers travel cost up to 27.40 % less than the cost of private rides.
- Open Access
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012009
Application of parallel tabu search in solving Ride-sharing problem with HOV Lanes
Ride-sharing can be defined as a system where travelers can share their vehicles and travel cost with others who have a similar destination and time schedule. Ride-sharing problem with High Occupancy Vehicle (HOV) Lanes is a problem of finding an optimal route to serve costumer demand where each demand and vehicle consists of origin and destination point, and some of the route are restricted-use freeways lanes reserved for vehicles with more than a predetermined number of occupants, which called HOV lanes. With the use of ride-sharing and HOV Lanes, it is expected to reduce the number of the vehicles thus will mitigate the congestion. The optimal solution is the one with minimum number of total distance, passenger’s ride time, and cost. This study discusses the application of insertion heuristic and parallel tabu search to optimize the use of Ride-sharing with HOV Lanes. Insertion heuristic is applied to obtain an initial solution and parallel tabu search algorithm is applied to improve the initial solution and obtain a better solution. For the case of eight vehicles and eight requests, from insertion heuristic we obtained an initial solution with an objective function value of 425 and with the used of parallel tabu search method we obtained a better solution with an objective function value of 420.
- 1 May 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1218 (1) , 012009
Open AccessApplication of parallel tabu search in solving Ride-sharing problem with HOV Lanes
Ride-sharing can be defined as a system where travelers can share their vehicles and travel cost with others who have a similar destination and time schedule. Ride-sharing problem with High Occupancy Vehicle (HOV) Lanes is a problem of finding an optimal route to serve costumer demand where each demand and vehicle consists of origin and destination point, and some of the route are restricted-use freeways lanes reserved for vehicles with more than a predetermined number of occupants, which called HOV lanes. With the use of ride-sharing and HOV Lanes, it is expected to reduce the number of the vehicles thus will mitigate the congestion. The optimal solution is the one with minimum number of total distance, passenger’s ride time, and cost. This study discusses the application of insertion heuristic and parallel tabu search to optimize the use of Ride-sharing with HOV Lanes. Insertion heuristic is applied to obtain an initial solution and parallel tabu search algorithm is applied to improve the initial solution and obtain a better solution. For the case of eight vehicles and eight requests, from insertion heuristic we obtained an initial solution with an objective function value of 425 and with the used of parallel tabu search method we obtained a better solution with an objective function value of 420.
- Open Access
- 21 March 2018
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 974 (1) , 012014
Securing Digital Audio using Complex Quadratic Map
In This digital era, exchanging data are common and easy to do, therefore it is vulnerable to be attacked and manipulated from unauthorized parties. One data type that is vulnerable to attack is digital audio. So, we need data securing method that is not vulnerable and fast. One of the methods that match all of those criteria is securing the data using chaos function. Chaos function that is used in this research is complex quadratic map (CQM). There are some parameter value that causing the key stream that is generated by CQM function to pass all 15 NIST test, this means that the key stream that is generated using this CQM is proven to be random. In addition, samples of encrypted digital sound when tested using goodness of fit test are proven to be uniform, so securing digital audio using this method is not vulnerable to frequency analysis attack. The key space is very huge about 8.1×l031 possible keys and the key sensitivity is very small about 10-10, therefore this method is also not vulnerable against brute-force attack. And finally, the processing speed for both encryption and decryption process on average about 450 times faster that its digital audio duration.
- 21 March 2018
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 974 (1) , 012014
Open AccessSecuring Digital Audio using Complex Quadratic Map
In This digital era, exchanging data are common and easy to do, therefore it is vulnerable to be attacked and manipulated from unauthorized parties. One data type that is vulnerable to attack is digital audio. So, we need data securing method that is not vulnerable and fast. One of the methods that match all of those criteria is securing the data using chaos function. Chaos function that is used in this research is complex quadratic map (CQM). There are some parameter value that causing the key stream that is generated by CQM function to pass all 15 NIST test, this means that the key stream that is generated using this CQM is proven to be random. In addition, samples of encrypted digital sound when tested using goodness of fit test are proven to be uniform, so securing digital audio using this method is not vulnerable to frequency analysis attack. The key space is very huge about 8.1×l031 possible keys and the key sensitivity is very small about 10-10, therefore this method is also not vulnerable against brute-force attack. And finally, the processing speed for both encryption and decryption process on average about 450 times faster that its digital audio duration.
- Open Access
- 21 March 2018
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 974 (1) , 012016
Digital Sound Encryption with Logistic Map and Number Theoretic Transform
Digital sound security has limits on encrypting in Frequency Domain. Number Theoretic Transform based on field (GF 2521 – 1) improve and solve that problem. The algorithm for this sound encryption is based on combination of Chaos function and Number Theoretic Transform. The Chaos function that used in this paper is Logistic Map. The trials and the simulations are conducted by using 5 different digital sound files data tester in Wave File Extension Format and simulated at least 100 times each. The key stream resulted is random with verified by 15 NIST's randomness test. The key space formed is very big which more than 10469. The processing speed of algorithm for encryption is slightly affected by Number Theoretic Transform.
- 21 March 2018
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 974 (1) , 012016
Open AccessDigital Sound Encryption with Logistic Map and Number Theoretic Transform
Digital sound security has limits on encrypting in Frequency Domain. Number Theoretic Transform based on field (GF 2521 – 1) improve and solve that problem. The algorithm for this sound encryption is based on combination of Chaos function and Number Theoretic Transform. The Chaos function that used in this paper is Logistic Map. The trials and the simulations are conducted by using 5 different digital sound files data tester in Wave File Extension Format and simulated at least 100 times each. The key stream resulted is random with verified by 15 NIST's randomness test. The key space formed is very big which more than 10469. The processing speed of algorithm for encryption is slightly affected by Number Theoretic Transform.