A conceptually simple algorithm for the capacitated location-routing problem

DOI10.1016/J.EJCO.2023.100063MaRDI QIDQ6491328zbMATH OpenFDO

Authors Enrico Bartolini, Michael Schneider

Publication date 24 April 2024

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2023.100063

zbMATH Keywords

depot configuration refinementlocationlocation routingroutingsimple heuristic

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A biased-randomized metaheuristic for the capacitated location routing problem
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• Two-stage heuristic algorithm for the large-scale capacitated location routing problem

Cites work

• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• 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 survey on two-echelon routing problems
• 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
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• Combined location-routing problems: A synthesis and future research directions
• Knowledge-guided local search for the vehicle routing problem
• Location-routing: issues, models and methods
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
• The effect of ignoring routes when locating depots
• Variable neighborhood search

Cited in

(1)

• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems

This page was built for publication: A conceptually simple algorithm for the capacitated location-routing problem

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