Text this: An adaptive large neighborhood search heuristic for the flying sidekick traveling salesman problem with multiple drops

 _    _     ______   __   _    __   __    _____   
| \  / ||  /_   _// | || | ||  \ \\/ //  |__  //  
|  \/  ||   -| ||-  | '--' ||   \ ` //     / //   
| .  . ||   _| ||_  | .--. ||    | ||     / //__  
|_|\/|_||  /_____// |_|| |_||    |_||    /_____|| 
`-`  `-`   `-----`  `-`  `-`     `-`'    `-----`