MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
From MaRDI portal
Publication:1948529
DOI10.1007/s11750-011-0245-1zbMath1263.90132OpenAlexW1986556608MaRDI QIDQ1948529
Helena R. Lourenço, Javier Faulin, Albert Ferrer, Barry Barrios, Angel A. Juan
Publication date: 23 April 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0245-1
heuristicscombinatorial optimizationvehicle routing problemrandomized algorithmsbiased random search
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals ⋮ Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Using horizontal cooperation concepts in integrated routing and facility‐location decisions ⋮ Program trace optimization with constructive heuristics for combinatorial problems ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ Multi-depot vehicle routing problem with time windows under shared depot resources ⋮ A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A survey for the quadratic assignment problem
- The vehicle routing problem with flexible time windows and traveling times
- The \(p\)-median problem: a survey of metaheuristic approaches
- A general heuristic for vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- A new heuristic approach for non-convex optimization problems
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- A non-smooth model for signalized road network design problems
- Clustering search algorithm for the capacitated centered clustering problem
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
- GRASP with a new local search scheme for vehicle routing problems with time windows
- Solving zero-one mixed integer programming problems using tabu search
- Greedy randomized adaptive search procedures
- An improved ant system algorithm for the vehicle routing problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- A non-smooth optimization model for a two-tiered supply chain network
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Fast local search algorithms for the handicapped persons transportation problem
- Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
- State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
- An annotated bibliography of GRASP-Part II: Applications
- A survey of simulated annealing as a tool for single and multiobjective optimization
- Transportation Decision Making
- An annotated bibliography of GRASP – Part I: Algorithms
- The ALGACEA‐1 method for the capacitated vehicle routing problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A GRASP for the Vehicle Routing Problem with Time Windows
- Reducing fuel emissions by optimizing speed on shipping routes
- Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Local Search in Complex Scheduling Problems
This page was built for publication: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
