相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Real-time demand forecasting for an urban delivery platform
Alexander Hess et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)
Designing pricing and compensation schemes by integrating matching and routing models for crowd-shipping systems
Tho V. Le et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)
On-demand food delivery: a systematic literature review
Arianna Seghezzi et al.
INTERNATIONAL JOURNAL OF LOGISTICS MANAGEMENT (2021)
Crowd-shipping with time windows and transshipment nodes
Giusy Macrina et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
Automated taxis' dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times
Xiao Liang et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2020)
Dynamic optimization strategies for on-demand ride services platform: Surge pricing, commission rate, and incentives
Xiqun (Michael) Chen et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2020)
Crowdsourced Delivery-A Dynamic Pickup and Delivery Problem with Ad Hoc drivers
Alp M. Arslan et al.
TRANSPORTATION SCIENCE (2019)
Dynamic courier routing for a food delivery service
Zachary Steever et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
A survey of models and algorithms for optimizing shared mobility
Abood Mourad et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
The electric autonomous dial-a-ride problem
Claudia Bongiovanni et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Real-time city-scale ridesharing via linear assignment problems
Andrea Simonetto et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)
Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game
Saeid Rasulkhani et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Supply, demand, operations, and management of crowd-shipping services: A review and empirical evidence
Tho V. Le et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)
Provably High-Quality Solutions for the Meal Delivery Routing Problem
Baris Yildiz et al.
TRANSPORTATION SCIENCE (2019)
A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers
Tai-Yu Ma et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2019)
A cumulative service state representation for the pickup and delivery problem with transfers
Monirehalsadat Mahmoudi et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Ridesourcing systems: A framework and review
Hai Wang et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
Dimitris Bertsimas et al.
OPERATIONS RESEARCH (2019)
Service innovation in e-commerce last mile delivery: Mapping the e-customer journey
Yulia Vakulenko et al.
JOURNAL OF BUSINESS RESEARCH (2019)
A survey of dial-a-ride problems: Literature review and recent developments
Sin C. Ho et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2018)
Dynamic autonomous vehicle fleet operations: Optimization-based strategies to assign AVs to immediate traveler demand requests
Michael Hyland et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2018)
Addressing the minimum fleet problem in on-demand urban mobility
M. M. Vazifeh et al.
NATURE (2018)
The time-dependent pickup and delivery problem with time windows
Peng Sun et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2018)
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Javier Alonso-Mora et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2017)
Optimal assignment and incentive design in the taxi group ride problem
Xinwu Qian et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)
A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system
Neda Masoud et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)
The vehicle routing problem: State of the art classification and review
Kris Braekers et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2016)
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
Monirehalsadat Mahmoudi et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2016)
Making dynamic ride-sharing work: The impact of driver and rider flexibility
Mitja Stiglic et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2016)
Dynamic programming based metaheuristics for the dial-a-ride problem
Ulrike Ritzinger et al.
ANNALS OF OPERATIONS RESEARCH (2016)
Rich vehicle routing problems: From a taxonomy to a definition
Rahma Lahyani et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances
Lauri Hame et al.
TRANSPORTATION SCIENCE (2015)
Quantifying the benefits of vehicle pooling with shareability networks
Paolo Santi et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2014)
Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
Kris Braekers et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2014)
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Roberto Baldacci et al.
OPERATIONS RESEARCH (2011)
Variable neighborhood search for the dial-a-ride problem
Sophie N. Parragh et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
Dynamic pickup and delivery problems
Gerardo Berbeglia et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Stefan Ropke et al.
TRANSPORTATION SCIENCE (2009)
The dial-a-ride problem: models and algorithms
Jean-Francois Cordeau et al.
ANNALS OF OPERATIONS RESEARCH (2007)
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
Stefan Ropke et al.
TRANSPORTATION SCIENCE (2006)
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
R Bent et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
A grouping genetic algorithm for the pickup and delivery problem with time windows
G Pankratz
OR SPECTRUM (2005)
Waiting strategies for the dynamic pickup and delivery problem with time windows
S Mitrovic-Minic et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2004)
Solving a practical pickup and delivery problem
H Xu et al.
TRANSPORTATION SCIENCE (2003)
A tabu search heuristic for the static multi-vehicle dial-a-ride problem
JF Cordeau et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2003)
分享论文
