IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/v16y2012i2p5-13.html
   My bibliography  Save this article

Applications of Operational Research Techniques in Optimization to Visit Tourist Points of Vina del Mar

Author

Listed:
  • Joao CARDOSO NETO
  • Cleibson Aparecido de ALMEIDA
  • Giovani ROVEROTO
  • José Danilo Haick TAVARES

Abstract

Chile is a country with great attractions for tourists in South America and the whole world. Among the many tourist Chilean attractions the city of Vina del Mar is one of the highlights, recognized nationally and internationally as one of the most beautiful places for summer. In Vina del Mar tourists have many options for leisure, besides pretty beaches, e.g. playa renaca, the city has beautiful squares and castles, e.g. Castillo Wulff built more than 100 (one hundred) years ago. It is noteworthy that already exist over there five (5) tourist itineraries, so this work was developed in order to determine the best routes to these existing itineraries, and create a unique route that includes all the tourist points in Vina del Mar, because in this way, the tourists visiting this city can minimize the time spent in traveling, as well as optimize their moments of leisure, taking the opportunity to know all the city attractions. To determine shorter ways to do it and then propose some suggestions for improvement of the quality of the tourist service offered, it had used the exact method, by solving the mathematical model of the TSP (Traveling Salesman Problem), and the heuristic method, using the most economic insertion algorithm.

Suggested Citation

  • Joao CARDOSO NETO & Cleibson Aparecido de ALMEIDA & Giovani ROVEROTO & José Danilo Haick TAVARES, 2012. "Applications of Operational Research Techniques in Optimization to Visit Tourist Points of Vina del Mar," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 16(2), pages 5-13.
    • Handle: RePEc:aes:infoec:v:16:y:2012:i:2:p:5-13
    as

    Download full text from publisher

    File URL: http://www.revistaie.ase.ro/content/62/01%20-%20Cardoso.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. B. Golden & L. Bodin & T. Doyle & W. Stewart, 1980. "Approximate Traveling Salesman Algorithms," Operations Research, INFORMS, vol. 28(3-part-ii), pages 694-711, June.
    2. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    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. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    2. Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
    3. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    4. Vicente Campos & Estefanía Piñana & Rafael Martí, 2011. "Adaptive memory programming for matrix bandwidth minimization," Annals of Operations Research, Springer, vol. 183(1), pages 7-23, March.
    5. Erwin Knippenberg & Dean Jolliffe & John Hoddinott, 2020. "Land Fragmentation and Food Insecurity in Ethiopia," American Journal of Agricultural Economics, John Wiley & Sons, vol. 102(5), pages 1557-1577, October.
    6. Timo Hintsch & Stefan Irnich, 2017. "Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem," Working Papers 1701, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    7. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    8. Bouška, Michal & Šůcha, Přemysl & Novák, Antonín & Hanzálek, Zdeněk, 2023. "Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness," European Journal of Operational Research, Elsevier, vol. 308(3), pages 990-1006.
    9. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    10. Pablo Moscato & Michael G. Norman, 1998. "On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 121-132, May.
    11. Goldbarg, M.C. & Bagi, L.B. & Goldbarg, E.F.G., 2009. "Transgenetic algorithm for the Traveling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 36-45, November.
    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. van der Bruggen, Lambert & Gruson, Ruud & Salomon, Marc, 1995. "Reconsidering the distribution structure of gasoline products for a large oil company," European Journal of Operational Research, Elsevier, vol. 81(3), pages 460-473, March.
    14. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2010. "A heuristic procedure for the Capacitated m-Ring-Star problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1227-1234, December.
    15. Ahmed Kheiri & Alina G. Dragomir & David Mueller & Joaquim Gromicho & Caroline Jagtenberg & Jelke J. Hoorn, 2019. "Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 561-595, December.
    16. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Wex, Felix & Schryen, Guido & Feuerriegel, Stefan & Neumann, Dirk, 2014. "Emergency response in natural disaster management: Allocation and scheduling of rescue units," European Journal of Operational Research, Elsevier, vol. 235(3), pages 697-708.
    18. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    19. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    20. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.

    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:aes:infoec:v:16:y:2012:i:2:p:5-13. 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: Paul Pocatilu (email available below). General contact details of provider: https://edirc.repec.org/data/aseeero.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.