Article ID: | iaor19951675 |
Country: | United Kingdom |
Volume: | 22 |
Issue: | 5 |
Start Page Number: | 465 |
End Page Number: | 478 |
Publication Date: | May 1995 |
Journal: | Computers and Operations Research |
Authors: | Pandit Ram, Muralidharan B. |
Keywords: | heuristics |
This study addresses the problem of routing vehicles over the specified segments of a mixed network. The routing problem is modeled as a Capacitated General Routing Problem (CGRP). The solution to the problem is a set of routes for the vehicles which are consistent with the capacity and work-hours constraints. For the CGRP, the authors present a heuristic procedure to solve for large size problems. Both route-first-partition-next and partition-first-and-route-next approaches are discussed. Computational results of the developed procedure are also presented.