Solving real-life vehicle routing problems efficiently using tabu search
Annals of Operations Research - Special issue on Tabu search
Multicriteria pickup and delivery problem with transfer opportunity
Computers and Industrial Engineering
The vehicle routing problem
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Transportation Science
The Arc Routing and Scheduling Problem with Transshipment
Transportation Science
Models and Algorithms for Integration of Vehicle and Crew Scheduling
Journal of Scheduling
Hybrid scheduling methods for paratransit operations
Computers and Industrial Engineering
Transshipment and Time Windows in Vehicle Routing
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
Computers and Operations Research
Complex Scheduling (GOR-Publications)
Complex Scheduling (GOR-Publications)
Selected Topics in Column Generation
Operations Research
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company
Computers and Industrial Engineering
Computers and Operations Research
A cooperative strategy for a vehicle routing problem with pickup and delivery time windows
Computers and Industrial Engineering
Scheduling Algorithms
Pickup and Delivery with Split Loads
Transportation Science
INFORMS Journal on Computing
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
INFORMS Journal on Computing
Heuristics for the mixed swapping problem
Computers and Operations Research
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Computers and Operations Research
The Consistent Vehicle Routing Problem
Manufacturing & Service Operations Management
Models for Evaluating and Planning City Logistics Systems
Transportation Science
Solving a rich vehicle routing and inventory problem using column generation
Computers and Operations Research
A tabu search heuristic for the truck and trailer routing problem
Computers and Operations Research
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
The combined manpower-vehicle routing problem for multi-staged services
Expert Systems with Applications: An International Journal
A multi-start evolutionary local search for the two-echelon location routing problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Handbook of Metaheuristics
A metaheuristic for a two echelon location-routing problem
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The capacitated arc routing problem with refill points
Operations Research Letters
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters
A heuristic to solve the synchronized log-truck scheduling problem
Computers and Operations Research
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Scheduling a log transport system using simulated annealing
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper presents a survey of vehicle routing problems with multiple synchronization constraints. These problems exhibit, in addition to the usual task covering constraints, further synchronization requirements between the vehicles, concerning spatial, temporal, and load aspects. They constitute an emerging field in vehicle routing research and are becoming a “hot” topic. The contribution of the paper is threefold: (i) It presents a classification of different types of synchronization. (ii) It discusses the central issues related to the exact and heuristic solution of such problems. (iii) It comprehensively reviews pertinent literature with respect to applications as well as successful solution approaches, and it identifies promising algorithmic avenues.