Abstract
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, we present a heuristic procedure to solve for large size problems. Both route-first-partition-next (RFPN) and partition-first-and-route-next (PFRN) approaches are discussed. Computational results of the developed procedure are also presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
