A biased random-key genetic algorithm for the tree of hubs location problem

DOI10.1007/S11590-016-1082-9MaRDI QIDQ1676487zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

genetic algorithmlogisticsnetwork designrandom keytree hub problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

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

Cites work

• A Benders decomposition for hub location problems arising in public transport
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• A quadratic integer program for the location of interacting hub facilities
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Biased random-key genetic algorithms with applications in telecommunications
• Design of intermodal logistics networks with hub delays
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• GRASP and path relinking for the max-min diversity problem
• Network design for time‐constrained delivery
• Network hub location problems: The state of the art
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The transfer point location problem
• The tree of hubs location problem
• Tight bounds from a path based formulation for the tree of hub 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
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location 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)