Open Access
·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667
Powered by:DOICrossrefiThenticate
The Journal of Information and Optimization Sciences (JIOS) is a world leading journal publishing high quality, rigorously peer-reviewed original research in all mathematically-oriented theoretical and applied topics in information sciences, optimization sciences and related areas since 1980. Subjects include but are not limited to:
• Information Sciences
• Optimization Sciences
• Control Theory
• Operational Research
• Decision Sciences
• Information Theory
• Information Technology
• Computer Networks and Communications
• Mathematical Programming
• Modelling and Simulation
• Database Management
• Applications to Engineering Sciences
• Applications to Technology
Issues up to 2022 co-published with and available at:
Tourist tram routing problem in Lamphun city, Thailand
Nuttapong WattanasiripongDepartment of Applied Mathematics Faculty of Science and Technology Valaya Alongkorn Rajabhat University under the Royal PatronagePathumthani, 13180, ThailandView full profile →
, *Nisakorn W. SangwaranateeCorresponding authornisakorn.su@ssru.ac.thDepartment of Informatics Mathematics Faculty of Science and Technology Suan Sunandha Rajabhat University U-thong Nok Road, DusitBangkok, 10300, ThailandView full profile →
, Chartchai LeenawongDepartment of Mathematics School of Science King Mongkut’s Institute of Technology LadkrabangBangkok, 10520, ThailandView full profile →
* Corresponding author · click or hover a name for details
This research aims to study the tourist tram routing problem in Lamphun City, Thailand. Considered an application of the Travelling Salesman Problem (TSP), the distance data along all possible routes were gathered from Google Maps and Google Earth, including additional information provided by the city. First, the shortest distance between each pair of the tourist spots is determined. Then, the linear programming (LP) model for TSP is employed so as to find the best tourist tram route traversing through all planned tourist spots with minimum total distance. The solution obtained from this model is then compared with those from the nearest neighbor and the savings algorithms for TSP. The comparison shows that the optimal tram routes from the LP model and the savings algorithm are, though different, tied at the minimum total distance of 9,770 meters, reduced by 9.36% from the current 10,779-meter route. This optimal route is also better than the of 10,050-meter route obtained from the nearest neighbor algorithm.
[1] B. Abdoli, S. A. MirHassani & F. Hooshmand. On different formulations of green vehicle routing problem, Journal of Information and Optimization Sciences, 40:4, 883-903 (2019). [2] P.H. Siqueira, S. Scheer and M.T.A Steiner. A Recurrent Neural Network to Travelling Salesman Problem. Travelling Salesman Problem (2008), ISBN 978-953-7619-10-7, 135-156.[3] N. Besozzi, L. Ruschetti, C. Rossignoli, and F. Strozzi. The Traveling Salesman Game for Cost Allocation: The Case Study of the Bus Service in Castellanza. Game Theory, vol. 2014 (2014).[4] R. Pitakaso. Lecture Notes: How to Evolve Using Differences for Transportation Logistics Solutions. Chapter 5: Salesman Troubles Faculty of Engineering, Ubon Ratchathani University (2013).[5] G. Clarke and J.V. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581 (1964).[6] C. Poobuengphrao and S. Yodmanee. A Study on the Water Measurement Problem by the Traveling Salesman Method, Case Study of Prachin Buri Provincial Waterworks Authority. Master Thesis, Department of Industrial Management, Faculty of Technology and Industrial Management King Mongkut’s University of Technology North Bangkok (2004).[7] P. Siri-Olan. Reducing Transportation Costs by Arranging Appropriate Transportation Routes for a Drink-Drinking business case. Global Intelligence Journal, Year 5 (Special issue), 272-279 (2014).[8] S. Winyangkul et. al. Application of the Travelling Salesman Problem Model. A Study of Tram Touring Routes of Chiang Rai Municipality, Faculty of Industrial Technology, University Lampang Rajabhat University, Journal of Faculty of Industrial Technology, 7(2) (2014).[9] K. Srimueng. Determining the Appropriate Number of Trucks for Retailing: Case study: Top Super Market. Master Thesis, Civil Engineering, Department of Civil Engineering, Graduate School King Mongkut’s University of Technology North Bangkok (2007).[10] P. Saendee, Q. Chamnanmaw and S. Chantha. Road Transport Study. Case Study: Lad-Sawai Subdistrict, Lamlookka District, Pathumthani Province. Faculty of Technology and Industrial Management King Mongkut’s University of Technology North Bangkok, Journal of Industrial Education, 61-71 (2014).[11] N. Wongsakda et. al. Transportation Routing Using Safe Run, Algorithms, and Models of Salesman Problem. Case study of drinking water plant. Thai Journal of Research, 3(1) (2005).[12] S.H. Frederick, and Lieberman, G.J. Introduction to Operations Research. 8th ed. New York: Mc Graw Hill (2005).[13] H. Jay, and B. Render. Operations Management. 10th ed. New Jersey : Prentice Hall (2011).
Views: 174Downloads: 4Citations: 0
Install Journal of Information and Optimization SciencesFaster access from your home screen