IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v15y2016i06ns0219622016500413.html
   My bibliography  Save this article

Optimizing Personalized Touristic Itineraries by a Multiobjective Evolutionary Algorithm

Author

Listed:
  • Ivanoe De Falco

    (ICAR, National Research Council of Italy, Via P. Castellino, Naples, 80131, Italy)

  • Umberto Scafuri

    (ICAR, National Research Council of Italy, Via P. Castellino, Naples, 80131, Italy)

  • Ernesto Tarantino

    (ICAR, National Research Council of Italy, Via P. Castellino, Naples, 80131, Italy)

Abstract

The paper presents an electronic tourist guide, relying on an evolutionary optimizer, able to plan personalized multiple-day itineraries by considering several contrasting objectives. Since the itinerary planning can be modeled as an extension of the NP-complete team orienteering problem with time windows, a multiobjective evolutionary optimizer is proposed to find in reasonable times near-optimal solutions to such an extension. This optimizer automatically designs the itinerary by aiming at maximizing the tourists’ satisfaction as a function of their personal preferences and environmental constraints, such as operating hours, visiting times and accessibility of the points of interests, and weather forecasting. Experimental evaluations have demonstrated that the proposed optimizer is effective in different simulated operating conditions.

Suggested Citation

  • Ivanoe De Falco & Umberto Scafuri & Ernesto Tarantino, 2016. "Optimizing Personalized Touristic Itineraries by a Multiobjective Evolutionary Algorithm," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(06), pages 1269-1312, November.
    • Handle: RePEc:wsi:ijitdm:v:15:y:2016:i:06:n:s0219622016500413
    DOI: 10.1142/S0219622016500413
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622016500413
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622016500413?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gang Kou & Yanqun Lu & Yi Peng & Yong Shi, 2012. "Evaluation Of Classification Algorithms Using Mcdm And Rank Correlation," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 11(01), pages 197-225.
    2. Kou, Gang & Ergu, Daji & Shang, Jennifer, 2014. "Enhancing data consistency in decision matrix: Adapting Hadamard model to mitigate judgment contradiction," European Journal of Operational Research, Elsevier, vol. 236(1), pages 261-271.
    3. Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
    4. Kou, Gang & Lin, Changsheng, 2014. "A cosine maximization method for the priority vector derivation in AHP," European Journal of Operational Research, Elsevier, vol. 235(1), pages 225-232.
    5. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    6. Wouter Souffriau & Pieter Vansteenwegen & Greet Vanden Berghe & Dirk Van Oudheusden, 2013. "The Multiconstraint Team Orienteering Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 47(1), pages 53-63, February.
    7. Lin, Shih-Wei & Yu, Vincent F., 2012. "A simulated annealing heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 217(1), pages 94-107.
    8. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    9. Labadie, Nacima & Mansini, Renata & Melechovský, Jan & Wolfler Calvo, Roberto, 2012. "The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search," European Journal of Operational Research, Elsevier, vol. 220(1), pages 15-27.
    10. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    11. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
    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. Ernesto Tarantino & Ivanoe De Falco & Umberto Scafuri, 2019. "A mobile personalized tourist guide and its user evaluation," Information Technology & Tourism, Springer, vol. 21(3), pages 413-455, September.
    2. R. Venkata Rao & Dhiraj P. Rai & J. Balic, 2019. "Multi-objective optimization of abrasive waterjet machining process using Jaya algorithm and PROMETHEE Method," Journal of Intelligent Manufacturing, Springer, vol. 30(5), pages 2101-2127, 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. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    2. Ernesto Tarantino & Ivanoe De Falco & Umberto Scafuri, 2019. "A mobile personalized tourist guide and its user evaluation," Information Technology & Tourism, Springer, vol. 21(3), pages 413-455, September.
    3. Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
    4. Damianos Gavalas & Charalampos Konstantopoulos & Konstantinos Mastakas & Grammati Pantziou, 2019. "Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-44, February.
    5. Zhao, Yanlu & Alfandari, Laurent, 2020. "Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach," European Journal of Operational Research, Elsevier, vol. 285(3), pages 825-843.
    6. Aldy Gunawan & Hoong Chuin Lau & Pieter Vansteenwegen & Kun Lu, 2017. "Well-tuned algorithms for the Team Orienteering Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 861-876, August.
    7. Oktay Yılmaz & Ertan Yakıcı & Mumtaz Karatas, 2019. "A UAV location and routing problem with spatio-temporal synchronization constraints solved by ant colony optimization," Journal of Heuristics, Springer, vol. 25(4), pages 673-701, October.
    8. Zhang, Shu & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2020. "Multi-period orienteering with uncertain adoption likelihood and waiting at customers," European Journal of Operational Research, Elsevier, vol. 282(1), pages 288-303.
    9. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    10. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
    11. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
    12. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
    13. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    14. Viral Gupta & P. K. Kapur & Deepak Kumar, 2019. "Prioritizing and Optimizing Disaster Recovery Solution using Analytic Network Process and Multi Attribute Utility Theory," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 171-207, January.
    15. Qian Qian & Yang Yang & Zong-Fang Zhou, 2019. "Research on Trade Credit Spreading and Credit Risk within the Supply Chain," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 389-411, January.
    16. Emre Çalişkan & Erdem Aksakal & Saliha Çetinyokuş & Tahsin Çetinyokuş, 2019. "Hybrid Use of Likert Scale-Based AHP and PROMETHEE Methods for Hazard Analysis and Consequence Modeling (HACM) Software Selection," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(05), pages 1689-1715, September.
    17. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    18. Shouzhen Zeng & Jianping Chen & Xingsen Li, 2016. "A Hybrid Method for Pythagorean Fuzzy Multiple-Criteria Decision Making," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 403-422, March.
    19. Ardalan Bafahm & Minghe Sun, 2019. "Some Conflicting Results in the Analytic Hierarchy Process," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 465-486, March.
    20. Ayfer Basar & Özgür Kabak & Y. Ilker Topcu, 2017. "A Decision Support Methodology for Locating Bank Branches: A Case Study in Turkey," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 16(01), pages 59-86, January.

    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:wsi:ijitdm:v:15:y:2016:i:06:n:s0219622016500413. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.