A Customized Bi-Objective Location-Routing Problem for Locating Post Offices and Delivery of Post Parcels

Document Type : Research Paper

Authors

Department of Industrial Engineering Faculty of Industrial Engineering South Tehran Branch Islamic Azad University Tehran, Iran

Abstract

One of the most important problems for distribution companies is to find the best locations for depots and to find proper routes for transportation vehicles and to optimize supply network. This study intends to develop a model for the problem of location-routing in post offices. So, a new Bi-Objective Location-Routing Problem for Locating Town Post Office and Routing Parcels is defined. This problem is modeled through mixed-integer mathematical programming. The aim of proposed model is to select potential post offices and to find optimal routes for transportation vehicles while time constraints are taken into account. The proposed model is applied in a real case study including eight main post area and 21 regional offices in Tehran, Iran. A goal programming approach is proposed to solve this bi-objective optimization model. The GAMS Software is used to code and solve the associated mathematical model. Some required parameters of the model such as demands are estimated using Geographical Information System (GIS) and simulation methods. The results of proposed model including the objective functions, decision variables, and proposed routing of vehicles have been compared with the existing practical solutions. Sensitivity analysis on main parameters of proposed models is accomplished and the results are analyzed. This comparison illustrate the efficacy and applicability of proposed approach.

Keywords

Main Subjects

References

Bruns, A., Klose, A., Staghly, P., 2000. Restructuring of Swiss parcel delivery services. OR          Spektrum  22, 285–302.
Chan, Y ., Baker, S., 2005.The multiple depot, multiple traveling salesmen facility-location           problem: Vehicle range, service frequency and heuristic implementations.      Mathematical and Computer Modelling 41,1035-1053.
Charnes, A., Cooper, WW., Ferguson, R. (1955) Optimal estimation of executive compensation by linear programming, Management Science, 1, 138-151.
Charnes, A., Cooper, WW., (1961) Management models and industrial applications of linear programming, Wiley, New York.
De Camargo, R., de Miranda, G., kketangen,A.,2013.A new formulation and an exact approach   for the many-to-many hub location-routing problem. Applied Mathematical            Modelling, 37,7468-7480.
Govindan, K., Jafarian, A., Khodaverdi, R., Devika,K.,2014. Two-echelon multiple-vehicle          location-routing problem with time windows for optimization of sustainable supply chain network of perishable food . International Journal of Production Economics,        152,9-28.
Hashemi Doulabi, S., Seifi,A.,2013.Lower and upper bounds for location-arc routing problems     with vehicle capacity constraints. European Journal of Operational Research,      224,189-208.
Hosseininezhad, S.J., Jabalameli, M.S. (2016). A multi-objective continuous covering location model. Journal of Industrial and Systems Engineering, 9(2), Article in press.
Ignizio, JP (1976) Goal programming and extensions, Lexington Books, Lexington, MA.
Ignizio, JP., Cavalier, TM (1994) Linear programming, Prentice Hall.
Jarboui, B., Derbel,H., Hana,S., Mladenovi,N.,2013.Variable neighborhood search for location             routing.Computers& Operations Research,40,47-55.
Jones DF, Tamiz M (2010) Practical Goal Programming, Springer Books.
Kordjazi, M., Kazemi, A. (2016). Presenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model, Journal of Industrial and Systems Engineering, 9(2), Article in press.
Laporte, G., Nobert, Y., 1981. An exact algorithm for minimizing routing and operating costs       in depot location. European Journal of Operational Research 6, 224–226.
Laporte, G., Nobert, Y., Pelletier, P., 1983. Hamiltonian location problems. European Journal       of Operational Research 12, 82–89.
Laumanns,M., Thiele,L., Zitzler,E.,2006. An efficient, adaptive parameter variation scheme          for metaheuristics based on the epsilon-constraint method.European Journal of            Operational Research, 169,932-942.
Lee, SM (1972) Goal programming for decision analysis, Auerback, Philadelphia.
Lischak, C., Triesch, E., 2008. Location planning for a parcel delivery service.
Mohamadi, A., Yaghoubi, S. (2016). A new stochastic location-allocation emergency medical services healthcare system model during major disaster, Journal of Industrial and Systems Engineering, 9(2), Article in press.
Maranzana, F.E., 1964.On the location of supply points to minimize transport        costs.Operational Research Quarterly 15,261-270.
Nadizadeh,A.,2009.Using greedy clustering method to solve capacitated location-routing             problem.Direcci_on y Organizaci_on, 39,79-85.
Pareto, V. (1896).Course of Political Economy.
Rath,S.,Gutjahr,W.,2014. A math-heuristic for the warehouse location-routing problem in             disaster relief.Computers& Operations Research, 42,25-39.
Rawls, J. (1973). Some ordinalist-utilitarian notes on Rawls's theory of justice. The Journal of Philosophy, 70(9), 245-263.
Rieck,J., Ehrenberg,C., Zimmermann,J.,2014. Many-to-many location-routing with inter-hub        transport and multi-commodity pickup-and-delivery. European Journal of Operational     Research,263,863-878.
Romero, C (1991) Handbook of critical issues in goal programming, Pergamon Press, Oxford.
Stenger,A., Schneider,M., Schwind,M., Vigo,D.,2012.Location routing for small package             shippers with subcontracting options.International Journal of Production Economics,       140,702-712.
Ting, C, J., Chen,C,A,2013 .A multiple ant colony optimization algorithm for the capacitated       location routing problem. International Journal of Production Economics, 141,34-44.
Wasner, M., Zapfel, G., 2004.An integrated multi-depot hub location vehicle routing model          for network planning of parcel service. International Journal of Production Economics   90,403–419.
Zare Mehrjerdi,Y., Nadizadeh,A.,2013.Using greedy clustering method to solve capacitated         location-routing problem with fuzzy demands. European Journal of Operational       Research, 229,75-84.

Files

History

  • Receive Date: 17 March 2016
  • Revise Date: 19 July 2016
  • Accept Date: 02 October 2016

Share

How to cite

Statistics