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

DOI10.3724/SP.J.1249.2015.02196MaRDI QIDQ3460997zbMATH OpenOpenAlexFDO

Authors 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 algorithmsiterated local searchmulti-neighborhoodvehicle routing problem

Mathematics Subject Classification ID

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

Recommendations

• An integer linear programming local search for capacitated vehicle routing problems
• A variable neighborhood search algorithm for the capacitated vehicle routing problem
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• scientific article; zbMATH DE number 1766758
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Cited in

(6)

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

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

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