Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations

DOI10.1007/s00291-018-0526-2zbMath1411.90050OpenAlexW2884997263MaRDI QIDQ1733092

Mohan Krishnamoorthy, Zühal Kartal, Andreas T. Ernst

Publication date: 20 March 2019

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-018-0526-2

zbMATH Keywords

vehicle routingant colony optimizationhub locationdiscrete particle swarm optimization\(p\)-hub center and routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (5)

Planning and design of intermodal hub networks: a literature review ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Multi-period single-allocation hub location-routing: models and heuristic solutions ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ Perspectives on modeling hub location problems

Cites Work

• Unnamed Item
• A Stackelberg hub arc location model for a competitive environment
• A branch-and-cut algorithm for the hub location and routing problem
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• The many-to-many location-routing problem
• Integer programming formulations of discrete hub location problems
• The hub location and routing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Restructuring of Swiss parcel delivery services
• On the single-assignment \(p\)-hub center problem
• A new formulation and an exact approach for the many-to-many hub location-routing problem
• A new rank based version of the ant system. -- A computational study
• Proprietor and customer costs in the incomplete hub location-routing network topology
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• Network hub location problems: The state of the art
• Iterated local search for the quadratic assignment problem
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• The Latest Arrival Hub Location Problem
• 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
• A hub covering model for cargo delivery systems
• SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

This page was built for publication: Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations