On the public citation graph
Heuristic Sequence Selection for Inventory Routing Problem
0 signed · 95 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.1007/978-3-319-19084-6_31openalex-snapshot
A Software Interface for Supporting the Application of Data Science to Optimisation
inferredcites →https://doi.org/10.1007/978-3-540-77345-0_25openalex-snapshot
An Experimental Study on Hyper-heuristics and Exam Timetabling
inferredcites →https://doi.org/10.1007/s00291-008-0134-7openalex-snapshot
Delivery strategies for blood products supplies
inferredcites →https://doi.org/10.1007/s10732-005-0616-6openalex-snapshot
Minimizing the Total Cost in an Integrated Vendor—Managed Inventory System
inferredcites →https://doi.org/10.1007/s10898-004-5908-0openalex-snapshot
An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity
inferredcites →https://doi.org/10.1007/s11590-012-0444-1openalex-snapshot
Selective and periodic inventory routing problem for waste vegetable oil collection
inferredcites →https://doi.org/10.1007/s13676-019-00143-8openalex-snapshot
Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms
inferredcites →https://doi.org/10.1016/j.compchemeng.2011.01.005openalex-snapshot
A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation
inferredcites →https://doi.org/10.1016/j.cor.2006.10.020openalex-snapshot
An optimization algorithm for the inventory routing problem with continuous moves
inferredcites →https://doi.org/10.1016/j.cor.2009.09.014openalex-snapshot
Solving a rich vehicle routing and inventory problem using column generation
inferredcites →https://doi.org/10.1016/j.cor.2010.10.031openalex-snapshot
A maritime inventory routing problem: Practical approach
inferredcites →https://doi.org/10.1016/j.cor.2011.12.020openalex-snapshot
The inventory-routing problem with transshipment
inferredcites →https://doi.org/10.1016/j.cor.2012.08.012openalex-snapshot
The exact solution of several classes of inventory-routing problems
inferredcites →https://doi.org/10.1016/j.cor.2014.07.001openalex-snapshot
Heuristics for dynamic and stochastic inventory-routing
inferredcites →https://doi.org/10.1016/j.ejor.2004.02.008openalex-snapshot
Shipment planning at oil refineries using column generation and valid inequalities
inferredcites →https://doi.org/10.1016/j.ejor.2006.12.056openalex-snapshot
Model and algorithm for inventory/routing decision in a three-echelon logistics system
inferredcites →https://doi.org/10.1016/j.ejor.2007.07.034openalex-snapshot
A memetic algorithm with dynamic population management for an integrated production–distribution problem
inferredcites →https://doi.org/10.1016/j.ejor.2007.09.032openalex-snapshot
A practical solution approach for the cyclic inventory routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2009.04.024openalex-snapshot
Dynamic pickup and delivery problems
inferredcites →https://doi.org/10.1016/j.ejor.2010.08.023openalex-snapshot
Maritime inventory routing with multiple products: A case study from the cement industry
inferredcites →https://doi.org/10.1016/j.ejor.2012.12.002openalex-snapshot
Ship routing and scheduling in the new millennium
inferredcites →https://doi.org/10.1016/j.ejor.2015.09.003openalex-snapshot
An iterated multi-stage selection hyper-heuristic
inferredcites →https://doi.org/10.1016/j.ejor.2018.10.022openalex-snapshot
Solving urban transit route design problem using selection hyper-heuristics
inferredcites →https://doi.org/10.1016/j.eswa.2011.04.138openalex-snapshot
A heuristic method for the inventory routing problem with time windows
inferredcites →https://doi.org/10.1016/j.eswa.2012.05.064openalex-snapshot
Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery
inferredcites →https://doi.org/10.1016/j.ins.2014.12.020openalex-snapshot
A tensor-based selection hyper-heuristic for cross-domain heuristic search
inferredcites →https://doi.org/10.1016/j.ins.2016.09.010openalex-snapshot
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
inferredcites →https://doi.org/10.1016/j.knosys.2016.01.031openalex-snapshot
A tensor based hyper-heuristic for nurse rostering
inferredcites →https://doi.org/10.1016/j.orl.2008.05.005openalex-snapshot
A single supplier–single retailer system with an order-up-to level inventory policy
inferredcites →https://doi.org/10.1016/j.renene.2018.03.052openalex-snapshot
Evolutionary computation for wind farm layout optimization
inferredcites →https://doi.org/10.1016/j.trc.2012.03.007openalex-snapshot
Consistency in multi-vehicle inventory-routing
inferredcites →https://doi.org/10.1016/j.tre.2010.01.006openalex-snapshot
A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
inferredcites →https://doi.org/10.1057/jors.2013.71openalex-snapshot
Hyper-heuristics: a survey of the state of the art
inferredcites →https://doi.org/10.1080/00207540600597138openalex-snapshot
A genetic algorithm approach to the integrated inventory-distribution problem
inferredcites →https://doi.org/10.1080/00207543.2012.757668openalex-snapshot
A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem
inferredcites →https://doi.org/10.1108/09600030710763396openalex-snapshot
The storage constrained, inbound inventory routing problem
inferredcites →https://doi.org/10.1111/itor.12226openalex-snapshot
The inventory routing problem: the value of integration
inferredcites →https://doi.org/10.1145/2001576.2001752openalex-snapshot
A genetic programming based hyper-heuristic approach for combinatorial optimisation
inferredcites →https://doi.org/10.1145/2739480.2754766openalex-snapshot
A Sequence-based Selection Hyper-heuristic Utilising a Hidden Markov Model
inferredcites →https://doi.org/10.1162/evco_a_00186openalex-snapshot
A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems
inferredcites →https://doi.org/10.1214/aoms/1177699147openalex-snapshot
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
inferredcites →https://doi.org/10.1287/ijoc.1100.0439openalex-snapshot
A Hybrid Heuristic for an Inventory Routing Problem
inferredcites →https://doi.org/10.1287/ijoc.2013.0550openalex-snapshot
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
inferredcites →https://doi.org/10.1287/inte.1060.0276openalex-snapshot
Omya Hustadmarmor Optimizes Its Supply Chain for Delivering Calcium Carbonate Slurry to European Paper Manufacturers
inferredcites →https://doi.org/10.1287/inte.13.6.4openalex-snapshot
Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer
inferredcites →https://doi.org/10.1287/opre.1040.0150openalex-snapshot
A Periodic Inventory Routing Problem at a Supermarket Chain
inferredcites →https://doi.org/10.1287/opre.1110.1015openalex-snapshot
A Column-Generation Based Tactical Planning Method for Inventory Routing
inferredcites →https://doi.org/10.1287/trsc.1030.0054openalex-snapshot
A Decomposition Approach for the Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1060.0188openalex-snapshot
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1100.0354openalex-snapshot
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1100.0360openalex-snapshot
Randomized Local Search for Real-Life Inventory Routing
inferredcites →https://doi.org/10.1287/trsc.2013.0472openalex-snapshot
Thirty Years of Inventory Routing
inferredcites →https://doi.org/10.1287/trsc.23.2.67openalex-snapshot
An Integrated Inventory Allocation and Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/trsc.32.2.189openalex-snapshot
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
inferredcites →https://doi.org/10.1287/trsc.36.1.119.573openalex-snapshot
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
inferredcites →https://doi.org/10.1287/trsc.36.1.94.574openalex-snapshot
The Stochastic Inventory Routing Problem with Direct Deliveries
inferredcites →https://doi.org/10.4018/jamc.2010102603openalex-snapshot
A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
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.4793503openalex-extracted
A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
inferred← citeshttps://doi.org/10.1002/net.21962openalex-snapshot
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
inferred← citeshttps://doi.org/10.1007/s10479-021-04345-0openalex-snapshot
A multi-period inventory routing problem with procurement decisions: a case in China
inferred← citeshttps://doi.org/10.1007/s10479-021-04488-0openalex-snapshot
Vehicle routing problems over time: a survey
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108704openalex-snapshot
A hyper-heuristic approach to the strategic planning of bike-sharing infrastructure
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105221openalex-snapshot
A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105686openalex-snapshot
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106129openalex-snapshot
A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106503openalex-snapshot
Stochastic inventory routing with dynamic demands and intra-day depletion
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106883openalex-snapshot
A novel mixed-integer linear programming formulation for continuous-time inventory routing
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107298openalex-snapshot
The stochastic and dynamic inventory routing problem with fine time granularity: A reinforcement learning approach
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100971openalex-snapshot
Many-objective hyper-heuristics: A state-of-the-art survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.042openalex-snapshot
Metaheuristics “In the Large”
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.06.016openalex-snapshot
Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.08.010openalex-snapshot
New benchmark instances for the inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.04.044openalex-snapshot
Inventory-routing problems: Review, challenges, and innovations
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113426openalex-snapshot
H2-SLAN: A hyper-heuristic based on stochastic learning automata network for obtaining, storing, and retrieving heuristic knowledge
inferred← citeshttps://doi.org/10.1016/j.renene.2023.03.075openalex-snapshot
Application of selection hyper-heuristics to the simultaneous optimisation of turbines and cabling within an offshore windfarm
inferred← citeshttps://doi.org/10.1016/j.susoc.2021.08.002openalex-snapshot
A modified adaptive genetic algorithm for multi-product multi-period inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102319openalex-snapshot
Sustainable supply chain management for perishable products in emerging markets: An integrated location-inventory-routing model
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104297openalex-snapshot
Inventory routing problem of automotive parts considering time-varying demands: A machine learning enhanced branch-and-price approach
inferred← citeshttps://doi.org/10.1080/00207543.2021.1998696openalex-snapshot
An improved model and exact algorithm using local branching for the inventory-routing problem with time windows
inferred← citeshttps://doi.org/10.1080/00207543.2025.2452386openalex-snapshot
Hierarchical production control and distribution planning under retail uncertainty with reinforcement learning
inferred← citeshttps://doi.org/10.1109/access.2021.3106815openalex-snapshot
Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites
inferred← citeshttps://doi.org/10.1109/cec48606.2020.9185803openalex-snapshot
A Reinforcement Learning Hyper-heuristic for the optimisation of Flight Connections
inferred← citeshttps://doi.org/10.1109/cec53210.2023.10254024openalex-snapshot
Hyper-Heuristics Meet Controller Design: Improving Electrical Grid Performance through Microgrids
inferred← citeshttps://doi.org/10.1145/3638530.3664186openalex-snapshot
Efficient Scheduling of GECCO Conferences using Hyper-heuristic Algorithms
inferred← citeshttps://doi.org/10.1145/3701236openalex-snapshot
Explainable Optimisation through Online and Offline Hyper-heuristics
inferred← citeshttps://doi.org/10.1287/msom.2022.1182openalex-snapshot
Redesigning Sample Transportation in Malawi Through Improved Data Sharing and Daily Route Optimization
inferred← citeshttps://doi.org/10.1287/trsc.2019.0972openalex-snapshot
Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem
inferred← citeshttps://doi.org/10.1287/trsc.2025.0129openalex-snapshot
Data-Driven Optimization for Meal Delivery: A Reinforcement Learning Approach for Order-Courier Assignment and Routing at Meituan
inferred← citeshttps://doi.org/10.32657/10356/172085openalex-snapshot
A bin-packing based heuristic for the integrated inventory and vehicle routing problem
inferred← citeshttps://doi.org/10.3390/math12070991openalex-snapshot
Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem
inferred← citeshttps://doi.org/10.3390/math13213490openalex-snapshot
Bridging Project Management and Supply Chain Management via Optimization Method: Scenarios, Technologies, and Future Opportunities
inferred← citeshttps://doi.org/10.47749/t/unicamp.2021.1169412openalex-snapshot
Algoritmos de aproximação para problemas de estoque e roteirização
inferred← citeshttps://doi.org/10.48550/arxiv.2111.01047openalex-snapshot
Mixed-Integer Programming for the ROADEF/EURO 2020 challenge
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.