Travel planning and recommendation are important aspects of transportation. We propose and investigate a novel CollectiveTravel Planning (CTP) query that finds the lowest-cost route connecting multiple sources and a destination, via at most k meetingpoints. When multiple travelers target the same destination (e.g., a stadium or a theater), they may want to assemble at meeting pointsand then go together to the destination by public transport to reduce their global travel cost (e.g., energy, money, or greenhouse-gasemissions). This type of functionality holds the potential to bring significant benefits to society and the environment, such as reducing energy consumption and greenhouse-gas emissions, enabling smarter and greener transportation, and reducing traffic congestions.The CTP query is Max SNP-hard. To compute the query efficiently, we develop two algorithms, including an exact algorithm and anapproximation algorithm. The exact algorithm is capable finding the optimal result for small values of k (e.g., k = 2) in interactive time,while the approximation algorithm, which has a 5-approximation ratio, is suitable for other situations. The performance of the CTP queryis studied experimentally with real and synthetic spatial data.