Vehicle routing with split deliveries
Discrete Applied Mathematics
The vehicle routing problem
Ship Routing and Scheduling: Status and Perspectives
Transportation Science
A computer-based decision support system for vessel fleet scheduling: experience and future research
Decision Support Systems
Rendezvous Search on the Labeled Line
Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems
Transportation Science
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
Hi-index | 0.00 |
This paper presents a planning problem faced by many shipping companies dealing with the transport of bulk products. These shipping companies typically have a certain amount of contract cargoes that they are committed to carry, while trying to maximize their profit from optional spot cargoes. The cargo quantities are often flexible within an interval. Therefore, interwoven with the routing and scheduling decisions, the planner also has to decide the optimal cargo quantities. A tabu search algorithm embedding a specialized heuristic for deciding the optimal cargo quantities in each route is proposed to solve the problem. Computational results show that the heuristic gives optimal or near-optimal solutions to real-life cases of the problem within reasonable time. It is also shown that utilizing the flexibility in cargo quantities gives significantly improved solutions.