Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
type: Item
instance of: scholarly article
title: Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
zbMATH Open document ID: 1380.90046
author: Sandra Huber
author: Martin Josef Geiger
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6835141
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: VeRoLog solver challenge
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: order of neighborhood operators
zbMATH Keywords: parallel heuristic
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.046
OpenAlex ID: W2613474978
cites work: An adaptive large neighborhood search for a vehicle routing problem with multiple routes
cites work: A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
cites work: An iterated local search algorithm for the vehicle routing problem with backhauls
cites work: Truck and trailer routing -- problems, heuristics and computational experience
cites work: On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: First vs. best improvement: an empirical study
cites work: Handbook of metaheuristics
cites work: Variable neighbourhood search: methods and applications
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Solving the truck and trailer routing problem based on a simulated annealing heuristic
cites work: Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
cites work: Variable neighborhood search
cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
cites work: Parallel Variable Neighborhood Search
cites work: Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
cites work: A tabu search heuristic for the truck and trailer routing problem
cites work: An iterated local search heuristic for the split delivery vehicle routing problem
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: The \(k\)-dissimilar vehicle routing problem
cites work: A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
cites work: A general variable neighborhood search for the swap-body vehicle routing problem
cites work: A matheuristic for the truck and trailer routing problem
DOI: 10.1016/J.EJOR.2017.04.046
Recommended article: A general variable neighborhood search for the swap-body vehicle routing problem
Recommended article: Variable neighborhood search strategies for the order batching problem
Recommended article: Variable neighborhood search for the stochastic and dynamic vehicle routing problem
Recommended article: A variable neighborhood search algorithm for the capacitated vehicle routing problem
Recommended article: A variable neighbourhood search algorithm for the open vehicle routing problem
Recommended article: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Recommended article: A relax-and-repair heuristic for the swap-body vehicle routing problem
Recommended article: A cluster-first route-second approach for the swap body vehicle routing problem
description: scientific article; zbMATH DE number 6835141