An integrated approach for three-dimensional capacitated vehicle routing problem considering time windows

Abstract

Purpose As a critical problem in sophisticated distribution systems, vehicle routing plays a pivotal role in dealing with time windows and capacities constraints. The purpose of this paper is to addresses a new integrated model to incorporate both three-dimensional and time windows aspects of the routing problem. First, capacitated vehicle routing decisions are made subject to a soft time interval to meet the customers’ demands. Afterward, these decisions are entered into the three-dimensional loading problem. Design/methodology/approach The problem is solved using generalized algebraic modeling system software in small-size problems. The problem is NP-hard and requires an efficient solution methodology. For this purpose, a hybrid algorithm has been proposed to solve the large-size problems. The efficiency of this algorithm is checked by making comparisons with exact solutions for small and medium size test problems, and with the related literature for large size problems. Findings The numerical experiments show that the proposed model covers more effectively the broader aspects of the transportation problem. Furthermore, the proposed algorithm supports competitive and satisfactory results by giving reasonable outputs in comparison with previous studies. Originality/value The main purpose of this integration is to achieve minimum total transportation costs, which cannot be guaranteed without applying two referred constraints, simultaneously.

A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery

“…Reference [36] investigated a vehicle routing problem with three-dimensional loading constraints and mixed backhauls (3L-VRPMB) and proposed a hybrid metaheuristic consisting of a reactive tabu search for the routing problem and different packing heuristics for the loading problem. Reference [37] proposed a new integrated model to incorporate both the three-dimensional and time window aspects of the routing problem (3L-CVRPTW), developing a two-stage algorithm solve it. In the first stage, a simulated annealing algorithm was used to determine the number of vehicles required, the number of routes, the order of the service, and each node's service time; then, these decisions were entered three-dimensional loading problem.…”

A reliable location-inventory-routing three-echelon supply chain network under disruption risks

“…If these routes and transportation methods are not accompanied by proper timing and timely delivery, it will increase production and distribution costs and customer dissatisfaction. Taking it into consideration, Ayough et al (2020) address a new integrated model considering both three-dimensional and time windows features of the routing problem as a severe problem in complex distribution systems. They solved the problem using a hybrid algorithm.…”

Research and application of order carpooling method for improving the loading rate of cigarette industry enterprises

“…At present, the tobacco industry mainly carries out order carpooling decision-making, truck scheduling and other work through manual experience judgment. There are many problems in this mode: (1) The order processing takes a long time; (2) The truck loading rate is low; (3) It is difficult to make business decisions; (4) Truck scheduling is difficult.…”

“…Researchers have studied the issue of cigarette delivery. For example, the research on order carpooling includes: 3L-CVRP [1][2][3] , carpool path planning [4] , merging orders [5] , considering the connectivity and dynamic unloading time [6][7] , etc. The research on improving truck loading rate includes: loading optimization [8][9] , modeling of truck non full or full load [10] , optimizing cargo loading and distribution path [11][12] , using cage cars [13] , optimizing the distribution schedule [14] , analyzing the growth of special-shaped cigarette sales [15] , establishing scheduling system for multi-point warehouse [16] , etc.…”