IDEAS home Printed from https://ideas.repec.org/a/gam/jadmsc/v8y2018i4p72-d184054.html
   My bibliography  Save this article

Marketplace Location Decision Making and Tourism Route Planning

Author

Listed:
  • Worapot Sirirak

    (Department of Industrial Engineering, Faculty of Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand)

  • Rapeepan Pitakaso

    (Department of Industrial Engineering, Faculty of Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand)

Abstract

This research addresses the problem of planning tourism routes and finding appropriate shopping (market place) locations for agricultural product transportation. Generally, tourists visit popular tourism attractions; and generally, unpopular tourism attractions do not stimulate the economy, trade, or local income. Popular tourism attractions that are located far away from each other require the transportation of local products, and tourists must make decisions as to which locations to visit when planning their vacation. Planning a tourism route while balancing tourism attractions and shopping markets is important for the economic stimulation of tourism. This work presents a problem-solving method for tourism route-planning for a particular case study in Chiang Rai province, Thailand, using the Adaptive Large Neighborhood Search (ALNS) method. Six main destruction and five repair cycles in the ALNS method were applied to solve the tourism route design problem and to find the best solution so that tourists can visit all of the main attractions. We found that 13 tourism routes provide the shortest travel distance for each travel route. The total distance traveled was 2538.02 km for all routes. To balance the tourism on all routes, the popular and less popular tourism attractions were combined. For all routes, the shopping market location is the best place for tourism products to be sold and where tourist relaxation occurs. The results from ALNS were compared with the results from those obtained by the exact Lingo program V11. The ALNS algorithm results were not significantly different from the Lingo results. For the computational results for all examined cases, the ALNS algorithm was shown to be competitive, with short processing times given the sizes of the problems. For the traveling distance, the ALNS result significantly differs from the exact method by approximately 1.12%, and had a better effect than the exact method by approximately 99% in terms of processing time. Therefore, the proposed methodology provides an effective and high-quality solution for tourism route planning.

Suggested Citation

  • Worapot Sirirak & Rapeepan Pitakaso, 2018. "Marketplace Location Decision Making and Tourism Route Planning," Administrative Sciences, MDPI, vol. 8(4), pages 1-25, November.
    • Handle: RePEc:gam:jadmsc:v:8:y:2018:i:4:p:72-:d:184054
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2076-3387/8/4/72/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2076-3387/8/4/72/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
    4. Andrades, Lidia & Dimanche, Frederic, 2017. "Destination competitiveness and tourism development in Russia: Issues and challenges," Tourism Management, Elsevier, vol. 62(C), pages 360-376.
    5. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    6. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    7. Yan, Libo & Gao, Bo Wendy & Zhang, Meng, 2017. "A mathematical model for tourism potential assessment," Tourism Management, Elsevier, vol. 63(C), pages 355-365.
    8. Gullhav, Anders N. & Cordeau, Jean-François & Hvattum, Lars Magnus & Nygreen, Bjørn, 2017. "Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds," European Journal of Operational Research, Elsevier, vol. 259(3), pages 829-846.
    9. Zheng, Weimin & Huang, Xiaoting & Li, Yuan, 2017. "Understanding the tourist mobility using GPS: Where is the next place?," Tourism Management, Elsevier, vol. 59(C), pages 267-280.
    10. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    11. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cristina Maria Păcurar & Ruxandra-Gabriela Albu & Victor Dan Păcurar, 2021. "Tourist Route Optimization in the Context of Covid-19 Pandemic," Sustainability, MDPI, vol. 13(10), pages 1-17, May.
    2. Beata Bieszk-Stolorz & Krzysztof Dmytrów, 2021. "Marketplace Trade in Large Cities in Poland," Land, MDPI, vol. 10(9), pages 1-15, September.
    3. Zyrianov Aleksandr I. & Zyrianova Inna S., 2021. "Planning of the Interregional Tourist Route in the Urals," Quaestiones Geographicae, Sciendo, vol. 40(2), pages 109-118, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. TURKEŠ, Renata & SÖRENSEN, Kenneth & HVATTUM, Lars Magnus & BARRENA, Eva & CHENTLI, Hayet & COELHO, Leandro & DAYARIAN, Iman & GRIMAULT, Axel & GULLHAVE, Anders & IRIS, Çagatay & KESKIN, Merve & KIEFE, 2019. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," Working Papers 2019002, University of Antwerp, Faculty of Business and Economics.
    2. Allahyari, Somayeh & Yaghoubi, Saeed & Van Woensel, Tom, 2021. "A novel risk perspective on location-routing planning: An application in cash transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    3. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    4. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    5. José Ruiz-Meza & Julio Brito & Jairo R. Montoya-Torres, 2021. "Multi-Objective Fuzzy Tourist Trip Design Problem with Heterogeneous Preferences and Sustainable Itineraries," Sustainability, MDPI, vol. 13(17), pages 1-22, August.
    6. Amin Aghalari & Darweesh Ehssan Salamah & Carlos Marino & Mohammad Marufuzzaman, 2023. "Electric vehicles fast charger location-routing problem under ambient temperature," Annals of Operations Research, Springer, vol. 324(1), pages 721-759, May.
    7. Hemmelmayr, Vera C., 2015. "Sequential and parallel large neighborhood search algorithms for the periodic location routing problem," European Journal of Operational Research, Elsevier, vol. 243(1), pages 52-60.
    8. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    9. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The impact of depot location, fleet composition and routing on emissions in city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 81-102.
    10. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 248(1), pages 33-51.
    11. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2021. "Two-echelon vehicle routing problem with satellite bi-synchronization," European Journal of Operational Research, Elsevier, vol. 288(3), pages 775-793.
    12. Yanwei Zhao & Longlong Leng & Chunmiao Zhang, 2021. "A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery," Operational Research, Springer, vol. 21(2), pages 1299-1332, June.
    13. Bongiovanni, Claudia & Kaspi, Mor & Cordeau, Jean-François & Geroliminis, Nikolas, 2022. "A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    14. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    15. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    16. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    17. Alvarez, Jose A. Lopez & Buijs, Paul & Deluster, Rogier & Coelho, Leandro C. & Ursavas, Evrim, 2020. "Strategic and operational decision-making in expanding supply chains for LNG as a fuel," Omega, Elsevier, vol. 97(C).
    18. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    19. Elena Fernández & Gilbert Laporte & Jessica Rodríguez-Pereira, 2019. "Exact Solution of Several Families of Location-Arc Routing Problems," Transportation Science, INFORMS, vol. 53(5), pages 1313-1333, September.
    20. Danışment Vural & Robert F. Dell & Erkan Kose, 2021. "Locating unmanned aircraft systems for multiple missions under different weather conditions," Operational Research, Springer, vol. 21(1), pages 725-744, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jadmsc:v:8:y:2018:i:4:p:72-:d:184054. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.