A progressive filtering heuristic for the location-routing problem and variants

DOI10.1016/J.COR.2020.105166MaRDI QIDQ2668599zbMATH OpenOpenAlexFDO

Authors Florian Arnold, K. Sörensen

Publication date 7 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105166

zbMATH Keywords

heuristicslarge-scale problemlocal searchlocation routing problemvehicle routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A survey of recent research on location-routing problems
• Heuristic solutions to multi-depot location-routing problems
• An exact method for the capacitated location-routing problem
• A biased-randomized metaheuristic for the capacitated location routing problem
• scientific article; zbMATH DE number 1264401

Cites work

• A concise guide to existing and emerging vehicle routing problem variants
• A large neighbourhood based heuristic for two-echelon routing problems
• A survey of recent research on location-routing problems
• A survey of the standard location-routing problem
• A survey of variants and extensions of the location-routing problem
• A taxonomical analysis, current methods and objectives on location-routing problems
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• A variable neighborhood search approach for the two-echelon location-routing problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Efficiently solving very large-scale routing problems
• Guided Local Search
• How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs?
• Knowledge-guided local search for the vehicle routing problem
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• New benchmark instances for the capacitated vehicle routing problem
• Scikit-learn: machine learning in Python
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The effect of ignoring routes when locating depots
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• Two-stage heuristic algorithm for the large-scale capacitated location routing problem
• Using clustering analysis in a capacitated location-routing problem

Cited in

(5)

• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
• A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
• Enhanced approximation algorithms for the capacitated location routing problem
• Recent developments in location-routing problems. Deterministic multi-period, multi-echelon, and multi-objective problems

Describes a project that uses

Uses Software

• R
• CPU Benchmarks
• Scikit

This page was built for publication: A progressive filtering heuristic for the location-routing problem and variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668599)