Abstract
A rolling horizon framework for the dynamic assignment and sequencing of trucks to jobs consisting of picking up and delivering full truckloads when requests for service arise on a continuous basis. A mathematical formulation of the problem faced at each stage is presented; its solution allows for the dynamic reassignment of trucks to loads. Loads have associated time windows for pickup and delivery, and the objective function includes explicit penalty cost for not serving a particular load. A solution algorithm is presented and implemented, and computational results are presented.
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.
