A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows
- Hendrik Schaap,
Hendrik Schaap
[email protected]Chair of Operations Management, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany;
- Maximilian Schiffer ,
Maximilian Schiffer
[email protected]https://orcid.org/0000-0003-2682-4975
School of Management & Munich Data Science Institute, Technical University of Munich, 80333 Munich, Germany;
- Michael Schneider,
Michael Schneider
[email protected]Deutsche Post Chair – Optimization of Distribution Networks, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany
- Grit Walther
Grit Walther
[email protected]Chair of Operations Management, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany;
Hendrik Schaap
[email protected]Chair of Operations Management, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany;
Maximilian Schiffer
[email protected]https://orcid.org/0000-0003-2682-4975
School of Management & Munich Data Science Institute, Technical University of Munich, 80333 Munich, Germany;
Michael Schneider
[email protected]Deutsche Post Chair – Optimization of Distribution Networks, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany
Grit Walther
[email protected]Chair of Operations Management, School of Business and Economics, RWTH Aachen University, 52072 Aachen, Germany;
