A biased random-key genetic algorithm for the tree of hubs location problem
DOI10.1007/S11590-016-1082-9zbMATH Open1382.90112OpenAlexW2521839336MaRDI QIDQ1676487FDOQ1676487
Authors: Luciana S. Pessoa, Andréa Cynthia Santos, Mauricio G. C. Resende 
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
Recommendations
- The tree of hubs location problem
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Solving the uncapacitated hub location problem using genetic algorithms
- Multiple allocation tree of hubs location problem for non-complete networks
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Network hub location problems: The state of the art
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Tight bounds from a path based formulation for the tree of hub location problem
- Design of intermodal logistics networks with hub delays
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- Network design for time‐constrained delivery
- GRASP and path relinking for the max-min diversity problem
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Biased random-key genetic algorithms with applications in telecommunications
- A Benders decomposition for hub location problems arising in public transport
- The transfer point location problem
Cited In (8)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Upgrading nodes in tree-shaped hub location
- Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- A random-key GRASP for combinatorial optimization
This page was built for publication: A biased random-key genetic algorithm for the tree of hubs location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676487)
