OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATINS WITH DESIRED DELIVERY TIMES: II. ROUTING.

This is the second part of a two-part study treating the single vehicle many-to-many pickup and delivery problem with desired delivery times. This part focuses on the routing subproblem, presenting a heuristic algorithm for finding an initial route and a second heuristic algorithm for improving the route sequence. It then integrates the routing and scheduling algorithms, and describes the results of a number of computational experiments on actual data. An example of the complete routing and scheduling algorithm appears as an appendix.