Abstract
In this work we propose a simulated annealing based search algorithm for optimal ramified or branched transportation route in [Formula: see text]. The cost function of the transport network allows the system to merge small roads into larger highways, carry the goods together and separate them near the destination. As a result the transportation route has multiple branching-in and -out points, to some extent similar to nerve system of the tree leaf. The problem is known to be NP-complete even for finite set of branching points and metric spaces.
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 callMore From: International Journal on Artificial Intelligence Tools
Disclaimer: 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.
