Abstract: A scheduling algorithm for the time‐window‐based, many‐to‐many, dial‐a‐ride problem is presented. The algorithm is based on two steps: developing the initial route and inserting leftover trips. These two steps are applied ...