On the public citation graph
Heuristics for a hub location‐routing problem
0 signed · 117 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.10081openalex-snapshot
Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search
inferredcites →https://doi.org/10.1002/net.10086openalex-snapshot
Some recent contributions to routing and location problems
inferredcites →https://doi.org/10.1002/net.20128openalex-snapshot
Solution methods for the p‐median problem: An annotated bibliography
inferredcites →https://doi.org/10.1002/net.20193openalex-snapshot
Solving the hub location problem in a star–star network
inferredcites →https://doi.org/10.1007/978-3-642-02538-9_13openalex-snapshot
F-Race and Iterated F-Race: An Overview
inferredcites →https://doi.org/10.1007/978-3-642-29124-1_2openalex-snapshot
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
inferredcites →https://doi.org/10.1007/978-3-662-43871-8_58openalex-snapshot
Solving a Variant of the Hub Location-Routing Problem
inferredcites →https://doi.org/10.1007/bf02564791openalex-snapshot
The many-to-many location-routing problem
inferredcites →https://doi.org/10.1007/s002910050106openalex-snapshot
Restructuring of Swiss parcel delivery services
inferredcites →https://doi.org/10.1007/s10107-003-0481-8openalex-snapshot
A new branch-and-cut algorithm for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s101070100263openalex-snapshot
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1007/s10479-009-0657-6openalex-snapshot
Variable neighbourhood search: methods and applications
inferredcites →https://doi.org/10.1007/s10479-010-0705-2openalex-snapshot
Hubbing and routing in postal delivery systems
inferredcites →https://doi.org/10.1007/s10732-010-9143-1openalex-snapshot
Biased random-key genetic algorithms for combinatorial optimization
inferredcites →https://doi.org/10.1007/s10878-009-9282-1openalex-snapshot
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
inferredcites →https://doi.org/10.1007/s11590-011-0285-3openalex-snapshot
A biased random-key genetic algorithm for the Steiner triple covering problem
inferredcites →https://doi.org/10.1016/0167-6377(92)90028-2openalex-snapshot
Large-step markov chains for the TSP incorporating local search heuristics
inferredcites →https://doi.org/10.1016/0305-0548(95)00060-7openalex-snapshot
Application of a hybrid genetic algorithm to airline crew scheduling
inferredcites →https://doi.org/10.1016/0377-2217(90)90018-7openalex-snapshot
On “a quadratic integer program for the location of interacting hub facilities”
inferredcites →https://doi.org/10.1016/0965-8564(93)90012-aopenalex-snapshot
The hub network design problem with stopovers and feeders: The case of Federal Express
inferredcites →https://doi.org/10.1016/j.apm.2011.09.063openalex-snapshot
The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network
inferredcites →https://doi.org/10.1016/j.apm.2013.02.035openalex-snapshot
A new formulation and an exact approach for the many-to-many hub location-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2007.07.001openalex-snapshot
A random key based genetic algorithm for the resource constrained project scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2008.12.009openalex-snapshot
Tight bounds from a path based formulation for the tree of hub location problem
inferredcites →https://doi.org/10.1016/j.cor.2010.09.019openalex-snapshot
A Branch-and-Cut method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1016/j.cor.2012.02.005openalex-snapshot
Star p-hub center problem and star p-hub median problem with bounded path lengths
inferredcites →https://doi.org/10.1016/j.cor.2012.05.009openalex-snapshot
Variable neighborhood search for location routing
inferredcites →https://doi.org/10.1016/j.cor.2013.04.015openalex-snapshot
Two level General variable neighborhood search for Attractive traveling salesman problem
inferredcites →https://doi.org/10.1016/j.cor.2013.05.011openalex-snapshot
The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation
inferredcites →https://doi.org/10.1016/j.cor.2013.08.010openalex-snapshot
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
inferredcites →https://doi.org/10.1016/j.cor.2014.04.014openalex-snapshot
A branch-and-cut algorithm for the hub location and routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2004.09.057openalex-snapshot
A random-key genetic algorithm for the generalized traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2005.06.074openalex-snapshot
Using clustering analysis in a capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2006.04.004openalex-snapshot
Location-routing: Issues, models and methods
inferredcites →https://doi.org/10.1016/j.ejor.2010.02.022openalex-snapshot
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
inferredcites →https://doi.org/10.1016/j.ejor.2012.01.036openalex-snapshot
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2013.12.021openalex-snapshot
Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
inferredcites →https://doi.org/10.1016/j.entcs.2011.06.003openalex-snapshot
LEMON – an Open Source C++ Graph Template Library
inferredcites →https://doi.org/10.1016/j.ifacol.2015.06.080openalex-snapshot
A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery
inferredcites →https://doi.org/10.1016/j.ijpe.2003.12.002openalex-snapshot
An integrated multi-depot hub-location vehicle routing model for network planning of parcel service
inferredcites →https://doi.org/10.1016/j.knosys.2014.02.014openalex-snapshot
Enhancing variable neighborhood search by adding memory: Application to a real logistic problem
inferredcites →https://doi.org/10.1016/j.omega.2011.09.002openalex-snapshot
The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach
inferredcites →https://doi.org/10.1016/j.omega.2015.04.016openalex-snapshot
An improved MIP heuristic for the intermodal hub location problem
inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-snapshot
Variable neighborhood search
inferredcites →https://doi.org/10.1016/s0377-2217(87)80007-3openalex-snapshot
A quadratic integer program for the location of interacting hub facilities
inferredcites →https://doi.org/10.1016/s0377-2217(97)00172-0openalex-snapshot
Combined location-routing problems: A synthesis and future research directions
inferredcites →https://doi.org/10.1016/s0377-2217(99)00284-2openalex-snapshot
An effective implementation of the Lin–Kernighan traveling salesman heuristic
inferredcites →https://doi.org/10.1023/a:1014852026591openalex-snapshot
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
inferredcites →https://doi.org/10.1023/a:1020377910258openalex-snapshot
A Hybrid Genetic Algorithm for Assembly Line Balancing
inferredcites →https://doi.org/10.1057/palgrave.jors.2601692openalex-snapshot
A branch-and-cut algorithm for the plant-cycle location problem
inferredcites →https://doi.org/10.1080/17509653.2014.992994openalex-snapshot
Hub-and-spoke logistics network design for third party logistics service providers
inferredcites →https://doi.org/10.1080/17509653.2015.1059297openalex-snapshot
Capacity selection for hubs and hub links in hub location problems
inferredcites →https://doi.org/10.1109/lpt.2005.860400openalex-snapshot
Demonstration of a single-fiber self-healing CWDM metro access ring network with unidirectional OADM
inferredcites →https://doi.org/10.1109/tit.1956.1056815openalex-snapshot
Human memory and the storage of information
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1111/itor.12032openalex-snapshot
A taxonomical analysis, current methods and objectives on location‐routing problems
inferredcites →https://doi.org/10.1111/j.2517-6161.1995.tb02031.xopenalex-snapshot
Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing
inferredcites →https://doi.org/10.1145/2463372.2463434openalex-snapshot
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem
inferredcites →https://doi.org/10.1145/2576768.2598245openalex-snapshot
Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP
inferredcites →https://doi.org/10.1145/2576768.2598284openalex-snapshot
Evolutionary algorithms for overlapping correlation clustering
inferredcites →https://doi.org/10.1214/09-ss051openalex-snapshot
Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
inferredcites →https://doi.org/10.1287/ijoc.6.2.154openalex-snapshot
Genetic Algorithms and Random Keys for Sequencing and Optimization
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1504/ijor.2007.011443openalex-snapshot
A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
inferredcites →https://doi.org/10.21236/ada293985openalex-snapshot
On the Virtues of Parameterized Uniform Crossover,
inferredcites →https://doi.org/10.2991/978-94-6239-148-2_66openalex-snapshot
Multiple Allocation Hub Location Problem with Flow-Dependent Set-up Cost
inferredcites →https://doi.org/10.5829/idosi.ije.2015.28.07a.11openalex-snapshot
A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4682366openalex-extracted
Deep Reinforcement Learning for a Multi-Objective Sustainable Hub Location-Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_2openalex-snapshot
A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_4-2openalex-snapshot
A History of Metaheuristics
inferred← citeshttps://doi.org/10.1007/s00291-018-0526-2openalex-snapshot
Heuristic algorithms for the single allocation p-hub center problem with routing considerations
inferred← citeshttps://doi.org/10.1007/s00291-023-00718-yopenalex-snapshot
A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
inferred← citeshttps://doi.org/10.1007/s00521-019-04666-zopenalex-snapshot
Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window
inferred← citeshttps://doi.org/10.1007/s10732-021-09477-xopenalex-snapshot
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem
inferred← citeshttps://doi.org/10.1007/s10845-018-1393-zopenalex-snapshot
Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery
inferred← citeshttps://doi.org/10.1007/s10898-024-01446-5openalex-snapshot
Early years of biased random-key genetic algorithms: a systematic review
inferred← citeshttps://doi.org/10.1007/s11590-020-01675-zopenalex-snapshot
An efficient heuristic for a hub location routing problem
inferred← citeshttps://doi.org/10.1007/s12351-024-00876-zopenalex-snapshot
Strategic planning for hub resilience: a stochastic location-routing perspective
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.05.024openalex-snapshot
Two effective simulated annealing algorithms for the Location-Routing Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105575openalex-snapshot
Scheduling software updates for connected cars with limited availability
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.108443openalex-snapshot
A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2017.12.020openalex-snapshot
The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111279openalex-snapshot
Holding inventory for shipment consolidation in hub location modeling
inferred← citeshttps://doi.org/10.1016/j.cie.2026.111907openalex-snapshot
A Two-Echelon Single-Allocation incomplete hub location routing problem Arising in multimodal Intra-City express delivery systems
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106861openalex-snapshot
A literature review on hub location-routing models and their solution techniques
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.037openalex-snapshot
The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.002openalex-snapshot
Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.003openalex-snapshot
Multi-period single-allocation hub location-routing: Models and heuristic solutions
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.030openalex-snapshot
Biased random-key genetic algorithms: A review
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.09.040openalex-snapshot
Recent developments in location-routing problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.03.007openalex-snapshot
Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114728openalex-snapshot
An evolutionary approach for the p-next center problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.117077openalex-snapshot
The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm
inferred← citeshttps://doi.org/10.1016/j.omega.2024.103220openalex-snapshot
The role of hubs and economies of scale in network expansion
inferred← citeshttps://doi.org/10.1016/j.procs.2026.02.246openalex-snapshot
Smart Routing for Perishable Products: A Multi Objective BRKGA-Based Decoder Ensuring Quality and Sustainability
inferred← citeshttps://doi.org/10.1016/j.spc.2019.07.007openalex-snapshot
Economic and environmental assessment of different reverse logistics scenarios for food waste recovery
inferred← citeshttps://doi.org/10.1016/j.tre.2017.10.004openalex-snapshot
Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102188openalex-snapshot
Multimodal hub network design with flexible routes
inferred← citeshttps://doi.org/10.1016/j.tre.2022.102903openalex-snapshot
Facility Location in Logistics and Transportation: An enduring relationship
inferred← citeshttps://doi.org/10.1080/00207543.2019.1693652openalex-snapshot
A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure
inferred← citeshttps://doi.org/10.1080/01605682.2023.2197933openalex-snapshot
Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem
inferred← citeshttps://doi.org/10.1109/access.2024.3386584openalex-snapshot
A Multi-Objective Multi-Period Low-Carbon Location-Routing Problem: Improved NSGA-II Approach
inferred← citeshttps://doi.org/10.1109/tevc.2022.3185927openalex-snapshot
The Physical Cell Identity Assignment Problem: A Practical Optimization Approach
inferred← citeshttps://doi.org/10.1111/itor.12950openalex-snapshot
Location‐routing problem: a classification of recent research
inferred← citeshttps://doi.org/10.1287/inte.2022.1131openalex-snapshot
The University of Michigan Implements a Hub-and-Spoke Design to Accommodate Social Distancing in the Campus Bus System Under COVID-19 Restrictions
inferred← citeshttps://doi.org/10.1287/trsc.2021.1070openalex-snapshot
Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design
inferred← citeshttps://doi.org/10.20944/preprints202310.0411.v1openalex-snapshot
The Multi-Objective Model of the Hub Covering Location-Routing Problem with Simultaneous Delivery and Pickup Under Uncertainty
inferred← citeshttps://doi.org/10.3390/drones7010006openalex-snapshot
Optimizing the Hub-and-Spoke Network with Drone-Based Traveling Salesman Problem
inferred← citeshttps://doi.org/10.52547/jimp.11.3.69openalex-snapshot
A Meta-Heuristic Approach for Hub Location-Routing Problem with Capacity and Balancing Decisions
inferred← citeshttps://doi.org/10.70675/1e4802a4z1bffz467cz8beaz737e569b4495openalex-snapshot
Optimization Models and Algorithms for the Design of Global Transportation Networks
inferred← citeshttps://doi.org/10.7717/peerj-cs.2840openalex-snapshot
The effect of different initial solutions on the metaheuristic algorithms for the single allocation p-hub center and routing problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.