Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study

Alireza Rashidi Komijan, Danial Delavari

Abstract

The well-known Vehicle Routing Problem (VRP) is to find proper sequence of routes in order to minimize transportation costs. In this paper, a mixed-integer programming model is presented for a food distributer company and the model outputs are to determine the optimal routes and amount of pickup and delivery. In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. The proposed model with respect to real conditions is multi-period and has two different time periods: one for dispatching vehicles to customers and suppliers and the other for receiving  customers’ orders. Time window and split pickup and delivery are considered for perishable products. The proposed model is  nonlinear and will be linearized using exact techniques. At the end, model is solved using GAMS and the sensitivity analysis  is performed. The results indicate that the trend of changes in holding and transportation costs in compared to tardiness and  earliness costs are closed together and are not so sensitive to demand changes.


Keywords

Vehicle routing problem; time window; split pick up and delivery; scheduling

Full Text:

PDF

References

Ai-min, D., Chao, M., Yan-ting, ZH. (2009). Optimizing Research of an Improved Simulated Annealing Algorithm to Soft Time Windows Vehicle Routing Problem with Pick-up and Delivery. Systems Engineering — Theory & Practice, 29(5), 186-192. https://doi.org/10.1016/S1874-8651(10)60049-X

Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A. (2010). Industrial aspects and literature survey: Combined inventory management and routing. Computers & Operations Research, 37(9), 1515-1536. https://doi.org/10.1016/j.cor.2009.11.009

Baldacci, R., Mingozzi, A., Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1-6. https://doi.org/10.1016/j.ejor.2011.07.037

Belfiore, P., Yoshizaki, T.Y. (2013). Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers & Industrial Engineering, 64(2), 589-601. https://doi.org/10.1016/j.cie.2012.11.007

Cacchiani, V., Hemmelmayr, V.C., Tricoire, F., (2012). A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics, 163(1), 53-64. https://doi.org/10.1016/j.dam.2012.08.032

Cattaruzza, D., Absi, N., Feillet, D., Vidal, T. (2014). A memetic algorithm for the Multi Trip Vehicle Routing Problem. European Journal of Operational Research, 236(3), 833-848. https://doi.org/10.1016/j.ejor.2013.06.01

Çetinkaya, C., Karaoglan, I., Gökçen, H. (2013). Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach. European Journal of Operational Research, 230(3), 539-550. https://doi.org/10.1016/j.ejor.2013.05.001

Eksioglu, B., Vural, A.V., Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472-1483. https://doi.org/10.1016/j.cie.2009.05.009

Hasani-Goodarzi, A., Tavakkoli-Moghaddam, R. (2012). Capacitated vehicle routing problem for multi-product crossdocking with split deliveries and pickups. Procedia - Social and Behavioral Sciences, 62, 1360-1365. https://doi.org/10.1016/j.sbspro.2012.09.232

Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W. (2015). Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers & Operations Research, 53, 9-23. https://doi.org/10.1016/j.cor.2014.07.004

Shahin Moghadam, S., Fatemi Ghomi, S.M.T., Karim, B. (2014). Vehicle routing scheduling problem with cross docking and split deliveries. Computers & Chemical Engineering, 69, 98-107. https://doi.org/10.1016/j.compchemeng.2014.06.015

Silva, M.M., Subramanian, A., Satoru Ochi, L. (2015). An iterated local search heuristic for the split delivery vehicle routing problem. Computers & Operations Research, 53, 234-249. https://doi.org/10.1016/j.compchemeng.2014.06.015

Taş, D., Jabali, O., Woensel, T.V. (2014). A Vehicle Routing Problem with Flexible Time Windows. Computers & Operations Research, 52, 39-54. https://doi.org/10.1016/j.cor.2014.07.005

Yu, B., Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 47(2), 166-181. https://doi.org/10.1016/j.tre.2010.09.010

Zhang, S., Lee, C.K.M., Choy, K.L., Ho, W., Ip, W.H. (2014). Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem. Transportation Research Part D: Transport and Environment, 31, 85-99. https://doi.org/10.1016/j.trd.2014.05.015

Abstract Views

1171
Metrics Loading ...

Metrics powered by PLOS ALM




This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License

Universitat Politècnica de València

e-ISSN: 2340-4876     ISSN: 2340-5317   https://doi.org/10.4995/ijpme