Darmawan Satyananda - Academia.edu (original) (raw)

Papers by Darmawan Satyananda

2022 5th International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)

PROCEEDINGS OF THE II INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCES IN SCIENCE, ENGINEERING AND DIGITAL EDUCATION: (ASEDU-II 2021)

PROCEEDINGS OF THE II INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCES IN SCIENCE, ENGINEERING AND DIGITAL EDUCATION: (ASEDU-II 2021)

International Journal of Interactive Mobile Technologies (iJIM), 2020

An Integration of “Online Interactive Apps” for learning can be a disruptive learning innovation ... more An Integration of “Online Interactive Apps” for learning can be a disruptive learning innovation in higher education. The material of the application of graph theory course has application topics in the real world. How students use the application can be used as a measure of creative problem solving. Mixed method was used in the study. The first phase of the study used one group non-randomized design pre-test and post-test. Participants were students who took courses in the application of graph theory. The second phase of the study involved an exploration of creative problem solving performance through qualitative interviews. Analysis of problem solving skills with creative problem solving instruments adapted from the CPS version 6. The average performance of students is very good in exploring data and building acceptance, performance is good in generating ideas and designing processes. Finding from this research is a significant improvement of students' Creative Problem-Solving...

Proceedings of the 1st Annual International Conference on Mathematics, Science, and Education (ICoMSE 2017), 2018

Vehicle Routing Problem (VRP) is an issue for designing the route for distributing goods from one... more Vehicle Routing Problem (VRP) is an issue for designing the route for distributing goods from one depot to a number of customers, in such way to minimize cost, every customer visited just once, all routes begin and ends at the depot, as well as the total demand of all customers on the route should not violate capacity of vehicles. There are several variants of VRP; two of them are Capacitated Vehicle Routing Problem (CVRP) and Multiple Trip Vehicle Routing Problem (MTVRP). Routes in such variants built by a certain algorithm, such as Sequential Insertion, Clarke-Wright algorithm, or built randomly as well. These must be refined because they are not provided the best result. This article discusses about refining solution of CVRP and MTVRP. The improvement involves local search method. This method initializes neighborhood list containing six inter-route moves: Shift (1,0), Swap (1,1), Shift (2,0), Swap (2,1), Swap(2,2) and Cross operation. At the main iteration, one of the neighborhoods is randomly selected, and the best move is selected as a new solution. If the new solution is better than the initial solution, four intra-route structures are operated, that is Or-opt, 2-opt, Exchange, and Reinsertion. The algorithm is implemented in a web-based application. Google Map is used to give real data about customer position and the route built, as well as its visualization in the map. From the test, the algorithm can improve the initial result built by Sequential Insertion and Clarke-Wright algorithm, in the form of shorter route and number of vehicles used.

Journal of Physics: Conference Series, 2022

Distribution optimization has an important role to distribute products to consumers. The selectio... more Distribution optimization has an important role to distribute products to consumers. The selection of the right route will have an impact on the distribution process resulting in minimal costs. The application of graph theory that can be used to determine the optimum route in the distribution process is the study of the Vehicle Routing Problem (VRP) variant. The VRP variants discussed in this article are MDVRP and VRPTW. The method used to solve the VRP variant of this article is the ACS-RVND algorithm. The ACS-RVND algorithm consists of several main stages, namely the initial solution formation stage using the ACS algorithm, the solution improvement stage using the RVND procedure and the acceptance criteria stage. The data needed for the application of the ACS-RVND algorithm in solving the distribution optimization problem of MDVRP cases are the number of depots, the number of customers, the capacity of the vehicle, the number of ants, the number of iterations, the number of custom...

Journal of Physics: Conference Series, 2021

The application of graph theory can be used to solve distribution optimization problems, especial... more The application of graph theory can be used to solve distribution optimization problems, especially the Vehicle Routing Problems (VRP). One variant of VRP is the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP), which has particular constraints, namely requests, and returns, which are done simultaneously. The VRPSDP problems can be solved by a variety of algorithms, such as the tabu search algorithm and the Variable Neighborhood Descent (VND) algorithm. The basic principle of the VND algorithm is to determine the initial solution and repair the solution using the neighborhood operator. In this article, the initial solution is determined by the insertion heuristic algorithm and makes improvements using six neighborhood operators. The optimum condition of the VND algorithm is reached if there is the most optimal solution for all operators, and the solution has converged to a minimum value. The application of the VND algorithm on VRPSDP was made using Borland Delp...

Journal of Physics: Conference Series, 2021

Multi Depot Vehicle Routing Problem (MDVRP) is one of Vehicle Routing Problem (VRP) variants. MDV... more Multi Depot Vehicle Routing Problem (MDVRP) is one of Vehicle Routing Problem (VRP) variants. MDVRP is a VRP that uses more than one depot for the distribution process. In this paper, the MDVRP will be solved using the Grey Wolf Optimizer (GWO). This algorithm is inspired by hunting technique and hierarchy of grey wolves. The completion of MDVRP consists of two stages, they are grouping and routing. In the grouping stage, customers are grouped to nearest depot. In the routing stage, the route is determined at each depot using “route-first, cluster-second”. In the route-first phase a giant tour is formed by forming population array. In the cluster-second phase, a split will be conducted on the giant tour, so that a number of routes are formed with the total demand for each route does not exceed the vehicle capacity. The implementation of GWO algorithm for MDVRP was designed in Borland Delphi 7.0 programming language. The algorithm was tested using 2 depots and 9 customers formed 2 ro...

Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Ro... more Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Routing Problem (VRP). VRPSDP has special constraints, namely requests and returns are carried out simultaneously. In this article we will use the Variable Neighborhood Descent (VND) algorithm to solve VRPSDP problems. There are two steps taken to use the VND algorithm on VRPSDP, namely finding an initial solution with the Insertion Heuristic algorithm and improving the position of the customer by using the neighborhood operator on the VND algorithm. The implementation of the VND algorithm on VRPSDP has been successfully made using the Borland Delphi 7.0 programming language. Inputs contained in the program are point position, distance between points, customer requests and returns and vehicle capacity. The output contained in the program in the form of routes that have been completed using an algorithm and output in the form of images of the final solution that has been obtained. Based on ...

2021 8th International Conference on Information Technology, Computer and Electrical Engineering (ICITACEE), 2021

Recently, people used social media to convey their emotions in the text. Text classification is r... more Recently, people used social media to convey their emotions in the text. Text classification is required for group a text containing emotion or not and identify the type of emotion. Most of the research in emotion classification use machine learning methods. So this research offers the use of deep learning for the classification of emotions in text. One of the algorithms that is widely used for deep learning is BERT (Bidirectional Encoder Representations from Transformers). For the experiment, classification is divided into two phases, namely the first phase groups emotion or not emotion tweets, and the second phase groups emotion tweets into five types of emotions, namely happy, angry, sad, scared and surprised. The experiment uses three data scenarios, namely the commuter line, transjakarta and combination data. The BERT method was compared with the BiLSTM and LSTM methods for emotion classification. The result of this study is BERT generates the highest accuracy compared to other methods for the three data scenarios with values of 87.24%, 86.27%, and 86.99% in the first phase. Then, the next accuracy value followed by obtained BiLSTM, and the last is LSTM. In the second phase, BERT also obtained the highest accuracy values for the three data scenarios with values of 94.26%, 93.71 %, and 93.98%. Then, the evaluation using Precision, Recall and F1-Measure results that BERT provides the best overall method. In this study, BERT has good performance for emotion classification.

Facing the education challenges in the 21st century, Indonesia needs resources that have systemat... more Facing the education challenges in the 21st century, Indonesia needs resources that have systematic, logical, creative and cooperative problem-solving skills. A learning alternative in constructivist view that can be applied to improve students' activity and creativity is to apply blended learning innovation in the Graph Theory Application course that combines some types of learning: face-to-face, offline, on line and direct experience in the field. Online learning is done by using ICT module that utilizes Google map. Indirect experience learning in the field, students work together in a group to gain problem-solving experience in the industry. To know the creative thinking process of students in identifying and solving the problems, the researchers used Creative Problem Solving (CPS) model. The searching of the thinking process employing CPS model showed that in step of (1) objective finding, the students were creative in identifying and finding objectives. In stage of (2) fact...

Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) whi... more Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) which involves several salesmen in making a trip to visit several customers. In this article, the Two-Phase Heuristic Algorithm (TPHA) is used to solve MTSP problems. The algorithm classifies customers into several regions using the K-Means algorithm, which will then find a route solution for each region using a genetic algorithm. The MTSP problems that were resolved using TPHA were implemented into the Borland Delphi 7.0 programming language. Application testing was conducted using 21, 32, and 46 point cases.

International Journal of Interactive Mobile Technologies (iJIM), 2021

The COVID-19 pandemic led to the implementation of the Work From Home (WFH) policy. The impact of... more The COVID-19 pandemic led to the implementation of the Work From Home (WFH) policy. The impact of this policy is to replace the process of teaching and learning activities by using an online learning system. In this industrial era 4.0, the integration of web applications is very much needed in problem-solving learning. One that can be used to integrate web applications in learning through project-based learning. The focus of this research is to study the effects of online project-based learning applications on mathematics students' visual thinking continuum. Instruments used in the form of rubric virtual mind maps, audio-visual and virtual posters are used to observe students' visual thinking continuum. The instrument was analyzed with the Rasch measurement model software named WINSTEPS. This study used one group pretest-posttest design to see the effect of integrating web applications in learning through project-based learning analyzed using SPSS. The results of instrument ...

Journal of Physics: Conference Series, 2020

Integrating learning through digital multimedia can be a disruptive learning innovation in high e... more Integrating learning through digital multimedia can be a disruptive learning innovation in high education. One subject in Mathematics that can has integration with the digital multimedia is graph theory. The reason is that some graph theory topics has application in the real world, hence students implementing these topics to solve problems can be analysed using creative problem solving (CPS) performance. Topics in Graph theory to be analysed by CPS are minimum spanning tree, traveling salesman problems and shortest path. Main objective of this study was to investigate the effect of the integration of digital multimedia to improve creative problem solving performance of mathematics students. Sequential mixed method was used in the study. Students are divided into 2 groups: experimental group that has integration of digital multimedia in the teaching-learning, and control group that has conventional learning. Phase of this study are 1) involving quasi-experimentation to determine the ...

28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES, 2020

Graph theory can be applied to a number of cases such as shortest path, travelling salesman probl... more Graph theory can be applied to a number of cases such as shortest path, travelling salesman problem, and minimum spanning tree. In Graph Theory course, visualization used as media to make problem solving easier. Visual thinking is an integral part of problem solving, as in using diagram or picture to explain, documenting, count, or demonstrate steps involved in finding a solution. This article comprises a visual thinking profile of mathematics students in solving graph theory cases. We use a descriptive-explorative method using a qualitative approach. The subject of this research is students of Mathematics Department students (I dan J offerings) that took the Graph Theory course in even semester, the year 2018-2019. Data were taken from the task-based interview, using a semi-structured format. The instruments of the research are taken from Polya’s Problem Solving Techniques. Result of research are 1) Visual thinking profile in understanding (when visual input came into mind as well instructions of problem solving, then mental imagination is processed and represented as image/graph model); 2) Visual thinking profile in planning (when visual input of image/graph model came into mind, as well as of previous experience, then mental imagination developed ideas to determine steps/algorithms to solve the problem); 3) Visual thinking profile in implementing (when visual input of understanding and planning came into mind, then mental imagination is processed and used to solve graph theory cases); and 4) Visual thinking profile in crosschecking (when pictures or graph model came into mind, then the visual imagination is used as a basis of recalculation in order to find the final conclusion of the solution). In the graph theory course, implementation of visual thinking for students in the problem-solving process used Powtoon-based multimedia application.

28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES, 2020

Journal of Physics: Conference Series, 2019

Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to t... more Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to the customer, to get the minimum cost delivery route. To get optimal results, it is necessary to improve route from the initial solution. Variable Neighbourhood Descent (VND) is one of the metaheuristics that examine of a number of neighbourhood operators to get the optimal route. A VRP route is called optimal if there are no other routes that can be generated from all the neighbourhood operators used in VND. This article describes the application of VND to get the optimal route on CVRP, MDVRP, and VRPTW. The results of the experiment on some test data used indicate that VND can be used to get more optimal length and travel time route.

TELKOMNIKA (Telecommunication Computing Electronics and Control), 2019

Many optimization problems require heuristic methods to solve the problem. Variable Neighborhood ... more Many optimization problems require heuristic methods to solve the problem. Variable Neighborhood Search (VNS) is a metaheuristic form that systematically changes its "neighborhood" in search of solutions. One method in VNS is Variable Neighborhood Descent (VND), which performs a deterministic neighborhood change. The change of the neighborhood in VND can be done in a random and sequential order. This paper compares sequential and random neighborhood selection methods in solving Capacitated Vehicle Routing Problem (CVRP) problems. There are 6 intra-route neighborhood structures and 4 inter-route structures used. CVRP problems are taken from several dataset providers. The initial solution is formed by Sequential Insertion method. The experimental results show that the random selection of neighborhood operators can provide a more optimal route length (in 10 of 13 datasets used) than that of sequential selection (only better in 3 dataset). However, the random selection takes more iterations to reach convergent state than the sequential one. For sequential selection, determination of the neighborhood structure's order affects the speed to the convergent state. Hence, a random selection in VND method is more preferable than sequential selection.

Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimizati... more Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization. Objective of VRP is to find minimum length route starts and ends in a depot. There are some additional constraints such as more than one depot, service time, time window, capacity of vehicle, and many more. These are cause of VRP variants. Vehicle Routing Problem with Time Windows (VRPTW) is a variant of VRP with some additional constrains, that are number of requests may not exceed the vehicle capacity, as well as travel time and service time may not exceed the time window. Multi Depot Vehicle Routing Problem (MDVRP) has number of depots serving all customers, a number of vehicles distributing goods to customers with a minimum distance of distribution route without exceeding the capacity of the vehicle. Many researches have presented algorithms to solve VRPTW and MDVRP. This article discusses solution characteristics of VRPTW and MDVRP algorithms, and their performance. VRPTW algori...

2022 5th International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)

PROCEEDINGS OF THE II INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCES IN SCIENCE, ENGINEERING AND DIGITAL EDUCATION: (ASEDU-II 2021)

PROCEEDINGS OF THE II INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCES IN SCIENCE, ENGINEERING AND DIGITAL EDUCATION: (ASEDU-II 2021)

International Journal of Interactive Mobile Technologies (iJIM), 2020

An Integration of “Online Interactive Apps” for learning can be a disruptive learning innovation ... more An Integration of “Online Interactive Apps” for learning can be a disruptive learning innovation in higher education. The material of the application of graph theory course has application topics in the real world. How students use the application can be used as a measure of creative problem solving. Mixed method was used in the study. The first phase of the study used one group non-randomized design pre-test and post-test. Participants were students who took courses in the application of graph theory. The second phase of the study involved an exploration of creative problem solving performance through qualitative interviews. Analysis of problem solving skills with creative problem solving instruments adapted from the CPS version 6. The average performance of students is very good in exploring data and building acceptance, performance is good in generating ideas and designing processes. Finding from this research is a significant improvement of students' Creative Problem-Solving...

Proceedings of the 1st Annual International Conference on Mathematics, Science, and Education (ICoMSE 2017), 2018

Vehicle Routing Problem (VRP) is an issue for designing the route for distributing goods from one... more Vehicle Routing Problem (VRP) is an issue for designing the route for distributing goods from one depot to a number of customers, in such way to minimize cost, every customer visited just once, all routes begin and ends at the depot, as well as the total demand of all customers on the route should not violate capacity of vehicles. There are several variants of VRP; two of them are Capacitated Vehicle Routing Problem (CVRP) and Multiple Trip Vehicle Routing Problem (MTVRP). Routes in such variants built by a certain algorithm, such as Sequential Insertion, Clarke-Wright algorithm, or built randomly as well. These must be refined because they are not provided the best result. This article discusses about refining solution of CVRP and MTVRP. The improvement involves local search method. This method initializes neighborhood list containing six inter-route moves: Shift (1,0), Swap (1,1), Shift (2,0), Swap (2,1), Swap(2,2) and Cross operation. At the main iteration, one of the neighborhoods is randomly selected, and the best move is selected as a new solution. If the new solution is better than the initial solution, four intra-route structures are operated, that is Or-opt, 2-opt, Exchange, and Reinsertion. The algorithm is implemented in a web-based application. Google Map is used to give real data about customer position and the route built, as well as its visualization in the map. From the test, the algorithm can improve the initial result built by Sequential Insertion and Clarke-Wright algorithm, in the form of shorter route and number of vehicles used.

Journal of Physics: Conference Series, 2022

Distribution optimization has an important role to distribute products to consumers. The selectio... more Distribution optimization has an important role to distribute products to consumers. The selection of the right route will have an impact on the distribution process resulting in minimal costs. The application of graph theory that can be used to determine the optimum route in the distribution process is the study of the Vehicle Routing Problem (VRP) variant. The VRP variants discussed in this article are MDVRP and VRPTW. The method used to solve the VRP variant of this article is the ACS-RVND algorithm. The ACS-RVND algorithm consists of several main stages, namely the initial solution formation stage using the ACS algorithm, the solution improvement stage using the RVND procedure and the acceptance criteria stage. The data needed for the application of the ACS-RVND algorithm in solving the distribution optimization problem of MDVRP cases are the number of depots, the number of customers, the capacity of the vehicle, the number of ants, the number of iterations, the number of custom...

Journal of Physics: Conference Series, 2021

The application of graph theory can be used to solve distribution optimization problems, especial... more The application of graph theory can be used to solve distribution optimization problems, especially the Vehicle Routing Problems (VRP). One variant of VRP is the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP), which has particular constraints, namely requests, and returns, which are done simultaneously. The VRPSDP problems can be solved by a variety of algorithms, such as the tabu search algorithm and the Variable Neighborhood Descent (VND) algorithm. The basic principle of the VND algorithm is to determine the initial solution and repair the solution using the neighborhood operator. In this article, the initial solution is determined by the insertion heuristic algorithm and makes improvements using six neighborhood operators. The optimum condition of the VND algorithm is reached if there is the most optimal solution for all operators, and the solution has converged to a minimum value. The application of the VND algorithm on VRPSDP was made using Borland Delp...

Journal of Physics: Conference Series, 2021

Multi Depot Vehicle Routing Problem (MDVRP) is one of Vehicle Routing Problem (VRP) variants. MDV... more Multi Depot Vehicle Routing Problem (MDVRP) is one of Vehicle Routing Problem (VRP) variants. MDVRP is a VRP that uses more than one depot for the distribution process. In this paper, the MDVRP will be solved using the Grey Wolf Optimizer (GWO). This algorithm is inspired by hunting technique and hierarchy of grey wolves. The completion of MDVRP consists of two stages, they are grouping and routing. In the grouping stage, customers are grouped to nearest depot. In the routing stage, the route is determined at each depot using “route-first, cluster-second”. In the route-first phase a giant tour is formed by forming population array. In the cluster-second phase, a split will be conducted on the giant tour, so that a number of routes are formed with the total demand for each route does not exceed the vehicle capacity. The implementation of GWO algorithm for MDVRP was designed in Borland Delphi 7.0 programming language. The algorithm was tested using 2 depots and 9 customers formed 2 ro...

Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Ro... more Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Routing Problem (VRP). VRPSDP has special constraints, namely requests and returns are carried out simultaneously. In this article we will use the Variable Neighborhood Descent (VND) algorithm to solve VRPSDP problems. There are two steps taken to use the VND algorithm on VRPSDP, namely finding an initial solution with the Insertion Heuristic algorithm and improving the position of the customer by using the neighborhood operator on the VND algorithm. The implementation of the VND algorithm on VRPSDP has been successfully made using the Borland Delphi 7.0 programming language. Inputs contained in the program are point position, distance between points, customer requests and returns and vehicle capacity. The output contained in the program in the form of routes that have been completed using an algorithm and output in the form of images of the final solution that has been obtained. Based on ...

2021 8th International Conference on Information Technology, Computer and Electrical Engineering (ICITACEE), 2021

Recently, people used social media to convey their emotions in the text. Text classification is r... more Recently, people used social media to convey their emotions in the text. Text classification is required for group a text containing emotion or not and identify the type of emotion. Most of the research in emotion classification use machine learning methods. So this research offers the use of deep learning for the classification of emotions in text. One of the algorithms that is widely used for deep learning is BERT (Bidirectional Encoder Representations from Transformers). For the experiment, classification is divided into two phases, namely the first phase groups emotion or not emotion tweets, and the second phase groups emotion tweets into five types of emotions, namely happy, angry, sad, scared and surprised. The experiment uses three data scenarios, namely the commuter line, transjakarta and combination data. The BERT method was compared with the BiLSTM and LSTM methods for emotion classification. The result of this study is BERT generates the highest accuracy compared to other methods for the three data scenarios with values of 87.24%, 86.27%, and 86.99% in the first phase. Then, the next accuracy value followed by obtained BiLSTM, and the last is LSTM. In the second phase, BERT also obtained the highest accuracy values for the three data scenarios with values of 94.26%, 93.71 %, and 93.98%. Then, the evaluation using Precision, Recall and F1-Measure results that BERT provides the best overall method. In this study, BERT has good performance for emotion classification.

Facing the education challenges in the 21st century, Indonesia needs resources that have systemat... more Facing the education challenges in the 21st century, Indonesia needs resources that have systematic, logical, creative and cooperative problem-solving skills. A learning alternative in constructivist view that can be applied to improve students' activity and creativity is to apply blended learning innovation in the Graph Theory Application course that combines some types of learning: face-to-face, offline, on line and direct experience in the field. Online learning is done by using ICT module that utilizes Google map. Indirect experience learning in the field, students work together in a group to gain problem-solving experience in the industry. To know the creative thinking process of students in identifying and solving the problems, the researchers used Creative Problem Solving (CPS) model. The searching of the thinking process employing CPS model showed that in step of (1) objective finding, the students were creative in identifying and finding objectives. In stage of (2) fact...

Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) whi... more Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) which involves several salesmen in making a trip to visit several customers. In this article, the Two-Phase Heuristic Algorithm (TPHA) is used to solve MTSP problems. The algorithm classifies customers into several regions using the K-Means algorithm, which will then find a route solution for each region using a genetic algorithm. The MTSP problems that were resolved using TPHA were implemented into the Borland Delphi 7.0 programming language. Application testing was conducted using 21, 32, and 46 point cases.

International Journal of Interactive Mobile Technologies (iJIM), 2021

The COVID-19 pandemic led to the implementation of the Work From Home (WFH) policy. The impact of... more The COVID-19 pandemic led to the implementation of the Work From Home (WFH) policy. The impact of this policy is to replace the process of teaching and learning activities by using an online learning system. In this industrial era 4.0, the integration of web applications is very much needed in problem-solving learning. One that can be used to integrate web applications in learning through project-based learning. The focus of this research is to study the effects of online project-based learning applications on mathematics students' visual thinking continuum. Instruments used in the form of rubric virtual mind maps, audio-visual and virtual posters are used to observe students' visual thinking continuum. The instrument was analyzed with the Rasch measurement model software named WINSTEPS. This study used one group pretest-posttest design to see the effect of integrating web applications in learning through project-based learning analyzed using SPSS. The results of instrument ...

Journal of Physics: Conference Series, 2020

Integrating learning through digital multimedia can be a disruptive learning innovation in high e... more Integrating learning through digital multimedia can be a disruptive learning innovation in high education. One subject in Mathematics that can has integration with the digital multimedia is graph theory. The reason is that some graph theory topics has application in the real world, hence students implementing these topics to solve problems can be analysed using creative problem solving (CPS) performance. Topics in Graph theory to be analysed by CPS are minimum spanning tree, traveling salesman problems and shortest path. Main objective of this study was to investigate the effect of the integration of digital multimedia to improve creative problem solving performance of mathematics students. Sequential mixed method was used in the study. Students are divided into 2 groups: experimental group that has integration of digital multimedia in the teaching-learning, and control group that has conventional learning. Phase of this study are 1) involving quasi-experimentation to determine the ...

28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES, 2020

Graph theory can be applied to a number of cases such as shortest path, travelling salesman probl... more Graph theory can be applied to a number of cases such as shortest path, travelling salesman problem, and minimum spanning tree. In Graph Theory course, visualization used as media to make problem solving easier. Visual thinking is an integral part of problem solving, as in using diagram or picture to explain, documenting, count, or demonstrate steps involved in finding a solution. This article comprises a visual thinking profile of mathematics students in solving graph theory cases. We use a descriptive-explorative method using a qualitative approach. The subject of this research is students of Mathematics Department students (I dan J offerings) that took the Graph Theory course in even semester, the year 2018-2019. Data were taken from the task-based interview, using a semi-structured format. The instruments of the research are taken from Polya’s Problem Solving Techniques. Result of research are 1) Visual thinking profile in understanding (when visual input came into mind as well instructions of problem solving, then mental imagination is processed and represented as image/graph model); 2) Visual thinking profile in planning (when visual input of image/graph model came into mind, as well as of previous experience, then mental imagination developed ideas to determine steps/algorithms to solve the problem); 3) Visual thinking profile in implementing (when visual input of understanding and planning came into mind, then mental imagination is processed and used to solve graph theory cases); and 4) Visual thinking profile in crosschecking (when pictures or graph model came into mind, then the visual imagination is used as a basis of recalculation in order to find the final conclusion of the solution). In the graph theory course, implementation of visual thinking for students in the problem-solving process used Powtoon-based multimedia application.

28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES, 2020

Journal of Physics: Conference Series, 2019

Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to t... more Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to the customer, to get the minimum cost delivery route. To get optimal results, it is necessary to improve route from the initial solution. Variable Neighbourhood Descent (VND) is one of the metaheuristics that examine of a number of neighbourhood operators to get the optimal route. A VRP route is called optimal if there are no other routes that can be generated from all the neighbourhood operators used in VND. This article describes the application of VND to get the optimal route on CVRP, MDVRP, and VRPTW. The results of the experiment on some test data used indicate that VND can be used to get more optimal length and travel time route.

TELKOMNIKA (Telecommunication Computing Electronics and Control), 2019

Many optimization problems require heuristic methods to solve the problem. Variable Neighborhood ... more Many optimization problems require heuristic methods to solve the problem. Variable Neighborhood Search (VNS) is a metaheuristic form that systematically changes its "neighborhood" in search of solutions. One method in VNS is Variable Neighborhood Descent (VND), which performs a deterministic neighborhood change. The change of the neighborhood in VND can be done in a random and sequential order. This paper compares sequential and random neighborhood selection methods in solving Capacitated Vehicle Routing Problem (CVRP) problems. There are 6 intra-route neighborhood structures and 4 inter-route structures used. CVRP problems are taken from several dataset providers. The initial solution is formed by Sequential Insertion method. The experimental results show that the random selection of neighborhood operators can provide a more optimal route length (in 10 of 13 datasets used) than that of sequential selection (only better in 3 dataset). However, the random selection takes more iterations to reach convergent state than the sequential one. For sequential selection, determination of the neighborhood structure's order affects the speed to the convergent state. Hence, a random selection in VND method is more preferable than sequential selection.

Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimizati... more Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization. Objective of VRP is to find minimum length route starts and ends in a depot. There are some additional constraints such as more than one depot, service time, time window, capacity of vehicle, and many more. These are cause of VRP variants. Vehicle Routing Problem with Time Windows (VRPTW) is a variant of VRP with some additional constrains, that are number of requests may not exceed the vehicle capacity, as well as travel time and service time may not exceed the time window. Multi Depot Vehicle Routing Problem (MDVRP) has number of depots serving all customers, a number of vehicles distributing goods to customers with a minimum distance of distribution route without exceeding the capacity of the vehicle. Many researches have presented algorithms to solve VRPTW and MDVRP. This article discusses solution characteristics of VRPTW and MDVRP algorithms, and their performance. VRPTW algori...