Local search with annealing-like restarts to solve the vehicle routing problem with time windows
Proceedings of the 2002 ACM symposium on Applied computing
Manpower scheduling with time windows
Proceedings of the 2003 ACM symposium on Applied computing
A Development Framework for Rapid Meta-Heuristics Hybridization
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Performance Analysis of a Multiagent Architecture for Passenger Transportation
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
A Study on Genetic Algorithms for the DARP Problem
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Towards Agent-Based Evolutionary Planning in Transportation Systems
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Multi-agent Crisis Management in Transport Domain
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Holonic-Based Environment for Solving Transportation Problems
HoloMAS '09 Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
Stopping and restarting strategy for stochastic sequential search in global optimization
Journal of Global Optimization
Distributed planning for the on-line dial-a-ride problem
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
PDPTW based taxi dispatch modeling for booking service
ICNC'09 Proceedings of the 5th international conference on Natural computation
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Computers and Operations Research
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Operations Research
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
A variable neighborhood search heuristic for tramp ship scheduling
ICCL'11 Proceedings of the Second international conference on Computational logistics
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers and Operations Research
Scalability of dial-a-ride systems—a case study to assess utilities of ubiquitous mass user support
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
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
Software framework for vehicle routing problem with hybrid metaheuristic algorithms
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Optimisation for job scheduling at automated container terminals using genetic algorithm
Computers and Industrial Engineering
Dynamic approach to solve the daily drayage problem with transit time uncertainty
Computers in Industry
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Transportation Science
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In this paper, we propose a metaheuristic to solve the pickup and delivery problem with time windows. Our approach is a tabu-embedded simulated annealing algorithm which restarts a search procedure from the current best solution after several non-improving search iterations. The computational experiments on the six newly-generated different data sets marked our algorithm as the first approach to solve large multiple-vehicle PDPTW problem instances with various distribution properties.