A tabu search algorithm for the single vehicle routing allocation problem
From MaRDI portal
Publication:3512571
DOI10.1057/palgrave.jors.2602165zbMath1211.90319OpenAlexW1976155842MaRDI QIDQ3512571
C. A. Poojari, Lothar Vogt, John E. Beasley
Publication date: 21 July 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602165
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (10)
The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ Variable neighbourhood search: methods and applications ⋮ On Euclidean vehicle routing with allocation ⋮ Strong Coalitional Structure in an Open Vehicle Routing Game ⋮ The Generalized Covering Salesman Problem ⋮ Variable neighbourhood search: Methods and applications ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak ⋮ Spatial coverage in routing and path planning problems
Uses Software
This page was built for publication: A tabu search algorithm for the single vehicle routing allocation problem
