Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation

DOI10.1016/j.cor.2023.106252OpenAlexW4372227703MaRDI QIDQ6106564

Fabricio Alves Oliveira, Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza, Elisangela Martins de Sá

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106252

zbMATH Keywords

metaheuristicsprofit maximizationvariable neighborhood descentmultiple allocationiterated local searchhub network design problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for the hub location and routing problem
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• Heuristics for the capacitated modular hub location problem
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Variable neighborhood search: basics and variants
• HUBBI: iterative network design for incomplete hub location problems
• Enumeration and search procedures for a hub location problem with economies of scale
• Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
• Alternate solution approaches for competitive hub location problems
• Perspectives on modeling hub location problems
• Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
• A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
• A single allocation hub location and pricing problem
• A competitive hub location and pricing problem
• Network hub location problems: The state of the art
• A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• A hub covering network design problem for cargo applications in Turkey
• Remarks on Zeros and Ties in the Wilcoxon Signed Rank Procedures
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A co-opetitive framework for the hub location problems in transportation networks
• An analysis of variance test for normality (complete samples)

This page was built for publication: Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation