A memetic algorithm for the team orienteering problem (Q972625): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for team orienteering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank

Latest revision as of 21:03, 2 July 2024

scientific article
Language Label Description Also known as
English
A memetic algorithm for the team orienteering problem
scientific article

    Statements

    A memetic algorithm for the team orienteering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    selective vehicle routing problem
    0 references
    optimal split
    0 references
    metaheuristic
    0 references
    destruction/construction
    0 references
    0 references