MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
type: Item
instance of: scholarly article
title: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
zbMATH Open document ID: 1263.90132
author: Angel A. Juan
author: Javier Faulin
author: Albert Ferrer
author: Helena R. Lourenço
author: Barry Barrios
published in: Top
publication date: 2013-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6156819
zbMATH Keywords: randomized algorithms
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: biased random search
zbMATH Keywords: heuristics
describes a project that uses: GRASP
describes a project that uses: BoneRoute
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s11750-011-0245-1
OpenAlex ID: W1986556608
cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
cites work: Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design
cites work: Q4821526
cites work: An improved ant system algorithm for the vehicle routing problem
cites work: Q4247462
cites work: A grasp interactive approach to the vehicle routing problem with backhauls
cites work: GRASP with a new local search scheme for vehicle routing problems with time windows
cites work: Clustering search algorithm for the capacitated centered clustering problem
cites work: A non-smooth optimization model for a two-tiered supply chain network
cites work: A non-smooth model for signalized road network design problems
cites work: A guide to vehicle routing heuristics
cites work: Q3048611
cites work: Q5485948
cites work: A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
cites work: Q4532026
cites work: Reducing fuel emissions by optimizing speed on shipping routes
cites work: The ALGACEA‐1 method for the capacitated vehicle routing problem
cites work: Greedy randomized adaptive search procedures
cites work: GRASP: An annoted bibliography
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: An annotated bibliography of GRASP-Part II: Applications
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: Fast local search algorithms for the handicapped persons transportation problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Q4692508
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: The vehicle routing problem with flexible time windows and traveling times
cites work: Optimization by Simulated Annealing
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: Transportation Decision Making
cites work: A survey for the quadratic assignment problem
cites work: Solving zero-one mixed integer programming problems using tabu search
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
cites work: A general heuristic for vehicle routing problems
cites work: Q4656774
cites work: State-of-the art review-evolutionary algorithms for vehicle routing
cites work: Extended ant colony optimization for non-convex mixed integer nonlinear programming
cites work: A survey of simulated annealing as a tool for single and multiobjective optimization
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: A new heuristic approach for non-convex optimization problems
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: Local Search in Complex Scheduling Problems
cites work: Q5691079
DOI: 10.1007/S11750-011-0245-1
Recommended article: Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
Recommended article: A biased‐randomized metaheuristic for the capacitated location routing problem
Recommended article: An efficient multistart heuristic for the driver and vehicle routing problem
Recommended article: Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
Recommended article: A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
Recommended article: Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges