Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Mechanical Engineering

PDF

University of New Haven

Series

2017

Team orienteering problem; Time windows

Articles 1 - 1 of 1

Full-Text Articles in Engineering

A Constraint Programming Approach For The Team Orienteering Problem With Time Windows, Ridvan Gedik, Emre Kirac, Ashlea Bennet Milburn, Chase Rainwater May 2017

A Constraint Programming Approach For The Team Orienteering Problem With Time Windows, Ridvan Gedik, Emre Kirac, Ashlea Bennet Milburn, Chase Rainwater

Mechanical and Industrial Engineering Faculty Publications

The team orienteering problem with time windows (TOPTW) is a NP-hard combinatorial optimization problem. It has many real-world applications, for example, routing technicians and disaster relief routing. In the TOPTW, a set of locations is given. For each, the profit, service time and time window are known. A fleet of homogenous vehicles are available for visiting locations and collecting their associated profits. Each vehicle is constrained by a maximum tour duration. The problem is to plan a set of vehicle routes that begin and end at a depot, visit each location no more than once by incorporating time window constraints. …