On the public citation graph

A biased‐randomized metaheuristic for the capacitated location routing problem

https://doi.org/10.1111/itor.12322
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118165881openalex-snapshot
Nonparametric Statistics for Non‐Statisticians
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/11730095_16openalex-snapshot
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1007/978-0-387-88843-9_16openalex-snapshot
A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions
inferredcites →https://doi.org/10.1007/978-0-387-88843-9_17openalex-snapshot
Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem
inferredcites →https://doi.org/10.1007/978-3-642-16054-7_13openalex-snapshot
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem
inferredcites →https://doi.org/10.1007/978-3-642-34300-1_31openalex-snapshot
Application of a Clustering Based Location-Routing Model to a Real Agri-food Supply Chain Redesign
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/s10288-006-0001-9openalex-snapshot
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
inferredcites →https://doi.org/10.1007/s10732-013-9230-1openalex-snapshot
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/0305-0483(73)90108-4openalex-snapshot
Depot location with van salesmen — A practical approach
inferredcites →https://doi.org/10.1016/0377-2217(89)90188-4openalex-snapshot
The effect of ignoring routes when locating depots
inferredcites →https://doi.org/10.1016/0377-2217(95)00042-oopenalex-snapshot
The capacitated plant location problem
inferredcites →https://doi.org/10.1016/j.cie.2009.10.007openalex-snapshot
A simulated annealing heuristic for the capacitated location routing problem
inferredcites →https://doi.org/10.1016/j.cie.2014.10.029openalex-snapshot
A literature review on the vehicle routing problem with multiple depots
inferredcites →https://doi.org/10.1016/j.cor.2009.07.004openalex-snapshot
A GRASP×ELS approach for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2010.09.010openalex-snapshot
Efficient frameworks for greedy split and new depth first search split procedures for routing problems
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.04.007openalex-snapshot
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
inferredcites →https://doi.org/10.1016/j.cor.2012.05.008openalex-snapshot
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.disopt.2013.07.005openalex-snapshot
A computational comparison of flow formulations for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.dss.2008.07.007openalex-snapshot
A decision-support tool for a capacitated location-routing 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.ijpe.2012.06.011openalex-snapshot
A multiple ant colony optimization algorithm for the capacitated location routing problem
inferredcites →https://doi.org/10.1016/j.jmsy.2012.12.002openalex-snapshot
A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain
inferredcites →https://doi.org/10.1016/j.orp.2015.03.001openalex-snapshot
A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
inferredcites →https://doi.org/10.1016/j.procir.2015.02.147openalex-snapshot
Non-Collaborative versus Collaborative Last-Mile Delivery in Urban Systems with Stochastic Demands
inferredcites →https://doi.org/10.1016/j.simpat.2013.11.008openalex-snapshot
A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs
inferredcites →https://doi.org/10.1016/j.simpat.2014.02.005openalex-snapshot
A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times
inferredcites →https://doi.org/10.1016/j.trb.2014.05.014openalex-snapshot
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/s0305-0548(01)00038-7openalex-snapshot
Heuristic solutions to multi-depot location-routing problems
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1057/jors.1964.47openalex-snapshot
On the Location of Supply Points to Minimize Transport Costs
inferredcites →https://doi.org/10.1057/jors.1968.74openalex-snapshot
Cost Functions in the Location of Depots for Multiple-Delivery Journeys
inferredcites →https://doi.org/10.1057/jors.2010.29openalex-snapshot
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
inferredcites →https://doi.org/10.1080/09537287.2016.1147092openalex-snapshot
On the impact of collaborative strategies for goods delivery in city logistics
inferredcites →https://doi.org/10.1109/iccie.2009.5223742openalex-snapshot
Machine scheduling with sequence-dependent setup times using a randomized search heuristic
inferredcites →https://doi.org/10.1109/wsc.2009.5429227openalex-snapshot
Using randomization to solve the deterministic single and multiple vehicle routing problem with service time constraints
inferredcites →https://doi.org/10.1109/wsc.2009.5429663openalex-snapshot
Solving the Capacitated Vehicle Routing Problem with maximum traveling distance and service time requirements: An approach based on Monte Carlo simulation
inferredcites →https://doi.org/10.1109/wsc.2013.6721581openalex-snapshot
A simulation-based algorithm for the integrated location and routing problem in urban logistics
inferredcites →https://doi.org/10.1111/itor.12026openalex-snapshot
Randomized heuristics for the family traveling salesperson problem
inferredcites →https://doi.org/10.1111/itor.12101openalex-snapshot
Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
inferredcites →https://doi.org/10.1111/itor.12109openalex-snapshot
A biased random‐key genetic algorithm for the minimization of open stacks problem
inferredcites →https://doi.org/10.1111/j.1467-9787.1961.tb01276.xopenalex-snapshot
THE RELATIONSHIP BETWEEN TRANSPORTATION COSTS AND LOCATION RENT IN TRANSPORTATION PROBLEMS
inferredcites →https://doi.org/10.1111/j.1475-3995.2007.00622.xopenalex-snapshot
A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
inferredcites →https://doi.org/10.1111/j.1475-3995.2008.00640.xopenalex-snapshot
The ALGACEA‐1 method for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1111/j.1475-3995.2010.00771.xopenalex-snapshot
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
inferredcites →https://doi.org/10.1145/242224.242265openalex-snapshot
Microarchitecture, compilers and algorithms
inferredcites →https://doi.org/10.1287/ijoc.2013.0549openalex-snapshot
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1287/opre.1110.0989openalex-snapshot
An Exact Method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1287/opre.12.4.568openalex-snapshot
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
inferredcites →https://doi.org/10.1287/trsc.1060.0187openalex-snapshot
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic
inferredcites →https://doi.org/10.1504/ijaom.2012.045889openalex-snapshot
Deterministic machine scheduling with release times and sequence-dependent setups using random-insertion heuristics
inferredcites →https://doi.org/10.5267/j.ijiec.2010.06.003openalex-snapshot
A variable neighborhood descent based heuristic to solve the capacitated location-routing problem

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.4118116openalex-extracted
A Simulation-Based Approach for the Productivity Improvement of Automated Storage and Retrieval Systems in the Steel Industry
inferred← citeshttps://doi.org/10.1002/ett.3418openalex-snapshot
A 2‐stage biased‐randomized iterated local search for the uncapacitated single allocation p‐hub median problem
inferred← citeshttps://doi.org/10.1002/net.22067openalex-snapshot
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
inferred← citeshttps://doi.org/10.1007/978-3-030-72929-5_18openalex-snapshot
Agile Computational Intelligence for Supporting Hospital Logistics During the COVID-19 Crisis
inferred← citeshttps://doi.org/10.1007/978-3-030-76310-7_3openalex-snapshot
A Decision Support Tool for the Location Routing Problem During the COVID-19 Outbreak in Colombia
inferred← citeshttps://doi.org/10.1007/s10479-021-04142-9openalex-snapshot
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
inferred← citeshttps://doi.org/10.1007/s10586-018-1957-xopenalex-snapshot
Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate
inferred← citeshttps://doi.org/10.1007/s11356-021-15907-xopenalex-snapshot
A multiobjective model for the green capacitated location-routing problem considering drivers’ satisfaction and time window with uncertain demand
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106280openalex-snapshot
A learnheuristic approach for the team orienteering problem with aerial drone motion constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107486openalex-snapshot
Combining production and distribution in supply chains: The hybrid flow-shop vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2026.111811openalex-snapshot
Simheuristics with metamodel initialization for determining repair system inventory policies
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105033openalex-snapshot
A biased-randomized algorithm for optimizing efficiency in parametric earthquake (Re) insurance solutions
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107388openalex-snapshot
Spatial decomposition-based variable neighborhood search algorithm for the integrated semiconductor backend production and distribution scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.10.028openalex-snapshot
Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.12.035openalex-snapshot
A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.114240openalex-snapshot
Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105477openalex-snapshot
Enhanced approximation algorithms for the capacitated location routing problem
inferred← citeshttps://doi.org/10.1016/j.simpat.2020.102166openalex-snapshot
Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review
inferred← citeshttps://doi.org/10.1080/01605682.2018.1494527openalex-snapshot
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1421268openalex-snapshot
A GRASP algorithm based new heuristic for the capacitated location routing problem
inferred← citeshttps://doi.org/10.1080/17477778.2019.1680262openalex-snapshot
A simheuristic algorithm for the capacitated location routing problem with stochastic demands
inferred← citeshttps://doi.org/10.1080/17477778.2020.1863754openalex-snapshot
A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem
inferred← citeshttps://doi.org/10.1108/mip-02-2021-0050openalex-snapshot
Maximizing customers' lifetime value using limited marketing resources
inferred← citeshttps://doi.org/10.1109/comst.2026.3731146openalex-snapshot
Approximation Algorithms for Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1109/wsc48552.2020.9383895openalex-snapshot
A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering
inferred← citeshttps://doi.org/10.1109/wsc48552.2020.9383923openalex-snapshot
An Agile Simheuristic for the Stochastic Team Task Assignment and Orienteering Problem: Applications to Unmanned Aerial Vehicles
inferred← citeshttps://doi.org/10.1109/wsc48552.2020.9384044openalex-snapshot
A Simheuristic Algorithm for Reliable Asset and Liability Management Under Uncertainty Scenarios
inferred← citeshttps://doi.org/10.1109/wsc48552.2020.9384087openalex-snapshot
A Simulation-Optimization Approach for Locating Automated Parcel Lockers in Urban Logistics Operations
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715335openalex-snapshot
Supporting Hospital Logistics During the First Months of The COVID-19 Crisis: A Simheuristic for the Stochastic Team Orienteering Problem
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715370openalex-snapshot
Solving an Urban Ridesharing Problem with Stochastic Travel Times: A Simheuristic Approach
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715424openalex-snapshot
Waste Collection of Medical Items Under Uncertainty Using Internet of Things and City Open Data Repositories: A Simheuristic Approach
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715428openalex-snapshot
Supporting Efficient Assignment of Medical Resources in Cancer Treatments with Simulation-Optimization
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715442openalex-snapshot
A Biased-Randomized Discrete-Event Heuristic for the Hybrid Flow Shop Problem with Batching and Multiple Paths
inferred← citeshttps://doi.org/10.1109/wsc52266.2021.9715531openalex-snapshot
Last-Mile Delivery of Pharmaceutical Items to Heterogeneous Healthcare Centers with Random Travel Times and Unpunctuality Fees
inferred← citeshttps://doi.org/10.1111/itor.12379openalex-snapshot
An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
inferred← citeshttps://doi.org/10.1111/itor.12479openalex-snapshot
Using horizontal cooperation concepts in integrated routing and facility‐location decisions
inferred← citeshttps://doi.org/10.1111/itor.12625openalex-snapshot
Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
inferred← citeshttps://doi.org/10.1111/itor.12668openalex-snapshot
A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
inferred← citeshttps://doi.org/10.1111/itor.12719openalex-snapshot
A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
inferred← citeshttps://doi.org/10.1111/itor.12862openalex-snapshot
A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
inferred← citeshttps://doi.org/10.1111/itor.12950openalex-snapshot
Location‐routing problem: a classification of recent research
inferred← citeshttps://doi.org/10.1111/itor.13125openalex-snapshot
The location routing problem with facility sizing decisions
inferred← citeshttps://doi.org/10.1111/itor.13302openalex-snapshot
Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
inferred← citeshttps://doi.org/10.1111/itor.13422openalex-snapshot
The capacitated family traveling salesperson problem
inferred← citeshttps://doi.org/10.1287/ijoc.2023.0416openalex-snapshot
A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing
inferred← citeshttps://doi.org/10.2139/ssrn.5242496openalex-snapshot
Spatial Decomposition-Based Variable Neighborhood Search Algorithm for the Semiconductor Backend Production and Distribution Integrated Scheduling Problem
inferred← citeshttps://doi.org/10.3390/a13010008openalex-snapshot
On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems
inferred← citeshttps://doi.org/10.3390/a13090237openalex-snapshot
A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery
inferred← citeshttps://doi.org/10.3390/a14020041openalex-snapshot
Simulation-Optimization Approach for Multi-Period Facility Location Problems with Forecasted and Random Demands in a Last-Mile Logistics Application
inferred← citeshttps://doi.org/10.3390/a14020045openalex-snapshot
Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty
inferred← citeshttps://doi.org/10.3390/app11177950openalex-snapshot
Fuzzy Simheuristics for Optimizing Transportation Systems: Dealing with Stochastic and Fuzzy Uncertainty
inferred← citeshttps://doi.org/10.3390/axioms13010031openalex-snapshot
Optimization of Location-Routing for Multi-Vehicle Combinations with Capacity Constraints Based on Binary Equilibrium Optimizers
inferred← citeshttps://doi.org/10.3390/books978-3-03943-836-5openalex-snapshot
Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov
inferred← citeshttps://doi.org/10.3390/en14041138openalex-snapshot
The Role of Simulation and Serious Games in Teaching Concepts on Circular Economy and Sustainable Energy
inferred← citeshttps://doi.org/10.3390/en14165131openalex-snapshot
Electric Vehicle Routing, Arc Routing, and Team Orienteering Problems in Sustainable Transportation
inferred← citeshttps://doi.org/10.3390/en14196309openalex-snapshot
Edge Computing and IoT Analytics for Agile Optimization in Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.3390/math13152488openalex-snapshot
A Biased–Randomized Iterated Local Search with Round-Robin for the Periodic Vehicle Routing Problem
inferred← citeshttps://doi.org/10.3390/math14193464openalex-snapshot
A Matheuristic Approach for the Bi-Objective and Multi-Source Team Orienteering Problem with Prioritized Nodes
inferred← citeshttps://doi.org/10.3390/wevj11040061openalex-snapshot
Location and Routing Planning Considering Electric Vehicles with Restricted Distance in Agriculture
inferred← citeshttps://doi.org/10.36819/sw21.044openalex-snapshot
Asset and Liability Management in Insurance Firms: A Biased-Randomised Approach Combining Heuristics with Monte-Carlo Simulation
inferred← citeshttps://doi.org/10.3934/math.2026794openalex-snapshot
An ODE-augmented matheuristic for the permutation flow shop scheduling problem with thermally driven processing times
inferred← citeshttps://doi.org/10.70675/cf6377e6z1844z4359zb7d7zaf78bfcceb8eopenalex-snapshot
Green Hub Location-Routing Problem for LTL transport
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.