Vehicle Routing with Compartments Under Product Incompatibility Constraints

Taşar, Bahar; Eliiyi, Deniz Türsel; Kandiller, Levent

doi:10.7307/ptt.v31i1.2670

Cited by 7 publications

(7 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Simultaneously, they also optimize the number of vehicles used in their problem. Tasar et al (2019) determined the optimal number of vehicles to minimize the fixed and fuel costs. Similarly, Aggarwal and Kumar (2019) established the objective to drop their transportation cost and cost for the availability of vehicles and determine the optimal vehicle number.…”

Section: Literature Reviewmentioning

confidence: 99%

Clustering Algorithm for a Vehicle Routing Problem With Time Windows

Nguyen

Oláh

et al. 2022

Transport

View full text Add to dashboard Cite

The demand for daily food purchases has increased dramatically, especially during the Covid-19 pandemic. This requires suppliers to face a huge and complex problem of delivering products that meet the needs of their customers on a daily basis. It also puts great pressure on managers on how to make day-to-day decisions quickly and efficiently to both satisfy customer requirements and satisfy capacity constraints. This study proposes a combination of the cluster-first –route-second method and k-means clustering algorithm to deal with a large Vehicle Routing Problem with Time Windows (VRPTW) in the logistics and transportation field. The purpose of this research is to assist decision-makers to make quick and efficient decisions, based on optimal costs, the number of vehicles, delivery time, and truck capacity efficiency. A distribution system of perishable goods in Vietnam is used as a case study to illustrate the effectiveness of our mathematical model. In particular, perishable goods include fresh products of fish, chicken, beef, and pork. These products are packed in different sizes and transferred by vehicles with 1000 kg capacity. Besides, they are delivered from a depot to the main 39 customers of the company with arrival times following customers’ time window. All of the data are collected from a logistics company in Ho Chi Minh city (Vietnam). The result shows that the application of the clustering algorithm reduces the time for finding the optimal solutions. Especially, it only takes an average of 0.36 s to provide an optimal solution to a large Vehicle Routing Problem (VRP) with 39 nodes. In addition, the number of trucks, their operating costs, and their utilization are also shown fully. The logistics company needs 11 trucks to deliver their products to 39 customers. The utilization of each truck is more than 70%. This operation takes the total costs of 6586215.32 VND (Vietnamese Dong), of which, the transportation cost is 1086215.32 VND. This research mainly contributes an effective method for enterprises to quickly find the optimal solution to the problem of product supply.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Clustering Algorithm for a Vehicle Routing Problem With Time Windows

Nguyen

Oláh

et al. 2022

Transport

View full text Add to dashboard Cite

show abstract

“…Mixed-integer programming is used popularly in formulating a model of the VRP. For example, Aggarwal, D., and Kumar, V. (2019) and Tasar, B., et al (2019) used an MIP to model their problems with a large number of nodes. For more complexity in the constraints and variables of the VRP, MIP also develops into Mixed-Integer Linear Programming (MILP).…”

Section: Literature Reviewmentioning

confidence: 99%

“…In addition to forming mathematical models, previous studies have applied or developed an efficient algorithm to search for solutions quickly. To find optimal solutions, algorithms include the following: an estimation of distribution, heuristic, artificial bee colony, local search, response surface method, biased random-key genetic, exact branch-price-andcut algorithm, tabu search, and simulated annealing (Qi and Hu, 2020;Kantawong and Pravesjit, 2020;Londoño et al, 2020;Aggarwal and Kumar, 2019;Pérez-Rodríguez and Hernández-Aguirre, 2019;Tasar et al, 2019;Setamanit, 2019Zhu andHu, 2019;Ruiz et al, 2019;Zhang et al, 2017;Huang et al, 2017;Afifi et al, 2016;Spliet and Desaulniers, 2015).…”

Section: Literature Reviewmentioning

confidence: 99%

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

Nguyen

Oláh

et al. 2020

Production Engineering Archives

View full text Add to dashboard Cite

This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

show abstract

“…fleet size), and the route planning at the same time. That is, the number and locations of distribution points are not known in advance, while for traditional VRP / VRPTW, the number and locations of distribution points are predetermined [21]. Mobile parcel lockers are rarely studied.…”

Section: Problem Formulationmentioning

confidence: 99%

A Scheduling Strategy of Mobile Parcel Lockers for the Last Mile Delivery Problem

Wang

Chen

2020

PROMET

View full text Add to dashboard Cite

In the form of unattended Collection-and-Delivery Points (CDP), the fixed parcel lockers can save courier miles and improve the delivery efficiency. However, due to the fixed location and combination, the fixed parcel locker cannot accommodate the change of demands effectively. In this paper, an approach to supplementing fixed lockers by mobile parcel lockers to meet the demands of the last mile delivery has been proposed. With the goal of minimizing the operating cost, the location and route optimization problems of mobile parcel lockers are integrated into a non-linear integer programming model. An embedded GA has been developed to optimally determine the locations of distribution points, the number of mobile parcel lockers needed by each distribution point and the schedules and routes of mobile parcel lockers, simultaneously. Finally, a numerical example is given to compare the optimization results of the schemes with and without the aggregation problem. The results show that the scheme with the aggregation problem can greatly save the delivery time. However, for the scheme without the aggregation problem, time windows are more continuous, so it saves the number of vehicles.

show abstract

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Cited by 7 publications

References 34 publications

Clustering Algorithm for a Vehicle Routing Problem With Time Windows

Clustering Algorithm for a Vehicle Routing Problem With Time Windows

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

A Scheduling Strategy of Mobile Parcel Lockers for the Last Mile Delivery Problem

Contact Info

Product

Resources

About