On Vehicle Routing Problems (VRP) with a Focus on Multiple Priorities
- 1 Department of Mathematics, Ekiti State University, Ado Ekiti, Nigeria
- 2 Department of Mathematics, Ekiti State University, Ado Ekiti, Nigeria
- 3 College of Education, Ikere Ekiti, Nigeria
Abstract
This paper discusses the concept of priorities based on Time and Quantity, which arise on the occasion of vehicle routing. It explains the interconnectivity between the priorities based on Time and Quantity and formulates a dynamic that shows the fusion of Time and Quantity into the Vehicle Routing Problem’s objective function. The paper focuses on the development of an expanded VRP objective function in which the priorities based on Time and Quantities are imbedded thus opens a vista of knowledge, aggregating and modelling the priorities as a mean to reduce transportation costs that lead to an organized and more timely deliveries of goods employing various of today’s proposed logistic systems coupled with widely used positioning systems.
- Eliana, M.T., Antonio, H., Escobar, Z. and Mauricio, G.E. (2015) Literature Review on the Vehicle Routing Problem in the Green Transportation Context.
- Nathalie, D.J., Mieke, D. and Inneke, V.N. (2006) The Vehicle Routing Problem: State of the Art Classification and Review. Research Center for Operations Management, Department of Decision Sciences and information Management, Faculty of Economics and Business, KU Leuven, Belgium.
- Larsen, J. (2004) Refinements of the Column Generation Process for the Vehicle Routing Problem with Time Windows. Journal of Systems Science and Systems Engineering, 13, 326-341. https://doi.org/10.1007/s11518-006-0168-9
- Gintaras, V. (2014) Genetic Algorithm for Vehicle Routing Problem. Doctoral Dissertation, Technological Sciences, Informatics Engineering (07 T).
- Christofides, N., Mingozzi, A. and Toth, P. (1976) Combinatorial Optimization. John Wiley & Sons, Hoboken.
- Russell, R.A. and Chiang, W.C. (2006) Scatter Search for the Vehicle Routing Problem with Time Windows. European Journal of Operational Research, 169, 606-622. https://doi.org/10.1016/j.ejor.2004.08.018
- Wen, M. (2010) Rich Vehicle Routing Problems and Applications. PhD Thesis, DTU Management, Lyngby, No. 8.
- Fuegenschuh, A. (2009) Solving a School Bus Scheduling Problem with Integer Programming. European Journal of Operational Research, 193, 867-884. https://doi.org/10.1016/j.ejor.2007.10.055
- Kim, B., Kim, S. and Sahoo, S. (2006) Waste Collection Vehicle Routing Problem with Time Windows. Computers & Operations Research, 33, 3624-3642. https://doi.org/10.1016/j.cor.2005.02.045
- Weigel, D. and Cao, B. (1999) Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems. Interfaces, 29, 112-130. https://doi.org/10.1287/inte.29.1.112
- Braysy, O., Nakari, P., Dullaert, W. and Neittaanmaki, P. (2009) An Optimization Approach for Communal Home Meal Delivery Service: A Case Study. Journal of Computational and Applied Mathematics, 232, 46-53. https://doi.org/10.1016/j.cam.2008.10.038
- Cornillier, F., Laporte, G., Boctor, F.F. and Renaud, J. (2009) The Petrol Station Replenishment Problem with Time Windows. Computers & Operations Research, 36, 919-935. https://doi.org/10.1016/j.cor.2007.11.007
- Beltrami, E.J. and Bodin, L.D. (1974) Networks and Vehicle Routing for Municipal Waste Collection. Networks, 4, 65-94. https://doi.org/10.1002/net.3230040106