Recently, road trips have become increasingly popular. However, route planning for road trips has remained an open field of research. Existing approaches ignore the negative effects of conflicting preferences among members of tourist group, making the plan difficult to satisfy all members. This paper proposes a novel approach to route planning of road trips, namely RPG-RBC. RPG-RBC innovatively utilizes the non-compensatory group decision-making algorithm ELECTRE-III to model the preferences of tourist group. It first calculates the individual preferences of each tourist for point-of-interests and then aggregates them to obtain the overall preferences. Essentially the road trip route planning can be conceived as an RBC problem, and the environments-classes, agents, roles, groups, and objects (ECARGO) model is applied to formalize this problem. The relevant constraints are identified and the CPLEX optimization package is used to solve the problem. Finally, the effectiveness of RPG-RBC is verified through a case study and simulation experiments.
Ma et al. (Fri,) studied this question.