A biased random-key genetic algorithm for the tree of hubs location problem
From MaRDI portal
Publication:1676487
DOI10.1007/s11590-016-1082-9zbMath1382.90112OpenAlexW2521839336MaRDI QIDQ1676487
Luciana S. Pessoa, Mauricio G. C. Resende, Andréa Cynthia Santos
Publication date: 9 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1082-9
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Upgrading nodes in tree-shaped hub location, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours, Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem, A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
Cites Work
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- Tight bounds from a path based formulation for the tree of hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- The transfer point location problem
- GRASP and path relinking for the max-min diversity problem
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Design of intermodal logistics networks with hub delays
- Biased random-key genetic algorithms with applications in telecommunications
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Network hub location problems: The state of the art
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Network design for time‐constrained delivery
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
