On the public citation graph

Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic

https://doi.org/10.1016/j.tre.2018.07.003
0 signed · 106 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/net.20177openalex-snapshot
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
inferredcites →https://doi.org/10.1007/0-306-48058-1_13openalex-snapshot
Long-Haul Freight Transportation
inferredcites →https://doi.org/10.1007/3-540-49481-2_30openalex-snapshot
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
inferredcites →https://doi.org/10.1007/978-1-4419-1665-5_13openalex-snapshot
Large Neighborhood Search
inferredcites →https://doi.org/10.1007/978-3-642-04039-9openalex-snapshot
Natural Intelligence for Scheduling, Planning and Packing Problems
inferredcites →https://doi.org/10.1007/978-3-642-04143-3_15openalex-snapshot
SMIZE: A Spontaneous Ride-Sharing System for Individual Urban Transit
inferredcites →https://doi.org/10.1007/bf02031946openalex-snapshot
A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
inferredcites →https://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferredcites →https://doi.org/10.1007/s10107-002-0336-8openalex-snapshot
Multistars, partial multistars and the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s11301-008-0036-4openalex-snapshot
A survey on pickup and delivery problems
inferredcites →https://doi.org/10.1016/0191-2615(86)90020-2openalex-snapshot
A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
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/b978-0-08-040806-4.50035-6openalex-snapshot
CONSTRAINT-DIRECTED SEARCH FOR THE ADVANCED REQUEST DIAL-A-RIDE PROBLEM WITH SERVICE QUALITY CONSTRAINTS
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.025openalex-snapshot
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
inferredcites →https://doi.org/10.1016/j.cor.2009.10.003openalex-snapshot
Variable neighborhood search for the dial-a-ride problem
inferredcites →https://doi.org/10.1016/j.cor.2014.10.009openalex-snapshot
A simulated annealing heuristic for the open location-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2015.04.002openalex-snapshot
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
inferredcites →https://doi.org/10.1016/j.ejor.2012.05.028openalex-snapshot
Optimization for dynamic ride-sharing: A review
inferredcites →https://doi.org/10.1016/j.ejor.2012.08.015openalex-snapshot
A review of dynamic vehicle routing problems
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.2003.09.002openalex-snapshot
Waiting strategies for the dynamic pickup and delivery problem with time windows
inferredcites →https://doi.org/10.1016/j.trb.2005.04.002openalex-snapshot
On dynamic pickup and delivery vehicle routing with several time windows and waiting times
inferredcites →https://doi.org/10.1016/j.trb.2011.05.017openalex-snapshot
Dynamic ride-sharing: A simulation study in metro Atlanta
inferredcites →https://doi.org/10.1016/j.trb.2013.08.012openalex-snapshot
Ridesharing: The state-of-the-art and future directions
inferredcites →https://doi.org/10.1016/j.trc.2006.03.002openalex-snapshot
Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries
inferredcites →https://doi.org/10.1016/j.trc.2012.04.014openalex-snapshot
An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads
inferredcites →https://doi.org/10.1016/j.tre.2017.04.007openalex-snapshot
Using bilateral trading to increase ridership and user permanence in ridesharing systems
inferredcites →https://doi.org/10.1016/s0166-218x(01)00338-9openalex-snapshot
A survey of very large-scale neighborhood search techniques
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(99)00016-8openalex-snapshot
Solving the pickup and delivery problem with time windows using reactive tabu search
inferredcites →https://doi.org/10.1016/s0305-0548(03)00158-8openalex-snapshot
A simple and effective evolutionary algorithm for the vehicle routing problem
inferredcites →https://doi.org/10.1057/jors.1994.31openalex-snapshot
Computer Science and Operations Research: New Developments in Their Interfaces
inferredcites →https://doi.org/10.1080/01441647.2011.621557openalex-snapshot
Ridesharing in North America: Past, Present, and Future
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/13658810600816664openalex-snapshot
Ad hoc shared‐ride trip planning by mobile geosensor networks
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1109/tits.2015.2413453openalex-snapshot
A Partition-Based Match Making Algorithm for Dynamic Ridesharing
inferredcites →https://doi.org/10.1142/s0218213002000988openalex-snapshot
PICKUP AND DELIVERY WITH TIME WINDOWS: ALGORITHMS AND TEST CASE GENERATION
inferredcites →https://doi.org/10.1142/s0218213003001186openalex-snapshot
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1201/b18653-3openalex-snapshot
Games and Decisions
inferredcites →https://doi.org/10.1287/opre.1030.0106openalex-snapshot
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
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.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.11.1.50openalex-snapshot
Railyard Modeling: Part II. The Effect of Yard Facilities on Congestion
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.18.2.165openalex-snapshot
A Tactical Planning Model for Rail Freight Transportation
inferredcites →https://doi.org/10.1287/trsc.2014.0535openalex-snapshot
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading
inferredcites →https://doi.org/10.1287/trsc.22.1.1openalex-snapshot
Survey Paper—Time Window Constrained Routing and Scheduling Problems
inferredcites →https://doi.org/10.1287/trsc.29.1.17openalex-snapshot
The General Pickup and Delivery Problem
inferredcites →https://doi.org/10.1287/trsc.31.1.60openalex-snapshot
Heuristic Algorithms for the Handicapped Persons Transportation Problem
inferredcites →https://doi.org/10.2307/2280142openalex-snapshot
Theory of Games and Economic Behavior.
inferredcites →https://doi.org/10.3141/2143-17openalex-snapshot
San Francisco to Silicon Valley, California, Instant Ridesharing with Transfer Hub

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.4669783openalex-extracted
Enhancing the Efficiency of Food Delivery Platforms: A Novel Approach to Motivating Gig Workers' Decision-Making Through Monetary Incentive
inferred← citeshttps://doi.org/10.1002/net.22074openalex-snapshot
A combinatorial auction‐based approach for ridesharing in a student transportation system
inferred← citeshttps://doi.org/10.1007/978-3-030-48439-2_89openalex-snapshot
A Heuristic Solution Approach for the Optimization of Dynamic Ridesharing Systems
inferred← citeshttps://doi.org/10.1007/978-981-99-1245-2_31openalex-snapshot
Online Transportation Order Matching Considering Passenger Priority Using Recency Frequency Monetary Method
inferred← citeshttps://doi.org/10.1007/s10479-023-05474-4openalex-snapshot
Branch and price algorithm for route optimization on customized bus service
inferred← citeshttps://doi.org/10.1007/s10489-021-02887-1openalex-snapshot
Satisfying user preferences in optimised ridesharing services:
inferred← citeshttps://doi.org/10.1007/s42488-023-00099-5openalex-snapshot
Operations management of shared transport: research status and prospect
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106561openalex-snapshot
Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108807openalex-snapshot
Online crowdsourced delivery for urban parcels using private cars under time-dependent travel times
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104950openalex-snapshot
Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105666openalex-snapshot
A data-driven matching algorithm for ride pooling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106669openalex-snapshot
The static ridesharing routing problem with flexible locations: A Norwegian case study
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.10.036openalex-snapshot
Online crowdsourced truck delivery using historical information
inferred← citeshttps://doi.org/10.1016/j.fmre.2021.07.004openalex-snapshot
Collaborative matching of ridesplitting and connection in the ridesourcing market
inferred← citeshttps://doi.org/10.1016/j.rtbm.2026.101691openalex-snapshot
The design of last-mile vehicle routes in the shared economy
inferred← citeshttps://doi.org/10.1016/j.trb.2018.12.009openalex-snapshot
Mechanism design for first-mile ridesharing based on personalized requirements part I: Theoretical analysis in generalized scenarios
inferred← citeshttps://doi.org/10.1016/j.trb.2020.03.011openalex-snapshot
Mechanism design for on-demand first-mile ridesharing
inferred← citeshttps://doi.org/10.1016/j.trb.2025.103282openalex-snapshot
Promoting carpooling on car-hailing platforms: Order allocation and motivating subsidy
inferred← citeshttps://doi.org/10.1016/j.trc.2019.03.023openalex-snapshot
Supply, demand, operations, and management of crowd-shipping services: A review and empirical evidence
inferred← citeshttps://doi.org/10.1016/j.trc.2024.104983openalex-snapshot
Vehicle routing in one-way carsharing service with ridesharing options: A variable neighborhood search algorithm
inferred← citeshttps://doi.org/10.1016/j.trc.2025.105490openalex-snapshot
Consolidation of urban freight transportation and public transit systems: a generic strategic framework using Continuum Approximation
inferred← citeshttps://doi.org/10.1016/j.tre.2019.06.002openalex-snapshot
A dynamic crowdshipping model and daily travel behavior
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102053openalex-snapshot
Nonprofit peer-to-peer ridesharing optimization
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102147openalex-snapshot
Real-time demand forecasting for an urban delivery platform
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102209openalex-snapshot
Designing pricing and compensation schemes by integrating matching and routing models for crowd-shipping systems
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102419openalex-snapshot
Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery
inferred← citeshttps://doi.org/10.1016/j.tre.2022.102809openalex-snapshot
Optimality-guaranteed algorithms on the dynamic shared-taxi problem
inferred← citeshttps://doi.org/10.1016/j.tre.2023.103091openalex-snapshot
To offer or not to offer? The optimal value-insured strategy for crowdsourced delivery platforms
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103688openalex-snapshot
A stochastic ridesharing user equilibrium model with origin-destination-based ride-matching strategy
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104232openalex-snapshot
Dynamic demand-responsive transit scheduling with time-dependent travel times: A joint supply and demand management approach
inferred← citeshttps://doi.org/10.1016/j.tre.2026.104802openalex-snapshot
Dynamic vehicle dispatching for shared-and-autonomous-mobility services with adaptive request assignment
inferred← citeshttps://doi.org/10.1016/j.tre.2026.104819openalex-snapshot
Dynamic scheduling of autonomous buses with platooning
inferred← citeshttps://doi.org/10.1038/s41598-026-35004-8openalex-snapshot
A multi-agent reinforcement learning scheduling algorithm integrating state graph and task graph structural modeling for ride-sharing dispatching
inferred← citeshttps://doi.org/10.1080/19427867.2022.2116674openalex-snapshot
The ridesharing problem without predetermined drivers and riders: formulation and heuristic
inferred← citeshttps://doi.org/10.1080/19427867.2022.2150705openalex-snapshot
Order dispatch optimization with considering flexible one-to-three matching strategy under hybrid ride-hailing service modes
inferred← citeshttps://doi.org/10.1080/23249935.2023.2241570openalex-snapshot
Integration of ridesharing and activity travel pattern generation
inferred← citeshttps://doi.org/10.1080/23249935.2024.2393226openalex-snapshot
Integrating one-to-many peer-to-peer ridesharing and public transit for morning commute on a mobility-as-a-service platform
inferred← citeshttps://doi.org/10.1109/esmarta52612.2021.9515750openalex-snapshot
The Digital Economy of Crowdsourcing: Crowd Shipping Model as E-Business
inferred← citeshttps://doi.org/10.1109/iea.2019.8714847openalex-snapshot
An Adaptive Large Neighborhood Search Heuristic for Dynamic Ridesharing Problem
inferred← citeshttps://doi.org/10.1109/tits.2025.3576796openalex-snapshot
Urban Mobility Redefined: Stochastic Equilibrium and Optimal Car Ownership in Cities With Ridesharing Programs
inferred← citeshttps://doi.org/10.1111/itor.13192openalex-snapshot
Service quality and price competition in crowdsourced delivery markets
inferred← citeshttps://doi.org/10.1145/3366423.3380287openalex-snapshot
When Recommender Systems Meet Fleet Management: Practical Study in Online Driver Repositioning System
inferred← citeshttps://doi.org/10.1177/03611981231155430openalex-snapshot
A Ridepooling Bidding Model Considering Service Quality from the Perspective of Cournot Game Theory
inferred← citeshttps://doi.org/10.2507/ijsimm21-1-co2openalex-snapshot
Simulation-Based Modelling of the Impact of Ridesharing on Urban System
inferred← citeshttps://doi.org/10.3390/app11177996openalex-snapshot
Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches
inferred← citeshttps://doi.org/10.3390/su10114275openalex-snapshot
A Multi-Modal Route Choice Model with Ridesharing and Public Transit
inferred← citeshttps://doi.org/10.3390/su17072975openalex-snapshot
Ridesharing Methods for High-Speed Railway Hubs Considering Path Similarity
inferred← citeshttps://doi.org/10.46254/an11.20210084openalex-snapshot
Freight Matching Strategies in Online Spot Market for Balancing Shipper and Platform Performance
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11712openalex-snapshot
Ridesharing in the era of Mobility as a Service (MaaS): An Activity-based Approach with Multimodality and Intermodality
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.