The multi-district team orienteering problem

This paper introduces the multi-district team orienteering problem. In this problem, one must schedule a set of mandatory and optional tasks located in several districts, within a planning horizon. The total available time determined by the length of the planning horizon must be distributed among th...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2014-01, Vol.41, p.76-82
Hauptverfasser:	Angélica Salazar-Aguilar, M., Langevin, André, Laporte, Gilbert
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive large neighborhood search Algorithms Applied sciences Computational efficiency Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Incompatibility Integer programming Logistics Mathematical problems Mixed integer Node routing Operational research and scientific management Operational research. Management science Operations planning Operations research Orienteering Production planning Schedules Scheduling, sequencing Studies Tasks Tasks scheduling Team orienteering problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!