Abstract
ABSTRACT This paper modifies the definition of the traditional vehicle routing problems with backhaul (VRPB) and presents a simulated annealing-based heuristic algorithm. Computational results demonstrate that the proposed algorithm not only has the capability of handling situations encountered in practice, but also consumes less transportation costs the traditional algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of the Chinese Institute of Industrial Engineers
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.