OPTIMIZATION OF TRANSPORT SYSTEM IN YOGYAKARTA CITY WITH VEHICLE ROUTING PROBLEM MODEL USING ALGORITHM SEQUENTIAL INSERTION
DOI:
https://doi.org/10.21831/jps.v19i1.2324Keywords:
vehicle routing problem, intermediate facility, sequential insertion algorithAbstract
The purposes of this study were to build a model for vehicle routing problem (VRP) for waste transportation in Yogyakarta, solve the model obtained using sequential insertion algorithm, then create an Excel Macro programming language to simulate the problem. Waste transportation conditions can be analogous to the VRP by adding intermediate facility at the end of the route, which in this case is the landfill (TPA). To determine waste transportation solved by sequential insertion algorithm. This algorithm is a method to obtain a travel route by updating the node that has not been assigned by inserting between the nodes that have been assigned. Based on 22 TPS simulated with Macro Excel, obtained 4 tours if given planning horizon length is 3 hours, and gained 3 tours if given planning horizon length is 4 hours.
References
Angelelli, E., & Speranza, M.G. 2002. The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research , 233-247.
Bodin, L., Golden, B. M., Assad, A., & Ball, M. 1983. Routing and schedulling of vehicles and crews:the state of the art. Computer and Operations Research, 63211.
Fitria, L., Susanty, S., & Suprayogi. 2009. Penentuan rute truk pengumpulan dan pengangkutan sampah di Bandung. Jurnal Teknik Industri, 51-60.
Himmawati, & Eminugroho. 2012. Penerapan algoritma koloni semut (ant colony optimization) untuk optimasi rute distribusi sampah di Kota Yogyakarta. Yogyakarta: FMIPA UNY.
Nallusamy, R., Duraiswany, K., Dhanalaksmi, R., & Parthiban, P. 2009. Optimization of multiple vehicle routing problems using approximation algorithms. International Journal of Engineering Science and Technology, 129-135.
Schulz, F., Wagner, D., & Weihe, K. 2000. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. Journal of Experimental Algorithmics, 12-34.
Shin, H., & Shin, J.S. 2006. Application of Floyd-Warshall labelling technique: Identification of connected pixel componentsin binary image. KangweonKyungki Math. Journal, 47-55.
Teodorovic, D., Davidovic, T., & Selmic, M. 2011. Bee colony optimization: the applications survey. ACM Transactions on Computational Logic, 1-20.
Tung, D. V., & Pinnoi, A. 2000. Case study vehicle routing-schedulling for waste Operational Research, 125, 449-468.
Downloads
Published
How to Cite
Issue
Section
License
Who Can Submit?
Any individual may submit an original manuscript for consideration for publication in Jurnal Penelitian Saintek as long as they hold the copyright to the work or are authorized by the copyright owner(s) to submit it. Authors retain initial ownership of the copyrights to their works prior to publication, except in cases where, as a condition of employment, they have agreed to transfer copyright to their employer.
User Rights
Jurnal Penelitian Saintek is an Open Access journal. Users are granted the right to read, download, copy, distribute, print, search, or link to the full texts of articles, provided they comply with the conditions of the Creative Commons Attribution-ShareAlike License 4.0 (CC BY-SA 4.0).
https://creativecommons.org/licenses/by-sa/4.0/
Author Rights
Authors retains copyrights.
Jurnal Penelitian Saintek by http://journal.uny.ac.id/index.php/saintek is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
