Jinghua Li , Zixiang Zhang , Dening Song , Boxin Yang , Lei Zhou
{"title":"Cruise onboard itinerary planning for multi passengers with service venue capacity and time-window constraints","authors":"Jinghua Li , Zixiang Zhang , Dening Song , Boxin Yang , Lei Zhou","doi":"10.1016/j.cor.2024.106944","DOIUrl":null,"url":null,"abstract":"<div><div>The design of personalized onboard itineraries for multiple cruise passengers plays an important role in improving the tourism experience on cruise. Different from itinerary planning for city traveling, the venues on cruise suffer from strict capacity and time-window constraints due to the safety requirements, which results in the coupling effects between itineraries of multiple passengers. This study constructs an optimization model to balancing the gap between passengers while maximizing passenger benefits, develops an Adaptive Large Neighborhood Search algorithm based on Improved destruction-repair operators (IOALNS) to solve multi-passenger itinerary planning. Extensive analyses are performed to demonstrate the performance advantages of the IOALNS algorithm in solving instances with varying sizes. Finally, the test results of cruise passenger instances show that compared with existing multi-passenger travel planning algorithms, the proposed algorithm can improve passenger efficiency by at least 9.98% and reduce computation time by more than 50%. These effectively improve passenger satisfaction and operational efficiency in the cruise industry.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106944"},"PeriodicalIF":4.1000,"publicationDate":"2024-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004167","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The design of personalized onboard itineraries for multiple cruise passengers plays an important role in improving the tourism experience on cruise. Different from itinerary planning for city traveling, the venues on cruise suffer from strict capacity and time-window constraints due to the safety requirements, which results in the coupling effects between itineraries of multiple passengers. This study constructs an optimization model to balancing the gap between passengers while maximizing passenger benefits, develops an Adaptive Large Neighborhood Search algorithm based on Improved destruction-repair operators (IOALNS) to solve multi-passenger itinerary planning. Extensive analyses are performed to demonstrate the performance advantages of the IOALNS algorithm in solving instances with varying sizes. Finally, the test results of cruise passenger instances show that compared with existing multi-passenger travel planning algorithms, the proposed algorithm can improve passenger efficiency by at least 9.98% and reduce computation time by more than 50%. These effectively improve passenger satisfaction and operational efficiency in the cruise industry.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.