A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
type: Item
instance of: scholarly article
title: A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
zbMATH Open document ID: 1487.90151
author: Ferdinand Mühlbauer
author: Pirmin Fontaine
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354352
zbMATH Keywords: transportation
zbMATH Keywords: city logistics
zbMATH Keywords: 2E-CVRP
zbMATH Keywords: cargo-bicycles
zbMATH Keywords: large neighbourhood search
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.034
OpenAlex ID: W3044549082
cites work: Synchronizing vans and cargo bikes in a city distribution network
cites work: An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
cites work: The electric two-echelon vehicle routing problem
cites work: A large neighbourhood based heuristic for two-echelon routing problems
cites work: Lower and upper bounds for the two-echelon capacitated location-routing problem
cites work: A survey on two-echelon routing problems
cites work: Flexible two-echelon location routing problem
cites work: A survey of variants and extensions of the location-routing problem
cites work: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
cites work: Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
cites work: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
cites work: A comparative study of heuristics for a two-level routing-location problem
cites work: Vehicle routing under time-dependent travel times: the impact of congestion avoidance
cites work: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
cites work: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
cites work: New families of valid inequalities for the two-echelon vehicle routing problem
cites work: A study on the effect of the asymmetry on real capacitated vehicle routing problems
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
cites work: A matheuristic for the truck and trailer routing problem
cites work: A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
DOI: 10.1016/J.EJOR.2020.07.034
description: scientific article; zbMATH DE number 7354352