✦ LIBER ✦

The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search

✍ Scribed by Nacima Labadie; Renata Mansini; Jan Melechovský; Roberto Wolfler Calvo

Book ID: 113584030
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 270 KB
Volume: 220
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.01.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative three-component heuristic f

An iterative three-component heuristic for the team orienteering problem with time windows

✍ Hu, Qian; Lim, Andrew 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 491 KB

A hybrid variable neighborhood tabu sear

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

✍ Belhaiza, Slim; Hansen, Pierre; Laporte, Gilbert 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A New Variable Neighborhood Search Algor

A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows

✍ Yingcheng Xu; Li Wang; Yuexiang Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 236 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 7933 || Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows

✍ Bonifaci, Vincenzo; Demetrescu, Camil; Marchetti-Spaccamela, Alberto 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 184 KB

A branch-and-price-based large neighborh

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr

[Lecture Notes in Computer Science] Hybr

[Lecture Notes in Computer Science] Hybrid Metaheuristics Volume 5818 || Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

✍ Blesa, María J.; Blum, Christian; Di Gaspero, Luca; Roli, Andrea; Sampels, Micha 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 242 KB