Abstract
The purpose of this chapter is to highlight the use of computational intelligence algorithms for solving a special class of combinatorial optimization problems in transportation science called routing problems. Classical routing problems, such as the Traveling Salesman Problem and the Vehicle Routing Problem, as well as highly relevant extensions of classical routing problems like Vehicle Routing Problem with Time Windows and Inventory Routing Problem have received a great deal of attention from academics, consultants and practitioners in the field of Supply Chain Management. The contribution of this study is fourfold: (i) it provides a comprehensive review of various solution algorithms that have been proposed in literature as possible solutions to many of the complex issues surrounding routing problem management, (ii) it presents formulation schemes related to basic routing problems and their extensions, (iii) it promotes the use of selected computational algorithms called meta-heuristics and sim-heuristics by providing various graphical presentation formats so as to simplify complicated issues and convey meaningful insights into the routing problems and (iv) it points out interesting research directions for further development in routing problems.
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.
