An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114184285 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212550642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search approach for multiple traveling repairman problem with profits / 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: 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: Heuristics for the traveling repairman problem with profits / 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 hybrid adaptive large neighborhood search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary search for the traveling repairman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the traveling repairman problem with profits: a novel variable neighborhood search approach / 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: The Vehicle Routing Problem with Time Windows Part II: Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem / 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: Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:57, 30 July 2024

scientific article
Language Label Description Also known as
English
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
scientific article

    Statements

    An effective hybrid search algorithm for the multiple traveling repairman problem with profits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 September 2022
    0 references
    combinatorial optimization
    0 references
    multiple traveling repairman problem with profits
    0 references
    arc-based crossover
    0 references
    variable neighborhood search
    0 references
    heuristics
    0 references

    Identifiers