Efficient local search on the GPU—Investigations on the vehicle routing problem
Open Access
- 1 January 2013
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 73 (1) , 14-31
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- NEIGHBORHOOD STRUCTURES FOR GPU-BASED LOCAL SEARCH ALGORITHMSParallel Processing Letters, 2010
- State-of-the-art in Heterogeneous ComputingScientific Programming, 2010
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based MetaheuristicsINFORMS Journal on Computing, 2008
- Active-guided evolution strategies for large-scale capacitated vehicle routing problemsComputers & Operations Research, 2007
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problemsComputers & Operations Research, 2007
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- Industrial Vehicle Routing2007
- Resource extension functions: properties, inversion, and generalization to segmentsOR Spectrum, 2007
- Solving Real-World Linear Programs: A Decade and More of ProgressOperations Research, 2002