The maximum collection problem with time‐dependent rewards

E. Erkut and J. Zhang

Naval Research Logistics (NRL), 1996, vol. 43, issue 5, 749-763

Abstract: We consider a routing problem where the objective is to maximize the sum of the rewards collected at the nodes visited. Node rewards are decreasing linear functions of time. Time is spent when traveling between pairs of nodes, and while visiting the nodes. We propose a penalty‐based greedy (heuristic) algorithm and a branch‐and‐bound (optimal) algorithm for this problem. The heuristic is very effective in obtaining good solutions. We can solve problems with up to 20 nodes optimally on a microcomputer using the branch‐and‐bound algorithm. We report our computational experience with this problem. © 1996 John Wiley & Sons, Inc.

Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199608)43:53.0.CO;2-J

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:43:y:1996:i:5:p:749-763

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().