A real‐life situation in which a trucker has to collect a cargo of similar size from n different customers spread out in a given region and to deliver them to n locations spread out in another far‐away region has been formulated as a route‐design problem for a single vehicle. The minimal total time of loading, shipping and unloading is considered for different reshuffling methods, and the optimal method is determined. A solution procedure by enumeration is suggested to solve an actual small size problem, and an illustration is provided.
Optimal routing of a single vehicle with loading and unloading constraints
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.