This work introduces the m-VRPTWEOS. It arises in real life applications in ports and mines operations. Each customer may demand different types of vehicles to perform a task collaboratively. Vehicles are allowed to wait at the locations but demanded vehicles must start operating at the same time. The objective is to route the available vehicles in a way that maximizes the (weighted) number of served customers and minimizes the total distance traveled. Models and algorithms are presented. They are implemented on top of BaPCod. Tests are run on classes of proposed benchmark instances.