Related references
Note: Only part of the references are listed.The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation
Zefeng Lyu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)
The pickup and delivery problem with time windows, multiple stacks, and handling operations
Marilene Cherkesly et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Armando Honorio Pereira et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)
Evolutionary neural network for learning of scalable heuristics for pickup and delivery problems with time windows
Sungbum Jun et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2022)
The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
David Wolfinger et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm
Hyungbin Park et al.
EXPERT SYSTEMS WITH APPLICATIONS (2021)
A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery
Reza Shahabi-Shahmiri et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2021)
A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem
Xingbin Zhan et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)
Assignment of attribute weights with belief distributions for MADM under uncertainties
Mi Zhou et al.
KNOWLEDGE-BASED SYSTEMS (2020)
A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading
Bo Peng et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2020)
A periodic optimization approach to dynamic pickup and delivery problems with time windows
Farzaneh Karami et al.
JOURNAL OF SCHEDULING (2020)
Dynamic courier routing for a food delivery service
Zachary Steever et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
A probabilistic approach to pickup and delivery problems with time window uncertainty
Peter Gyorgyi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
A multi-start heuristic for the ship routing and scheduling of an oil company
Denise Yamashita et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2019)
A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers
Zhihao Peng et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2019)
Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windows
Azadeh Ahkamiraad et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2018)
Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach
Onder Belgin et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2018)
A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
N. Danloup et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
Lin Zhu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
Gregorio Tirado et al.
ANNALS OF OPERATIONS RESEARCH (2017)
A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
Philippe Grangier et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations
F. Neves-Moreira et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
Marilene Cherkesly et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Exact approaches for the pickup and delivery problem with loading cost
Li Xue et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (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)
Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO
Voratas Kachitvichyanukul et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2015)
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
Marilene Cherkesly et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
The multiple vehicle pickup and delivery problem with LIFO constraints
Enrique Benavent et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
Renaud Masson et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
New mixed integer-programming model for the pickup-and-delivery problem with transshipment
A. Rais et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Real-time control of express pickup and delivery processes in a dynamic environment
Francesco Ferrucci et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2014)
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Renaud Masson et al.
TRANSPORTATION SCIENCE (2013)
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Gunes Erdogan et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Yuan Qu et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
Brenda Cheang et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)
Dynamic pickup and delivery problems
Gerardo Berbeglia et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
Cristian E. Cortes et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)