The Biker-hiker problem

There are n travellers who have k bicycles and they wish to complete a journey in the shortest possible time. We investigate optimal solutions of this problem, showing they are characterized by a set of words in the Dyck language. Particular solutions with additional desirable properties are introduced and analysed.