Abstract
Besides solving the continuous optimization problems, this chapter introduces the evolutionary multitasking algorithm for solving the complex combinatorial optimization problems. In particular, in this chapter, we first present a generalized variant of vehicle routing problem with occasional drivers, i.e., Vehicle Routing Problem with Heterogeneous capacity, Time window and Occasional driver (VRPHTO), which is inspired by today’s “crowdshipping” and “sharing economy” in vehicle routing. Next, to further conceptualize the cloud-based optimization service that is capable of catering to multiple VRPHTOs requests at the same time, we present an evolutionary multitasking algorithm (EMA) to optimize multiple VRPHTOs simultaneously.
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.
