Subject: Computer and Information Science Author Affiliation: Telkom University Author Name: Meta Kallista Author Name: Purba Daru Kusuma
1 to 4 of 4 Results
Jul 14, 2022 - Purba Daru Kusuma Journal Publication
Purba Daru Kusuma; Meta Kallista, 2022, "Stochastic Komodo Algorithm", https://doi.org/10.34820/FK2/UQKWB2, Telkom University Dataverse, V1
A novel metaheuristic algorithm is proposed in this paper, namely stochastic komodo algorithm (SKA). This proposed algorithm is an improved version of Komodo mlipir algorithm (KMA), which is inspired by the behaviour of Komodo during foraging and mating. The improvement is conduc... |
Jul 14, 2022 - Purba Daru Kusuma Journal Publication
Purba Daru Kusuma; Meta Kallista, 2022, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", https://doi.org/10.34820/FK2/DOCE82, Telkom University Dataverse, V1
This work aims to minimize the total travel distance and the number of unserved customers in single routing cycle. The solution is developed by combining the stable marriage algorithm and k-means clustering in the clustering process. The nearest neighbour algorithm is used in the... |
Jul 14, 2022 - Purba Daru Kusuma Journal Publication
Purba Daru Kusuma; Meta Kallista, 2022, "Dispatching Model in Online Taxi System by Using Stable Marriage and First Price Sealed Bid Auction Models", https://doi.org/10.34820/FK2/UBUYJF, Telkom University Dataverse, V1
This work aims to develop a dispatching model for online taxi system that accommodates these aspects too rather than waiting time and pickup cost only. This model is developed by combining stable marriage and first price sealed bid auction. |
Jul 14, 2022 - Purba Daru Kusuma Journal Publication
Purba Daru Kusuma; Meta Kallista, 2022, "Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance", https://doi.org/10.34820/FK2/3X9FNO, Telkom University Dataverse, V1
This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. |