Adaptive large neighborhood search on the graphics processing unit

DOI10.1016/j.ejor.2018.11.035zbMath1430.90560OpenAlexW2901957170WikidataQ128985628 ScholiaQ128985628MaRDI QIDQ1711444

Geir Hasle, Christian Schulz, Lukas Bach

Publication date: 18 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.035

zbMATH Keywords

metaheuristicsdiscrete optimizationALNSVRPGPU-programming

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Related Items

Estimating energy consumption and charging duration of electric vehicle in multigraph ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search

Uses Software

• VRP

Cites Work

• Unnamed Item
• A general heuristic for vehicle routing problems
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Route relaxations on GPU for vehicle routing problems
• Very large-scale vehicle routing: new test problems, algorithms, and results
• A unified solution framework for multi-attribute vehicle routing problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Vehicle Routing
• Solving Real-World Linear Programs: A Decade and More of Progress
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Parallel metaheuristics: recent advances and new trends
• Handbook of metaheuristics