Evaluating the importance of randomization in adaptive large neighborhood search

DOI10.1111/itor.12273zbMath1371.90142OpenAlexW2296197542MaRDI QIDQ5364062

Lars Magnus Hvattum, Ahmad Hemmati

Publication date: 2 October 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12273

zbMATH Keywords

statistical analysismaritime transportationrouting and scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A survey of adaptive large neighborhood search algorithms and applications ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ The electric vehicle routing problem with shared charging stations ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances

This page was built for publication: Evaluating the importance of randomization in adaptive large neighborhood search