Abstract
Given a transportation network, this paper considers the problem of finding a number of spatially dissimilar paths between an origin and a destination. A number of dissimilar paths can be useful in solving capacitated flow problems or in selecting routes for hazardous materials. A critical discussion of three existing methods for the generation of spatially dissimilar paths is offered, and computational experience using these methods is reported. As an alternative method, the generation of a large set of candidate paths, and the selection of a subset using a dispersion model which maximizes the minimum dissimilarity in the selected subset is proposed. Computational results with this method are encouraging.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
