Abstract
This paper deals with the dynamic vehicle allocation problem (DVAP) in road transportation of full truckloads between terminals. The DVAP involves multi-period resource allocation and consists of defining the “movements” of a fleet of vehicles that transport goods between terminals with a wide geographical distribution. These movements may be of fully laden vehicles, unladen vehicles for repositioning or vehicles held at a terminal to meet future demands. Emphasis is given to the characterization of the problem in real situations, the mathematical modeling of the problem and the use of exact and heuristic methods to solve it, including GRASP and simulated annealing metaheuristics. Results based on a case study of a transportation company in Brazil are presented and analyzed, showing that the approach can be effective in supporting practical decisions.
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.
