An effective large neighborhood search for the team orienteering problem with time windows
From MaRDI portal
Publication:1691647
DOI10.1007/978-3-319-68496-3_1zbMath1378.90029MaRDI QIDQ1691647
Jan Fabian Ehmke, Verena Schmid
Publication date: 25 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-68496-3_1
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows, A reinforcement learning approach to the orienteering problem with time windows