Abstract The Quota Travelling Salesman Problem with Passengers, Incomplete Ride, and Collection Time is a new version of the Quota Travelling Salesman Problem. In this problem, the salesman uses a flexible ridesharing system to minimize travel costs while visiting some vertices to satisfy a pre-established quota. We consider operational constraints regarding vehicle capacity, travel time, passenger limitations, and penalties for rides that do not meet passenger requirements. We present a mathematical formulation and heuristics based on Ant Colony Optimization.

中文翻译：

---

基于蚂蚁算法的乘客配额旅行商问题、不完全乘车和取车时间优化

摘要 带有乘客、不完全行程和收集时间的配额旅行商问题是配额旅行商问题的新版本。在这个问题中，销售员使用灵活的拼车系统来最小化旅行成本，同时访问一些顶点以满足预先设定的配额。我们考虑了有关车辆容量、旅行时间、乘客限制以及不满足乘客要求的乘车处罚的运营限制。我们提出了基于蚁群优化的数学公式和启发式方法。