Team Orienteering with Time-Varying Profit

This paper studies the team orienteering problem, where the arrival time and service time affect the collection of profits. Such interactions result in a nonconcave profit function. This problem integrates the aspect of time scheduling into the routing decision, which can be applied in humanitarian...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	INFORMS journal on computing 2022-01, Vol.34 (1), p.262-280
1. Verfasser:	Yu, Qinxiao
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Benders branch-and-cut Bending machines Evacuations & rescues Heuristic hybrid heuristic Inequalities Mixed integer mixed integer nonconvex programming Nonlinear programming Operations research Optimization Orienteering Profits Rescue operations routing and scheduling Scheduling Search and rescue missions Survival team orienteering Teams Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!