Computers and Operations Research
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
An overview of vehicle routing problems
The vehicle routing problem
The vehicle routing problem
Introduction to Algorithms
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Solving a Practical Pickup and Delivery Problem
Transportation Science
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
A hybrid method based on linear programming and tabu search for routing of logging trucks
Computers and Operations Research
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Journal of Scheduling
Large Neighborhood Search Using Constraint Satisfaction Techniques in Vehicle Routing Problem
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
A cooperative and self-adaptive metaheuristic for the facility location problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Variable neighborhood search for the dial-a-ride problem
Computers and Operations Research
Engineering Applications of Artificial Intelligence
Efficient management of transportation logistics related to animal disease outbreaks
Computers and Electronics in Agriculture
A set covering approach for the pickup and delivery problem with general constraints on each route
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Scheduling technicians and tasks in a telecommunications company
Journal of Scheduling
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
Transportation Science
On the potentials of parallelizing large neighbourhood search for rich vehicle routing problems
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
The capacitated vehicle routing problem with stochastic demands and time windows
Computers and Operations Research
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Computers and Operations Research
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
Transportation Science
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes
INOC'11 Proceedings of the 5th international conference on Network optimization
The pickup and delivery problem with cross-docking opportunity
ICCL'11 Proceedings of the Second international conference on Computational logistics
Synchronized arc routing for snow plowing operations
Computers and Operations Research
A genetic algorithm for the simultaneous delivery and pickup problems with time window
Computers and Industrial Engineering
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers and Operations Research
Guided ejection search for the pickup and delivery problem with time windows
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
The inventory-routing problem with transshipment
Computers and Operations Research
On the impact of real-time information on field service scheduling
Decision Support Systems
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Simple temporal problems in route scheduling for the dial---a---ride problem with transfers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Heuristics for the multi-item capacitated lot-sizing problem with lost sales
Computers and Operations Research
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Computers and Operations Research
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Computers and Operations Research
Truck and trailer routing-Problems, heuristics and computational experience
Computers and Operations Research
Computers and Operations Research
An augmented large neighborhood search method for solving the team orienteering problem
Expert Systems with Applications: An International Journal
Generation of VNS components with grammatical evolution for vehicle routing
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
A Multi-agent Based Self-adaptive Genetic Algorithm for the Long-term Car Pooling Problem
Journal of Mathematical Modelling and Algorithms
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
Computers and Operations Research
The consultation timetabling problem at Danish high schools
Journal of Heuristics
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Transportation Science
Plan quality optimisation via block decomposition
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computers and Operations Research
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
Journal of Heuristics
Hi-index | 0.00 |
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route, and such that a pickup is performed before the corresponding delivery. The routes must also satisfy time window and capacity constraints. This paper presents a heuristic for the problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows. The proposed heuristic is composed of a number of competing subheuristics that are used with a frequency corresponding to their historic performance. This general framework is denoted adaptive large neighborhood search. The heuristic is tested on more than 350 benchmark instances with up to 500 requests. It is able to improve the best known solutions from the literature for more than 50% of the problems. The computational experiments indicate that it is advantageous to use several competing subheuristics instead of just one. We believe that the proposed heuristic is very robust and is able to adapt to various instance characteristics.