Large multiple neighborhood search for the clustered vehicle-routing problem
type: Item
instance of: scholarly article
title: Large multiple neighborhood search for the clustered vehicle-routing problem
zbMATH Open document ID: 1403.90123
author: Timo Hintsch
author: Stefan Irnich
published in: European Journal of Operational Research
publication date: 2018-05-31T00:00:00Z
full work available at URL: Discussion Paper 1701.pdf
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6877273
zbMATH Keywords: vehicle routing
zbMATH Keywords: clustered vehicle routing
zbMATH Keywords: large neighborhood search
MaRDI profile type: Publication
OpenAlex ID: W2597991082
cites work: New classes of efficiently solvable generalized traveling salesman problems
cites work: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
cites work: Exact Algorithms for the Clustered Vehicle Routing Problem
cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
cites work: The Shortest Hamiltonian Chain of a Graph
cites work: A fast two-level variable neighborhood search for the clustered vehicle routing problem
cites work: On a Monotonicity Problem in Step-Down Multiple Test Procedures
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Fast local search algorithms for the handicapped persons transportation problem
cites work: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
cites work: Q4955265
cites work: Variable neighborhood search: Principles and applications
cites work: Approximations of the critical region of the fbietkan statistic
cites work: Solution of real-world postman problems
cites work: Q4461912
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A general heuristic for vehicle routing problems
cites work: Handbook of metaheuristics
cites work: New mathematical models of the generalized vehicle routing problem and extensions
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: Record breaking optimization results using the ruin and recreate principle
cites work: Modified Sequentially Rejective Multiple Test Procedures
cites work: Implementation of a linear time algorithm for certain generalized traveling salesman problems
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: Hybrid metaheuristics for the clustered vehicle routing problem
cites work: Corrigendum to: ``Hybrid metaheuristics for the clustered vehicle routing problem''
Wikidata QID: Q130152488
DOI: 10.1016/J.EJOR.2018.02.056
description: scientific article; zbMATH DE number 6877273