New algorithm tackles large-scale itinerary planning challenges

Researchers have developed a new multi-objective cooperative coevolutionary algorithm designed to tackle large-scale itinerary planning problems. This approach analyzes inter-component dependencies to establish conditions for weak decomposability, enabling optimal paths that visit clusters as contiguous subpaths. The algorithm incorporates a dynamic decomposition strategy, considers optimization potential based on component scale and contribution, and employs a computational resource allocation strategy. Evaluations on 34 real-world and benchmark test cases demonstrated that the proposed algorithm achieved the highest mean hypervolume and significantly outperformed existing methods, particularly on large-scale instances. AI

IMPACT This research could lead to more efficient route optimization in logistics and travel planning applications.

RANK_REASON Academic paper detailing a new algorithm for itinerary planning. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• alphaXiv
• arXiv
• CatalyzeX Code Finder for Papers
• Clustered Orienteering Problem
• CORE Recommender
• DagsHub
• Decomposability-Guided Cooperative Coevolution
• Gotit.pub
• Hugging Face
• Influence Flower
• Large-Scale Itinerary Planning
• ScienceCast
• travelling salesperson problem
• Ziyu Zhang

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →