Mathematical Models for Milk Dispatching Problem

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Transportation and Logistics
Volume:6 Issue:2
Mathematical Models for Milk Dispatching Problem

Mathematical Models for Milk Dispatching Problem

Authors : Damla YÜKSEL, Damla KIZILAY, Hande ÖZTOP, Sinem ÖZKAN

Pages : 217-235

View : 43 | Download : 9

Publication Date : 2021-10-31

Article Type : Research Paper

Abstract :This study considers the milk dispatching problem for a small-sized distribution company. The milk dispatching problem can be seen in many real-life applications. Under a social responsibility project, several organizations, including companies and municipalities, distribute bottled milk for children to primary schools and impoverished families without any charge. These companies generally use capacitated vehicles for distribution and should consider available hours of the schools as well as the families. The planners generally want to minimize their expenses, such as fuel oil and storage costs. Under those restrictions, the problem turns out to be a capacitated vehicle routing problem with time windows insert ignore into journalissuearticles values(CVRPTW);. One of the main objectives is to minimize total traveled distance considering the vehicle type to reduce the fuel consumption of the vehicles. Another objective is to minimize serving the customers late to reduce the storage cost of undelivered milk. To achieve those objectives, we formulated mixed-integer linear programming insert ignore into journalissuearticles values(MILP); and constraint programming insert ignore into journalissuearticles values(CP); models for the problem. To verify and compare our mathematical models, we modified well-known instances from the literature, including problem-specific parameters. The comprehensive computational results show that both models are very competitive for the problem. However, it should be noted that the MILP model outperforms the CP model in terms of solution quality and CPU time for the instances with a long planning horizon.
Keywords : Milk Dispatching Problem, Capacitated Vehicle Routing Problem with Time Windows, Mixed Integer Linear Programming Model, Constraint Programming Model

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.