Distributing Fibre Boards: A Practical Application of the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-dimensional Loading Constraints

Pace, Shannon; Turky, Ayad; Moser, Irene; Aleti, Aldeida

doi:10.1016/j.procs.2015.05.382

Cited by 36 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, a multi-start evolutionary search minimizes the number of used vehicles while another tabu search algorithm minimizes the total travel distance. Pace et al (2015) propose a heuristic based on simulated annealing and an iterated local search for the routing phase. Since they examine the distribution of fibre boards, a specialized loading heuristic based on a depth-first tree search and a balanced loading constraint are necessary.…”

Section: L-vrptwmentioning

confidence: 99%

Advanced loading constraints for 3D vehicle routing problems

2021

View full text Add to dashboard Cite

Given automated order systems, detailed characteristics of items and vehicles enable the detailed planning of deliveries including more efficient and safer loading of distribution vehicles. Many vehicle routing approaches ignore complex loading constraints. This paper focuses on the comprehensive evaluation of loading constraints in the context of combined Capacitated Vehicle Routing Problem and 3D Loading (3L-CVRP) and its extension with time windows (3L-VRPTW). To the best of our knowledge, this paper considers the currently largest number of loading constraints meeting real-world requirements and reducing unnecessary loading efforts for both problem variants. We introduce an approach for the load bearing strength of items ensuring a realistic load distribution between items. Moreover, we provide a new variant for the robust stability constraint enabling better performance and higher stability. In addition, we consider axle weights of vehicles to prevent overloaded axles for the first time for the 3L-VRPTW. Additionally, the reachability of items, balanced loading and manual unloading of items are taken into account. All loading constraints are implemented in a deepest-bottom-left-fill algorithm, which is embedded in an outer adaptive large neighbourhood search tackling the Vehicle Routing Problem. A new set of 600 instances is created, published and used to evaluate all loading constraints in terms of solution quality and performance. The efficiency of the hybrid algorithm is evaluated by three well-known instance sets. We outperform the benchmarks for most instance sets from the literature. Detailed results and the implementation of loading constraints are published online.

show abstract

Section: L-vrptwmentioning

confidence: 99%

Advanced loading constraints for 3D vehicle routing problems

2021

View full text Add to dashboard Cite

show abstract

“…According to Table I, Pace et al (2015)'s work is the only one among the existing studies, which has studied 3L-CVRP considering time windows. Their work was inspired by a particular case of distributing fiber boards.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The model regards time windows in making routing decisions. Comparing with Pace et al (2015), in our modeling, the loading constraints are generic enough to be applied to a broad range of settings.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Ayough

Khorshidvand²,

Massomnedjad³

et al. 2020

JM2

View full text Add to dashboard Cite

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.

show abstract

“…The cargos of the customers are first packed on identical pallets that are then loaded onto vehicles. The practical application of Distributing fibred boards is studied by Pace et al (2015) [26], and time windows and three-dimensional loading constraints was considerate in this paper.…”

Section: Approaches To 3l-vrptwmentioning

confidence: 99%

The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints

et al. 2020

View full text Add to dashboard Cite

Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.

show abstract

Distributing Fibre Boards: A Practical Application of the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-dimensional Loading Constraints

Cited by 36 publications

References 17 publications

Advanced loading constraints for 3D vehicle routing problems

Advanced loading constraints for 3D vehicle routing problems

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

The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints

Contact Info

Product

Resources

About