Efficiently solving very large-scale routing problems
type: Item
instance of: scholarly article
title: Efficiently solving very large-scale routing problems
zbMATH Open document ID: 1458.90055
author: Florian Arnold
author: Michel Gendreau
author: K. Sörensen
published in: Computers \& Operations Research
publication date: 2019-04-18T00:00:00Z
full work available at URL: https://hdl.handle.net/10067/1602270151162165141
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7046199
zbMATH Keywords: vehicle routing problems
zbMATH Keywords: heuristics
zbMATH Keywords: local search
zbMATH Keywords: large-scale problems
describes a project that uses: LKH
describes a project that uses: CPU Benchmarks
describes a project that uses: VRP
describes a project that uses: TSPLIB
MaRDI profile type: Publication
OpenAlex ID: W2921712036
cites work: Chained Lin-Kernighan for large traveling salesman problems
cites work: Knowledge-guided local search for the vehicle routing problem
cites work: Q5687196
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: Q4955265
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Sequential search and its application to vehicle-routing problems
cites work: Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
cites work: How easy is local search?
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: What you should know about the vehicle routing problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: Vehicle Routing
cites work: New benchmark instances for the capacitated vehicle routing problem
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: Guided Local Search
Wikidata QID: Q128297900
DOI: 10.1016/J.COR.2019.03.006
description: scientific article; zbMATH DE number 7046199