Meet-and-go
George Tsatsanifos, Alexandr Petcovici, Mário A. Nascimento · 2015
Consider the problem of a group of friends who want to depart from their current locations (e.g., workplaces) towards a common destination (e.g., a restaurant) but also want to meet at a single intermediary point before continuing traveling together from there. The goal is to minimize an aggregate perceived travel cost by taking advantage of companionship, e.g., a pre-defined mutual affinity factor, motivated by the common impression that "time flies when in good company". This is an instance of what we name as the Optimal Single Connecting Point (OSCP) query. In this paper we present Meet-and-Go, a prototype application with a simple interface for solving instances of the (top) k-OSCP query, thus allowing the user to also explore alternative solutions as well.