Optimization Online


The cooperative orienteering problem with time windows

Martijn Van der Merwe (martijn.vandermerwe***at***rmit.edu.au)
James P Minas (james.minas***at***rmit.edu.au)
Melih Ozlen (melih.ozlen***at***rmit.edu.au)
John W Hearne (john.hearne***at***rmit.edu.au)

Abstract: In this we paper we define a new class of the team orienteering problem; the cooperative orienteering problem with time windows (COPTW). The COPTW is a generalisation of the TOPTW, which requires multiple vehicles to cooperatively collect the reward from a location. The COPTW is demonstrated with the aid of a wildfire scenario in South Hobart, Tasmania Australia. Computational testing suggests that it is feasible to apply the COPTW to realistic problems.

Keywords: Team orienteering problem; Time windows; Integer Programming; Wildfire

Category 1: Applications -- OR and Management Sciences (Transportation )


Download: [PDF]

Entry Submitted: 04/14/2014
Entry Accepted: 04/15/2014
Entry Last Modified: 06/29/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society