𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Path Relinking approach for the Team Orienteering Problem

✍ Scribed by Wouter Souffriau; Pieter Vansteenwegen; Greet Vanden Berghe; Dirk Van Oudheusden

Book ID
108105940
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
162 KB
Volume
37
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The team orienteering problem
The team orienteering problem
✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 629 KB
Path relinking approach for multiple all
Path relinking approach for multiple allocation hub maximal covering problem
✍ Bo Qu; Kerui Weng πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 313 KB

We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering a serviced O-D flow was required to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate p hubs to maximize the serviced flows? By