A fast multi-neighborhood iterated local search algorithm for vehicle routing problem

DOI10.3724/SP.J.1249.2015.02196zbMATH Open1340.90110OpenAlexW2329705855MaRDI QIDQ3460997

Wanfeng Liu, Xia Li

Publication date: 15 January 2016

Published in: Journal of Shenzhen University Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1249.2015.02196

zbMATH Keywords

heuristic algorithmsvehicle routing problemiterated local searchmulti-neighborhood

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Dynamic vehicle routing using an improved variable neighborhood search algorithm ⋮ An iterated local search algorithm for latency vehicle routing problems with multiple depots ⋮ A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ An iterated local search for solving a location-routing problem

This page was built for publication: A fast multi-neighborhood iterated local search algorithm for vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460997)