On the public citation graph
A cumulative service state representation for the pickup and delivery problem with transfers
0 signed · 97 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.20177openalex-snapshot
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
inferredcites →https://doi.org/10.1007/978-94-009-5970-5openalex-snapshot
Applications of Queueing Theory
inferredcites →https://doi.org/10.1007/s00291-004-0173-7openalex-snapshot
A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1007/s12159-012-0080-2openalex-snapshot
Rich vehicle routing in theory and practice
inferredcites →https://doi.org/10.1007/s12469-010-0018-5openalex-snapshot
An overview on vehicle scheduling models
inferredcites →https://doi.org/10.1016/0191-2615(93)90038-copenalex-snapshot
A simplified theory of kinematic waves in highway traffic, part I: General theory
inferredcites →https://doi.org/10.1016/0191-2615(94)90002-7openalex-snapshot
The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory
inferredcites →https://doi.org/10.1016/0377-2217(91)90319-qopenalex-snapshot
The pickup and delivery problem with time windows
inferredcites →https://doi.org/10.1016/j.compenvurbsys.2018.10.002openalex-snapshot
Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning
inferredcites →https://doi.org/10.1016/j.cor.2005.03.024openalex-snapshot
A dial-a-ride problem for client transportation in a health-care organization
inferredcites →https://doi.org/10.1016/j.cor.2011.11.016openalex-snapshot
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
inferredcites →https://doi.org/10.1016/j.cor.2013.07.020openalex-snapshot
The Dial-A-Ride Problem with Transfers
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.ejor.2005.02.038openalex-snapshot
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
inferredcites →https://doi.org/10.1016/j.ejor.2009.01.022openalex-snapshot
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
inferredcites →https://doi.org/10.1016/j.ejor.2012.12.015openalex-snapshot
Applications of the vehicle routing problem with trailers and transshipments
inferredcites →https://doi.org/10.1016/j.ejor.2013.10.038openalex-snapshot
New mixed integer-programming model for the pickup-and-delivery problem with transshipment
inferredcites →https://doi.org/10.1016/j.ejor.2014.03.003openalex-snapshot
The Share-a-Ride Problem: People and parcels sharing taxis
inferredcites →https://doi.org/10.1016/j.trb.2003.07.001openalex-snapshot
A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows
inferredcites →https://doi.org/10.1016/j.trb.2008.10.003openalex-snapshot
Large-scale constrained clustering for rationalizing pickup and delivery operations
inferredcites →https://doi.org/10.1016/j.trb.2014.05.017openalex-snapshot
Integration of conventional and flexible bus services with timed transfers
inferredcites →https://doi.org/10.1016/j.trb.2016.03.009openalex-snapshot
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
inferredcites →https://doi.org/10.1016/j.trb.2016.05.003openalex-snapshot
Holding decisions for correlated vehicle arrivals at intermodal freight transfer terminals
inferredcites →https://doi.org/10.1016/s0191-2615(02)00045-0openalex-snapshot
A tabu search heuristic for the static multi-vehicle dial-a-ride problem
inferredcites →https://doi.org/10.1016/s0191-2615(97)00041-6openalex-snapshot
Departure time, route choice and congestion toll in a queuing network with elastic demand
inferredcites →https://doi.org/10.1016/s0305-0548(98)00027-6openalex-snapshot
Least possible time paths in stochastic,time-varying networks
inferredcites →https://doi.org/10.1080/01966324.1986.10737198openalex-snapshot
A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
inferredcites →https://doi.org/10.1080/03155986.2006.11732749openalex-snapshot
The Pickup And Delivery Problem With Time Windows And Transshipment
inferredcites →https://doi.org/10.1109/intech.2013.6653677openalex-snapshot
Taxi origin-destination areas of interest discovering based on functional region division
inferredcites →https://doi.org/10.1109/ispan.2004.1300441openalex-snapshot
Proceedings 7th International Symposium on Parallel Architectures, Algorithms and Networks
inferredcites →https://doi.org/10.1109/ispan.2005.88openalex-snapshot
Transshipment and Time Windows in Vehicle Routing
inferredcites →https://doi.org/10.1109/mdm.2004.1324416openalex-snapshot
2004 IEEE International Conference on Mobile Data Management
inferredcites →https://doi.org/10.1109/mdm.2016.54openalex-snapshot
Understanding Urban Mobility via Taxi Trip Clustering
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1111/tgis.12100openalex-snapshot
Mapping Large Spatial Flow Data with Hierarchical Clustering
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1145/321105.321111openalex-snapshot
Dynamic Programming Treatment of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.1060.0283openalex-snapshot
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
inferredcites →https://doi.org/10.1287/opre.1100.0881openalex-snapshot
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1287/opre.2017.1624openalex-snapshot
The Continuous-Time Service Network Design Problem
inferredcites →https://doi.org/10.1287/opre.46.4.474openalex-snapshot
Drive: Dynamic Routing of Independent Vehicles
inferredcites →https://doi.org/10.1287/trsc.1030.0040openalex-snapshot
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem
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.1090.0272openalex-snapshot
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.1110.0400openalex-snapshot
Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints
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.17.3.351openalex-snapshot
An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.2013.0495openalex-snapshot
A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances
inferredcites →https://doi.org/10.1287/trsc.21.3.153openalex-snapshot
A Dynamic Space-Time Network Flow Model for City Traffic Congestion
inferredcites →https://doi.org/10.1287/trsc.29.1.63openalex-snapshot
A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
inferredcites →https://doi.org/10.1287/trsc.34.2.198.12304openalex-snapshot
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
inferredcites →https://doi.org/10.1287/trsc.5.3.302openalex-snapshot
Three-Dimensional Representation of Traffic Flow
inferredcites →https://doi.org/10.2307/3323470openalex-snapshot
Lecture Notes in Economics and Mathematical Systems
inferredcites →https://doi.org/10.3141/1645-21openalex-snapshot
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
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.4581247openalex-extracted
An Nadmm_Vns for Electric Vehicle Routing Problem with Time Windows and Recharging Station
inferred← citeshttps://doi.org/10.1007/s40864-018-0083-7openalex-snapshot
Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems
inferred← citeshttps://doi.org/10.1016/j.apenergy.2026.127926openalex-snapshot
Benders decomposition for the charging station location-routing problem under stochastic energy consumption: a two-stage model with a space-electricity network perspective
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.112141openalex-snapshot
An alternating direction multiplier method with variable neighborhood search for electric vehicle routing problem with time windows and battery swapping stations
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109067openalex-snapshot
Evaluating operating models and urbanism for transportation operations of circular reuse platforms
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110076openalex-snapshot
The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110458openalex-snapshot
Integrated food delivery problem considering both single-order and multiple order deliveries
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105917openalex-snapshot
A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106820openalex-snapshot
Problem size reduction methods for large CVRPs
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107505openalex-snapshot
Solving heterogeneous vehicle routing problems using decomposition and set covering
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.10.009openalex-snapshot
A multiple asset-type, collaborative vehicle routing problem with proximal servicing of demands
inferred← citeshttps://doi.org/10.1016/j.jclepro.2020.120590openalex-snapshot
Collaborative two-echelon multicenter vehicle routing optimization based on state–space–time network representation
inferred← citeshttps://doi.org/10.1016/j.multra.2024.100174openalex-snapshot
An assignment-based decomposition approach for the vehicle routing problem with backhauls
inferred← citeshttps://doi.org/10.1016/j.physa.2023.128517openalex-snapshot
Bi-level optimization for customized bus routing serving passengers with multiple-trips based on state–space–time network
inferred← citeshttps://doi.org/10.1016/j.trb.2023.102815openalex-snapshot
Integrated optimization of rolling stock allocation and train timetables for urban rail transit networks: A benders decomposition approach
inferred← citeshttps://doi.org/10.1016/j.trb.2025.103321openalex-snapshot
Integrated cruise fleet deployment and itinerary scheduling problem: An enhanced Benders decomposition approach
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103113openalex-snapshot
Forming coordination group for coordinated traffic congestion management schemes
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103222openalex-snapshot
How many trip requests could we support? An activity-travel based vehicle scheduling approach
inferred← citeshttps://doi.org/10.1016/j.trc.2022.103695openalex-snapshot
Integrated electric logistics vehicle recharging station location–routing problem with mixed backhauls and recharging strategies
inferred← citeshttps://doi.org/10.1016/j.trc.2022.103994openalex-snapshot
Joint optimization of train scheduling and routing in a coupled multi-resolution space–time railway network
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104055openalex-snapshot
Crowdsourced on-demand food delivery: An order batching and assignment algorithm
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104237openalex-snapshot
Single-track railway scheduling with a novel gridworld model and scalable deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.trc.2025.105255openalex-snapshot
Benders decomposition for traveling salesman problem with drone: A space-time-state network perspective
inferred← citeshttps://doi.org/10.1016/j.tre.2020.101891openalex-snapshot
Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102118openalex-snapshot
Green logistics location-routing problem with eco-packages
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102123openalex-snapshot
Two-stage conflict robust optimization models for cross-dock truck scheduling problem under uncertainty
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102562openalex-snapshot
The pickup and delivery problem with synchronized en-route transfers for microtransit planning
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104484openalex-snapshot
Collaborative multicenter delivery and pickup network design with transportation resource configuration and alliance synergy service
inferred← citeshttps://doi.org/10.1016/j.trip.2026.101925openalex-snapshot
Balancing cost and responsiveness: Evaluating operational and geographic scenarios to advance sustainable supply chains with reusable packaging
inferred← citeshttps://doi.org/10.1049/itr2.12136openalex-snapshot
Equity‐oriented vehicle routing optimization for catering distribution services with timeliness requirements
inferred← citeshttps://doi.org/10.1080/00207543.2021.1907628openalex-snapshot
Last-mile delivery efficiency: en route transloading in the parcel delivery industry
inferred← citeshttps://doi.org/10.1080/23249935.2024.2355954openalex-snapshot
Logistics vehicle routing optimisation with synchronised transfer
inferred← citeshttps://doi.org/10.1111/itor.13362openalex-snapshot
A multicommodity pickup and delivery problem with time windows and handling time in the omni‐channel last‐mile delivery
inferred← citeshttps://doi.org/10.1142/s0217595922500269openalex-snapshot
Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
inferred← citeshttps://doi.org/10.1145/3716895.3717003openalex-snapshot
Research on Urban Rail Transit Crew Scheduling Algorithm Based on Branch Pricing Optimization
inferred← citeshttps://doi.org/10.1155/2020/3410481openalex-snapshot
Shunting Strategy for Placing-In and Taking-Out Wagons on Branch-Shaped Freight Operation Network with Simulation Method
inferred← citeshttps://doi.org/10.1371/journal.pone.0279131openalex-snapshot
Solving an airport ground service task assignment problem with an exact algorithm
inferred← citeshttps://doi.org/10.15587/1729-4061.2023.289470openalex-snapshot
Mathematical model of a railroad grain cargo ridesharing service in the form of coalitions in congestion games
inferred← citeshttps://doi.org/10.18517/ijaseit.11.4.11430openalex-snapshot
The Relationship between Overloading and Over Dimension of Freight Vehicle
inferred← citeshttps://doi.org/10.3390/infrastructures10090249openalex-snapshot
Connecting Cities: Solving Optimal-Resource-Distribution Problem Using Critical Range Radius
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.