Jang-Jei Jaw's research while affiliated with Massachusetts Institute of Technology and other places

Publication (1)

Article
A heuristic algorithm is described for a time-constrained version of the advance-request, multi-vehicle, many-to-many Dial-A-Ride Problem (DARP). The time constraints consist of upper bounds on: (1) the amount of time by which the pick-up or delivery of a customer can deviate from the desired pick-up or delivery time; (2) the time that a customer c...

Citations

... A first attempt to consider real-time requests can be found in Jaw et al. (1986), where a sequential insertion procedure is used to handle new demands. After that work, DVRP starts to gain ground and many variants were studied. ...