Abstract
The paper is concerned with the Workforce Scheduling and Routing Problem where certain service providers complete tasks at different locations. The presented optimisation procedure is an amalgamation of the iterated local search and Lagrangian relaxation. This optimisation procedure has been tested on benchmark problems from the literature, and showed superior performance in comparison with a previously published implementation of the iterated local search.
Published Version
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.
