MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant system algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with a new local search scheme for vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering search algorithm for the capacitated centered clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-smooth optimization model for a two-tiered supply chain network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-smooth model for signalized road network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to vehicle routing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing fuel emissions by optimizing speed on shipping routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ALGACEA‐1 method for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search algorithms for the handicapped persons transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem with flexible time windows and traveling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation Decision Making / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-one mixed integer programming problems using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems / 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: Q4656774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended ant colony optimization for non-convex mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of simulated annealing as a tool for single and multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: BoneRoute: An adaptive memory-based method for effective fleet management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic approach for non-convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search in Complex Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank

Latest revision as of 10:03, 6 July 2024

scientific article
Language Label Description Also known as
English
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
scientific article

    Statements

    MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    randomized algorithms
    0 references
    combinatorial optimization
    0 references
    vehicle routing problem
    0 references
    biased random search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references