Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-010-9153-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973751736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP / 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 fast and effective heuristic for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time-dependent orienteering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the undirected selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orienteering Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum directed 1-subtree relaxation for score orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2956989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effective application of a new approach to the generalized orienteering 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 path relinking approach for the team orienteering problem / 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: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search metaheuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Genetic Algorithm to Solve the Generalized Orienteering Problem / rank
 
Normal rank

Latest revision as of 04:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
scientific article

    Statements

    Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    8 May 2012
    0 references
    0 references
    team orienteering problem
    0 references
    time windows
    0 references
    GRASP
    0 references
    ELS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references