Abstract
Scheduling and routing processes are indispensable while planning most of the business operations. These processes that can help to improve each other’s efficiency are generally treated separately. This paper brings workforce scheduling and vehicle routing problems together in a way that has never been done before and consequently vehicle routing problem in the presence of shift assignment (VRP_SA) is introduced to the literature. After building the mathematical model of the problem it is verified on a solver and then real large-sized instances taken from a company are solved using a set of evolutionary algorithms. Three novel solution techniques are introduced based on our framework called dynamic neighbour generation. As one of the contributions of this study, dynamic neighbour generation framework may easily be extended to include other multi objective optimization algorithms to increase their exploration capability, and thus it offers an alternative development facility for solving multi objective optimization problems. Results of computational experiments show that the proposed framework definitely offers promising and robust results in large sized problem instances in terms of hypervolume and inverted generational distance indicators.
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.
