Maximizing the number of rides served for time-limited Dial-a-Ride*-Reference-Cited by-同舟云学术

Maximizing the number of rides served for time-limited Dial-a-Ride*

Published:2024-05-23 Issue: Volume: Page:1-21
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Anthony Barbara M.¹^ORCID,Chung Christine²,Das Ananya³^ORCID,Yuen David⁴

Affiliation:

1. Department of Mathematics and Computer Science, Southwestern University, Georgetown, TX, USA

2. Computer Science Department, Connecticut College, New London, CT, USA

3. Computer Science Department, Middlebury College, Middlebury, VT, USA

4. Independent Researcher

Publisher

Informa UK Limited

Link

https://www.tandfonline.com/doi/pdf/10.1080/10556788.2024.2349091

Reference49 articles.

1. B.M. Anthony R. Birnbaum S. Boyd A. Christman C. Chung P. Davis J. Dhimar and D.S. Yuen Maximizing the number of rides served for dial-a-ride in 19th Symposium on Algorithmic Approaches for Transportation Modelling Optimization and Systems (ATMOS 2019) V. Cacchiani and A. Marchetti-Spaccamela eds. Vol. 75 2019 pp. 11:1–11:15.

2. B.M. Anthony A.D. Christman C. Chung and D. Yuen Serving rides of equal importance for time-limited dial-a-ride in Mathematical Optimization Theory and Operations Research P. Pardalos M. Khachay and A. Kazakov eds. Springer International Publishing Cham 2021 pp. 35–50.

3. Improved approximation algorithms for prize-collecting Steiner tree and TSP;Archer A.;SIAM J. Comput.,2011

4. N. Ascheuer S.O. Krumke and J. Rambau Online dial-a-ride problems: Minimizing the completion time in Annual Symposium on Theoretical Aspects of Computer Science Springer 2000 pp. 639–650.

5. Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection;Atsmony M.;J. Sched.,2023