A memetic algorithm for the team orienteering problem
A memetic algorithm for the team orienteering problem
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer-Verlag
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer-Verlag
Subjects
More information
Scope and Contents
Contents
The team orienteering problem (TOP) is a generalization of the orienteering problem. A limited number of vehicles is available to visit customers from a potential set. Each vehicle has a predefined running-time limit, and each customer has a fixed associated profit. The aim of the TOP is to maximize the total collected profit. In this paper we prop...
Alternative Titles
Full title
A memetic algorithm for the team orienteering problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_00453370v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_00453370v1
Other Identifiers
ISSN
1619-4500
E-ISSN
1614-2411
DOI
10.1007/s10288-008-0094-4
