On the public citation graph

Deep Learning--Accelerated Multi-Start Large Neighborhood Search for Real-time Freight Bundling

https://doi.org/10.2139/ssrn.6560405
0 signed · 42 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/(sici)1520-6750(199909)46:6<654::aid-nav4>3.0.co;2-aopenalex-snapshot
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
inferredcites →https://doi.org/10.1002/net.20312openalex-snapshot
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
inferredcites →https://doi.org/10.1002/net.21521openalex-snapshot
The multi‐commodity pickup‐and‐delivery traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230190602openalex-snapshot
The prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230220408openalex-snapshot
The swapping problem
inferredcites →https://doi.org/10.1007/bf01585767openalex-snapshot
The precedence-constrained asymmetric traveling salesman polytope
inferredcites →https://doi.org/10.1007/s10107-008-0234-9openalex-snapshot
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
inferredcites →https://doi.org/10.1007/s11750-007-0009-0openalex-snapshot
Static pickup and delivery problems: a classification scheme and survey
inferredcites →https://doi.org/10.1016/0166-218x(90)90100-qopenalex-snapshot
The selective travelling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(94)90016-7openalex-snapshot
The traveling salesman problem with delivery and backhauls
inferredcites →https://doi.org/10.1016/0377-2217(85)90257-7openalex-snapshot
An algorithm for the traveling salesman problem with pickup and delivery customers
inferredcites →https://doi.org/10.1016/0377-2217(94)90360-3openalex-snapshot
The Travelling Salesman Problem with pick-up and delivery
inferredcites →https://doi.org/10.1016/j.artint.2022.103786openalex-snapshot
Neural large neighborhood search for routing problems
inferredcites →https://doi.org/10.1016/j.cor.2004.08.001openalex-snapshot
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
inferredcites →https://doi.org/10.1016/j.cor.2007.01.007openalex-snapshot
The single vehicle routing problem with deliveries and selective pickups
inferredcites →https://doi.org/10.1016/j.cor.2008.05.005openalex-snapshot
The pickup and delivery traveling salesman problem with first-in-first-out loading
inferredcites →https://doi.org/10.1016/j.cor.2016.01.018openalex-snapshot
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
inferredcites →https://doi.org/10.1016/j.cor.2017.09.003openalex-snapshot
An efficient evolutionary algorithm for the orienteering problem
inferredcites →https://doi.org/10.1016/j.cor.2024.106791openalex-snapshot
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search
inferredcites →https://doi.org/10.1016/j.ejor.2006.05.009openalex-snapshot
General solutions to the single vehicle routing problem with pickups and deliveries
inferredcites →https://doi.org/10.1016/j.ejor.2008.05.009openalex-snapshot
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2016.07.009openalex-snapshot
The pickup and delivery traveling salesman problem with handling costs
inferredcites →https://doi.org/10.1016/j.eswa.2020.114353openalex-snapshot
A novel direct measure of exploration and exploitation based on attraction basins
inferredcites →https://doi.org/10.1016/j.ijpe.2012.06.009openalex-snapshot
The selective pickup and delivery problem: Formulation and a memetic algorithm
inferredcites →https://doi.org/10.1016/j.trb.2015.02.014openalex-snapshot
The split-demand one-commodity pickup-and-delivery travelling salesman problem
inferredcites →https://doi.org/10.1016/j.tre.2025.104368openalex-snapshot
Freight Mobility as a Service: Open platforms for synchromodal transport
inferredcites →https://doi.org/10.1016/s0305-0548(00)00109-xopenalex-snapshot
Perturbation heuristics for the pickup and delivery traveling salesman problem
inferredcites →https://doi.org/10.1016/s0305-0548(99)00066-0openalex-snapshot
A heuristic for the pickup and delivery traveling salesman problem
inferredcites →https://doi.org/10.1109/tits.2020.3003163openalex-snapshot
A Hybrid of Deep Reinforcement Learning and Local Search for the Vehicle Routing Problems
inferredcites →https://doi.org/10.1109/tits.2021.3056120openalex-snapshot
Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learning
inferredcites →https://doi.org/10.1137/s0097539795295468openalex-snapshot
Approximating Capacitated Routing and Delivery Problems
inferredcites →https://doi.org/10.1287/ijoc.10.2.133openalex-snapshot
Solving the Orienteering Problem through Branch-and-Cut
inferredcites →https://doi.org/10.1287/opre.43.2.367openalex-snapshot
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.1287/opre.45.3.365openalex-snapshot
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
inferredcites →https://doi.org/10.1287/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
inferredcites →https://doi.org/10.1287/trsc.1050.0135openalex-snapshot
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.1120.0432openalex-snapshot
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
inferredcites →https://doi.org/10.1287/trsc.14.2.130openalex-snapshot
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
inferredcites →https://doi.org/10.1287/trsc.27.3.298openalex-snapshot
Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.52202/068431-0141openalex-snapshot
Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization
inferredcites →https://doi.org/10.52202/075280-0164openalex-snapshot
DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization
inferredcites →https://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.