A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustered orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic for the team orienteering arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the orienteering arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the Team Orienteering Problem / 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: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective PSO-inspired algorithm for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the team orienteering problem with cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage approach to the orienteering problem with stochastic weights / 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: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic exact solver for Vehicle Routing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Team Orienteering Problem: Formulations and Branch-Cut and Price / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Petal Heuristic for the Vehicle Routeing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / 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: Q3785827 / 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: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified solution framework for multi-attribute vehicle routing problems / rank
 
Normal rank

Latest revision as of 01:34, 25 July 2024

scientific article
Language Label Description Also known as
English
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
scientific article

    Statements

    A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (English)
    0 references
    0 references
    0 references
    0 references
    20 April 2021
    0 references
    0 references
    team orienteering problem
    0 references
    adaptive large neighborhood search
    0 references
    hybrid heuristic
    0 references
    homogeneous fleet
    0 references
    vehicle routing problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references