IDEAS home Printed from https://ideas.repec.org/a/scm/rdtusv/v33y2022i33p7.html

Optimal Route Planning Of Tourism Spots In Tripura, India Using Multi-Trip Vehicle Routing Problem

Author

Listed:
  • Harsanglian Halam

    (Department of Commerce, Government Degree College, Dharmanagar-799 253, Tripura, India)

  • Subir Kumar Sen

    (Department of Commerce, Tripura University, Suryamaninagar, Agartala-799022 Tripura, India)

  • Debasish Batabyal

    (Amity Institute of Travel & Tourism, Amity University, Kolkata- 700135, India)

Abstract

Optimal travel route selection in real time basis minimizes the transportation cost for the tourists and guarantees the ease of travel as well. Accordingly, this paper deals with the problem of selecting the appropriate route selection to visit the identified tourists’ spots in Tripura, India using the vehicle routing problem with time windows. The different tourist spots in the study area are identified from the Tourism Department of the Government of Tripura. This study considers only two cities as the gateway to reach to Tripura. After which, based on Bing map portal, geographic information for all the selected tourist spots is mapped; and one to one distance matrix is prepared considering the identified tourist spots and the two-gateway point of Tripura. The result so derived is compared and contrasted with the traditional route followed by the travel operators of Tripura; and found significant differences in terms of cost of transportation and time spent to visit the different tourist spots in Tripura. Finally, this paper concluded that selection of optimal route for transport network of tourism spots in Tripura, India using multi-trip vehicle routing problem can ensure the ease of travel and satisfaction for the tourists visiting in Tripura, India.

Suggested Citation

  • Harsanglian Halam & Subir Kumar Sen & Debasish Batabyal, 2022. "Optimal Route Planning Of Tourism Spots In Tripura, India Using Multi-Trip Vehicle Routing Problem," Revista de turism - studii si cercetari in turism / Journal of tourism - studies and research in tourism, "Stefan cel Mare" University of Suceava, Romania, Faculty of Economics and Public Administration - Economy, Business Administration and Tourism Department., vol. 33(33), pages 1-7.
    • Handle: RePEc:scm:rdtusv:v:33:y:2022:i:33:p:7
    as

    Download full text from publisher

    File URL: https://revistadeturism.ro/index.php/rdt/article/view/154
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    2. J C S Brandão & A Mercer, 1998. "The multi-trip vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 49(8), pages 799-805, August.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    Full references (including those not matched with items on IDEAS)

    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. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    2. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    3. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    4. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    5. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
    6. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    7. Roberto Baldacci & Paolo Toth & Daniele Vigo, 2010. "Exact algorithms for routing problems under vehicle capacity constraints," Annals of Operations Research, Springer, vol. 175(1), pages 213-245, March.
    8. Grigorios D. Konstantakopoulos & Sotiris P. Gayialis & Evripidis P. Kechagias, 2022. "Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification," Operational Research, Springer, vol. 22(3), pages 2033-2062, July.
    9. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    10. Cattaruzza, Diego & Absi, Nabil & Feillet, Dominique & Vidal, Thibaut, 2014. "A memetic algorithm for the Multi Trip Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 833-848.
    11. Uchoa, Eduardo & Pecin, Diego & Pessoa, Artur & Poggi, Marcus & Vidal, Thibaut & Subramanian, Anand, 2017. "New benchmark instances for the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 845-858.
    12. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    13. Krutein, Klaas Fiete & Goodchild, Anne, 2022. "The isolated community evacuation problem with mixed integer programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    14. François, Véronique & Arda, Yasemin & Crama, Yves & Laporte, Gilbert, 2016. "Large neighborhood search for multi-trip vehicle routing," European Journal of Operational Research, Elsevier, vol. 255(2), pages 422-441.
    15. Rafael Martinelli & Claudio Contardo, 2015. "Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 658-676, November.
    16. Sukhpal & Kaushal Kumar, 2024. "Multi-trip multi-compartment vehicle routing problem with backhauls," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(5), pages 1717-1734, May.
    17. Macedo, Rita & Alves, Cláudio & Valério de Carvalho, J.M. & Clautiaux, François & Hanafi, Saïd, 2011. "Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model," European Journal of Operational Research, Elsevier, vol. 214(3), pages 536-545, November.
    18. Fernando Afonso Santos & Geraldo Robson Mateus & Alexandre Salles da Cunha, 2015. "A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(2), pages 355-368, May.
    19. Jan Christiaens & Greet Vanden Berghe, 2020. "Slack Induction by String Removals for Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(2), pages 417-433, March.
    20. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:scm:rdtusv:v:33:y:2022:i:33:p:7. 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: Iulian Condratov (email available below). General contact details of provider: https://edirc.repec.org/data/feusvro.html .

    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.