A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
DOI10.1007/s00291-023-00718-yzbMath1521.90105MaRDI QIDQ6073277
Caio César De Freitas, Matheus da Silva Menezes, Dario José Aloise, Fábio Francisco Da Costa Fontes, Andréa Cynthia Santos
Publication date: 15 September 2023
Published in: OR Spectrum (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- On the minimization of traffic congestion in road networks with tolls
- Location-routing: issues, models and methods
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A quadratic integer program for the location of interacting hub facilities
- The many-to-many location-routing problem
- A biased random-key genetic algorithm for the tree of hubs location problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Design of intermodal logistics networks with hub delays
- Network hub location problems: The state of the art
- Selecting an Optimum Configuration of One-Way and Two-Way Routes
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
