OPTIMIZATION OF TOURIST ROUTES IN BATAM CITY USING INTEGER LINEAR PROGRAMMING WITH DESTINATION CATEGORY CONSTRAINTS

Authors

  • Andro Kurniawan Institut Teknologi Batam
  • Syifaul Janan Department of Mechanical Engineering, Universitas Pembangunan Nasional Veteran Jakarta
  • Yoli Agnesia Department of Mathematics, Universitas Negeri Padang
  • Agustina Veronika Department of Mathematics, Institut Teknologi Batam

DOI:

https://doi.org/10.25077/jmua.15.4.527-543.2026

Keywords:

Category Constraints, Integer Linear Programming, Routing Optimization

Abstract

Tourist route planning plays an important role in improving travel efficiency and visitor experience in urban tourism areas. Batam City offers numerous tourist destinations with diverse characteristics, making route planning under realistic constraints a challenging task. Classical Traveling Salesman Problem (TSP) models assume that all destinations must be visited, which is often impractical in real-world tourism scenarios. Therefore, this study proposes an optimization model for tourist route planning in Batam City using Integer Linear Programming (ILP) with destination category constraints. The proposed model allows a subset of destinations to be selected from a larger candidate set while determining the optimal visiting sequence. The objective function minimizes the total travel distance based on fixed driving distances obtained from digital map services. The model incorporates several constraints, including route continuity, subtour elimination, and category restrictions that limit the number of destinations selected from specific categories, such as beaches, shopping malls, and cultural sites. The model is implemented in Python using the PuLP optimization library and evaluated across four scenarios with varying category constraint settings. In the main scenario, the model produces an optimal route visiting 11 destinations with a total travel distance of 123.6 km. Scenario analysis further demonstrates that destination category selection significantly affects the total travel distance, with differences of up to 53.8% across scenarios despite a constant number of selected destinations. These findings indicate that ILP provides a flexible and effective framework for constrained tourist route optimization in urban tourism contexts. Furthermore, category-based constraints offer valuable insights into the trade-off between destination diversity and route efficiency.

Downloads

Download data is not yet available.

References

[1] Batam, P.K., 2022, Buku Profil Kota Batam Tahun 2022, Dinas Komunikasi dan Informatika Kota Batam, Batam.

[2] Grace, H., Purwanti, A., 2021, Image of Batam City as a City of Tourism According to Tourists Who Visit Batam City, Indonesia, Scientia Journal, Vol. 3: 0–0.

[3] Fajrin, A.A., Meldra, D., 2019, Optimasi Rute Panduan Informasi Lokasi Wisata Menggunakan Ant Colony System Pada Kota Batam, Jurnal Teknologi dan Open Source, Vol. 2: 1–13. DOI: https://doi.org/10.36378/jtos.v2i2.353

[4] Imah, E., Hutomo, A., Fitrananda, A., Marshadiany, A., Prikarti, G., 2011, Implementasi Algoritma Integer Linear Programming Untuk Sistem Informasi Penjadwalan Ruangan Di Fakultas Ilmu Komputer Universitas Indonesia, Jurnal Sistem Informasi, Vol. 7: 25–33. DOI: https://doi.org/10.21609/jsi.v7i1.291

[5] Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., 2014, A Survey on Algorithmic Approaches for Solving Tourist Trip Design Problems, Journal of Heuristics, Vol. 20: 291–328. DOI: https://doi.org/10.1007/s10732-014-9242-5

[6] Ruiz-Meza, J., Montoya-Torres, J.R., 2022, A Systematic Literature Review for the Tourist Trip Design Problem: Extensions, Solution Techniques and Future Research Lines, Operations Research Perspectives, Vol. 9: 100–228. DOI: https://doi.org/10.1016/j.orp.2022.100228

[7] Bolzoni, P., Helmer, S., Wellenzohn, K., Gamper, J., Andritsos, P., 2014, Efficient Itinerary Planning with Category Constraints, in Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 203–212, ACM Press, Dallas, Texas. DOI: https://doi.org/10.1145/2666310.2666411

[8] Suliman, N., Yusop, N., Janggi, N., Kamaruddin, N., Basir, N., 2024, An Integer Programming Approach to the Travelling Salesman Problem for Optimizing Self-Drive Tourist Routes in Kuala Lumpur, Mathematical Sciences and Informatics Journal, Vol. 5: 1–9.

[9] Hillier, F.S., Lieberman, G.J., 2010, Introduction to Operations Research, 9th ed., McGraw-Hill Higher Education, New York.

[10] Winston, W.L., 2004, Operations Research Applications and Algorithms, 4th ed., Cengage Learning, Boston.

[11] Basriati, S., 2018, Integer Linear Programming Dengan Pendekatan Metode Cutting Plane Dan Branch And Bound Untuk Optimasi Produksi Tahu, Jurnal Sains Matematika dan Statistika, Vol. 4: 95–104.

[12] Campuzano, G., Obreque, C., Aguayo, M.M., 2020, Accelerating the Miller-Tucker-Zemlin Model for the Asymmetric Traveling Salesman Problem, Expert Systems with Applications, Vol. 148: 113–229. DOI: https://doi.org/10.1016/j.eswa.2020.113229

[13] Miller, C.E., Tucker, A.W., Zemlin, R.A., 1960, Integer Programming Formulation of Traveling Salesman Problems, Journal of the ACM, Vol. 7: 326–329. DOI: https://doi.org/10.1145/321043.321046

[14] Bektas, T., 2014, Requiem for the Miller–Tucker–Zemlin Subtour Elimination Constraints?, European Journal of Operational Research, Vol. 236: 820–832. DOI: https://doi.org/10.1016/j.ejor.2013.07.038

[15] Benhida, S., Mir, A., 2018, Generating subtour elimination constraints for the Traveling Salesman Problem, IOSR Journal of Engineering (IOSRJEN), Vol. 8: 17–21.

[16] Montoya, O.D., Gil-González, W., Grisales-Noreña, L.F., Bolaños, R.I., Ardila-Rey, J., 2024, TSP solution using an exact model based on the branch flow formulation and automatic cases generation via the Julia software, Results in Control and Optimization, Vol. 17: 100–507. DOI: https://doi.org/10.1016/j.rico.2024.100507

[17] Barrena, E., Canca, D., Coelho, L.C., Laporte, G., 2023, Analysis of the Selective Traveling Salesman Problem with Time-Dependent Profits, TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Vol. 31: 165–193. DOI: https://doi.org/10.1007/s11750-022-00632-6

Downloads

Published

22-10-2026

How to Cite

Andro Kurniawan, Janan, S., Agnesia, Y., & Veronika, A. (2026). OPTIMIZATION OF TOURIST ROUTES IN BATAM CITY USING INTEGER LINEAR PROGRAMMING WITH DESTINATION CATEGORY CONSTRAINTS. Jurnal Matematika UNAND, 15(4), 527–543. https://doi.org/10.25077/jmua.15.4.527-543.2026

Issue

Vol. 15 No. 4 (2026)

Section

Articles

License

Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 license, users are free to:

  • Share: Copy and redistribute the material in any medium or format.

  • Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.