The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery—A Case Study

Yi, Junmin; Bortfeldt, Andreas

doi:10.1007/978-3-319-55702-1_47

Cited by 6 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve the problem, a MIP model is applied. Yi and Bortfeldt [9] investigate CVRP with split delivery which is applied using real industrial data for a logistics company. A tabu search algorithm is used to handle their problem.…”

Section: Literature Reviewmentioning

confidence: 99%

A Vehicle Routing Problem Arising in the Distribution of Higher Education Institutions Exam Booklets

Özceylan

2023

Gazi University Journal of Science

View full text Add to dashboard Cite

In this paper, the exam booklet distribution plan for the Higher Education Institutions Exam (HEIE) is studied. The exam booklets distribution should be considered as capacitated vehicle routing problem (VRP). There are vehicles with a certain capacity that are carrying exam boxes and schools where exams are held. Every school has a demand for exam boxes. Therefore, the problem is minimizing the cost/distance of distribution from the depot where exam booklets are kept to the schools with capacitated vehicles. The case of Gaziantep city with 135 nodes (one depot and 134 schools) is considered. To model and solve the problem, a mixed integer programming (MIP) model is developed and applied. Due to the large size of the problem, the VRP tool of Esri ArcGIS (well-known geographic information system (GIS) software) and OR-tool of Google are also applied to get an acceptable solution in a reasonable time. Finally, the proposed three distribution plans are compared to each other and the results are discussed. Our numerical results show that the tools of Esri ArcGIS and OR-tool of Google decrease the total route distance by 8.21% and 3.02% compared to the MIP model, respectively.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Vehicle Routing Problem Arising in the Distribution of Higher Education Institutions Exam Booklets

Özceylan

2023

Gazi University Journal of Science

View full text Add to dashboard Cite

show abstract

“…Additionally, Li et al add a packing material constraint and other process constraints for their industrial scenario in which an average delivery order contains more than 300 boxes to be distributed across the Pearl River Delta region. Yi and Bortfeldt (2018) [5] address the 3L-SDVRP with the same packing constraints as the 3L-CVRP in Gendreau formulation. Only inevitable splits are allowed, i.e., serving a customer in two or more routes is only permitted if not all boxes can be packed into a single loading space.…”

Section: Approaches To 3l-sdvrpmentioning

confidence: 99%

“…However, researches show that if only consider the customer's service time window constraints and split orders, the result will often be that, even if the total volume of the loaded cargoes is smaller than the total volume of the vehicle, it still will not be able to load successfully because of the incorrect loading method and sequence. Aiming at this problem, Andreas Bortfeldt and Yi Junming (2018) [5] studied to expand SDVRP to the problem with three-dimensional (3D) loading constraints (3D-loading Split Delivery Vehicle Routing Problem, 3L-SDVRP) SDVRP. They propose a hybrid algorithm to solve this problem.…”

Section: Introductionmentioning

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

“…VRP is an analysis of problem in routing under various constraints such as time, vehicle's load capacity, product distribution pattern and vehicle size. An example of routing management under vehicle's load capacity constraint is a research byYi and Bortfeldt (2016) andPecin et al (2017), many researchers are interested in studying VRP problems includingEbadati et al (2014), Elhassania and Ahmed (2016), Shafaei (2016), Mohammed et al (2017) and Zuniga et al (2019) which combine the FLP problem and the VRP problem to form the Location Routing Problem (LRP) problem. Because of its interesting characteristics and complexity, many researchers are interested in studying and solving LRP problems including Duhamel et al (2010), Yu et al (2010), Belenguer et al (2011), Derbal et al (2012), Escobar et al (2013), Phongpipattanapan and Dasananda (2013), Prodhon and Prins (2014), Gao et al (2016), Asgari et al (2017), Nadizadeh et al (2017) and Faraji and Nadjafi (2018).…”

mentioning

confidence: 99%

A Mathematical Model for Locating Potential Central Markets and Arranging Transportation Routes for Oil Palm Transportation in the Upper Southern Part of Thailand

Ponatong¹,

Sindhuchao²

2019

J. Eng. Appl. Sci.

View full text Add to dashboard Cite

There is no central market for oil palm in Thailand. Knowing that the central market can help reduce logistic costs and provide a suitable price for oil palm transaction, this research studies a problem of selecting locations of oil palm central markets and constructing vehicle routes for oil palm collection under vehicle speed and capacity limitation with the objective of minimizing the total cost that consists of the vehicle routing cost, the fixed operating cost and the depreciation of the central markets and the vehicles. A mathematic model of the problem is formulated and then validated using comparison and cutting methods. The problem instances are generated from real data of 439 townships of 6 provinces in the upper Southern area of Thailand. Forty-two problems are tested and solved by using a computer software. The computational results show that based on all problem instances, the total cost can be reduced by at least 5.76% when compared to the one of the existing process. In addition with a reduction of the total travel distance, the amount of carbon dioxide emission goes down by at least 13.35%.

show abstract

The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery—A Case Study

Cited by 6 publications

References 12 publications

A Vehicle Routing Problem Arising in the Distribution of Higher Education Institutions Exam Booklets

A Vehicle Routing Problem Arising in the Distribution of Higher Education Institutions Exam Booklets

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

A Mathematical Model for Locating Potential Central Markets and Arranging Transportation Routes for Oil Palm Transportation in the Upper Southern Part of Thailand

Contact Info

Product

Resources

About