Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i> -traveling repairmen problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits / rank
 
Normal rank
Property / cites work
 
Property / cites work: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electric fleet size and mix vehicle routing problem with time windows and recharging stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: Methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for solving the multi-vehicle covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer linear programming for a multi-attribute technician routing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman 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: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows / rank
 
Normal rank

Revision as of 14:28, 24 July 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem
scientific article

    Statements

    Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2021
    0 references
    R-\(k\)-TRP
    0 references
    multiple time windows
    0 references
    inventory
    0 references
    GVNS
    0 references
    adaptive memory
    0 references

    Identifiers