A conceptually simple algorithm for the capacitated location-routing problem
From MaRDI portal
Publication:6491328
DOI10.1016/J.EJCO.2023.100063MaRDI QIDQ6491328
Michael Schneider, Unnamed Author, Enrico Bartolini
Publication date: 24 April 2024
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Cites Work
- A survey of recent research on location-routing problems
- A survey on two-echelon routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Location-routing: issues, models and methods
- 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
- The effect of ignoring routes when locating depots
- Combined location-routing problems: A synthesis and future research directions
- Variable neighborhood search
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A survey of the standard location-routing problem
- Knowledge-guided local search for the vehicle routing problem
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- 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
This page was built for publication: A conceptually simple algorithm for the capacitated location-routing problem
