In this paper, we discuss the real-world Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) for drilling rig routing in Siberia and the Far East. There is a set of objects (exploration sites) requiring well-drilling work. Each object includes a known number of planned wells and needs to be served within a given time interval. Several drilling rigs can operate at the same object simultaneously, but their number must not exceed the number of wells planned for this object. A rig that has started the work on a well completes it to the end. The objective is to determine such a set of rig routes (including the number of assigned wells for each object) to perform all well-drilling requests, respecting the time windows, that minimizes the total traveling distance. The main difference with traditional SDVRP is that it is the service time that is split, not the demand.
We propose a mixed-integer linear programming (MILP) model for this problem. To find high-quality solutions, we design the Variable Neighborhood Search based matheuristic. Exact methods are incorporated into a local search to optimize the distribution of well work among the rigs. Time-window constraints are relaxed, allowing infeasible solutions during the search, and evaluation techniques are applied to treat them. Results of computational experiments for the algorithm and a state-of-the-art MILP solver are discussed.
Logistics Uncapacitated vehicles Split delivery service Time windows Metaheuristics Mathematical models Optimization problems
This is a preview of subscription content, log in to check access.
Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997)zbMATHGoogle Scholar
Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., Vigo, D.: Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management. Transp. Sci. 48, 103–120 (2014)CrossRefGoogle Scholar
Ho, S., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)CrossRefGoogle Scholar
Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270–287 (2008)MathSciNetCrossRefGoogle Scholar
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)CrossRefGoogle Scholar
Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)zbMATHGoogle Scholar
Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475–489 (2013)MathSciNetCrossRefGoogle Scholar
Yakici, E., Karasakal, O.: A min-max vehicle routing problem with split delivery and heterogeneous demand. Optim. Lett. 7, 1611–1625 (2013)MathSciNetCrossRefGoogle Scholar