Related references
Note: Only part of the references are listed.The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations
Alessandro Bombelli et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2022)
The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times
Marlin W. Ulmer et al.
TRANSPORTATION SCIENCE (2021)
Memetic search for vehicle routing with simultaneous pickup-delivery and time windows
Shengcai Liu et al.
SWARM AND EVOLUTIONARY COMPUTATION (2021)
Multi-start heuristics for the profitable tour problem
Kasi Viswanath Dasari et al.
SWARM AND EVOLUTIONARY COMPUTATION (2021)
An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem
Ilhan Ilhan
SWARM AND EVOLUTIONARY COMPUTATION (2021)
A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems
Eneko Osaba et al.
SWARM AND EVOLUTIONARY COMPUTATION (2021)
A firefly algorithm for the environmental prize-collecting vehicle routing problem
Dimitra Trachanatzi et al.
SWARM AND EVOLUTIONARY COMPUTATION (2020)
A periodic optimization approach to dynamic pickup and delivery problems with time windows
Farzaneh Karami et al.
JOURNAL OF SCHEDULING (2020)
A Discrete and Improved Bat Algorithm for solving a medical goods distribution problem with pharmacological waste collection
Eneko Osaba et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion
Nasser R. Sabar et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space
Michal Okulewicz et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
An artificial bee colony algorithm with a Modified Choice Function for the traveling salesman problem
Shin Siang Choong et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
A Multi Ant System based hybrid heuristic algorithm for Vehicle Routing Problem with Service Time Customization
Yuan Wang et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem
Luciano P. Cota et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
Event-driven optimal control for a robotic exploration, pick-up and delivery problem
Vladislav Nenchev et al.
NONLINEAR ANALYSIS-HYBRID SYSTEMS (2018)
A tissue P system based evolutionary algorithm for multi-objective VRPTW
Wenbo Dong et al.
SWARM AND EVOLUTIONARY COMPUTATION (2018)
Dynamic Vehicle Routing Problems: Three Decades and Counting
Harilaos N. Psaraftis et al.
NETWORKS (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)
Distribution of waiting time for dynamic pickup and delivery problems
Stefan Vonolfen et al.
ANNALS OF OPERATIONS RESEARCH (2016)
A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach
Diego Munoz-Carpintero et al.
TRANSPORTATION SCIENCE (2015)
The dynamic vehicle routing problem: Solution with hybrid metaheuristic approach
Jalel Euchi et al.
SWARM AND EVOLUTIONARY COMPUTATION (2015)
Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees
Sumaiya Iqbal et al.
SWARM AND EVOLUTIONARY COMPUTATION (2015)
Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
M. Schilde et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
A Bumble Bees Mating Optimization algorithm for the Open Vehicle Routing Problem
Yannis Marinakis et al.
SWARM AND EVOLUTIONARY COMPUTATION (2014)
Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
Kyle Treleaven et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2013)
The urban bus routing problem in the Tunisian case by the hybrid artificial ant colony algorithm
Jalel Euchi et al.
SWARM AND EVOLUTIONARY COMPUTATION (2012)
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
M. Schilde et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
Dynamic pickup and delivery problems
Gerardo Berbeglia et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)
A decision support model for establishing an air taxi service: a case study
K. Fagerholt et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2009)
Anticipatory algorithms for same-day courier dispatching
Gianpaolo Ghiani et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2009)
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
Francesco Carrabs et al.
INFORMS JOURNAL ON COMPUTING (2007)
Static pickup and delivery problems: a classification scheme and survey
Gerardo Berbeglia et al.
TOP (2007)
Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries
Michel Gendreau et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2006)
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
S Mitrovic-Minic et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2004)
Waiting strategies for the dynamic pickup and delivery problem with time windows
S Mitrovic-Minic et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2004)
An exact algorithm for the multiple vehicle pickup and delivery problem
Q Lu et al.
TRANSPORTATION SCIENCE (2004)