Hybrid Genetic Algorithm for the Location - Routing Problem with Emergency Referral

Main Article Content

Jarupong Banthao
Phongchai Jittamai

Abstract

In this research, the location routing problem with emergency referral (LRPER) was
defi ned to solve for (i) the number of local blood banks (LBBs) and their locations;
(ii) the assignment of each hospital to each LBB; (iii) the routing from LBBs to hospitals
for blood delivery. The mathematical model for LRPER was proposed to solve for the
number of LBBs and their locations in such a way that the total cost is minimized and the
emergency blood referrals are satisfi ed. LRPER, which is a special case of Location - Routing
Problem, is NP-hard problem. Hybrid Genetic Algorithm (HGA) was developed to solve
LRPER. A data set of 93 LBBs in the lower north-eastern provinces of Thailand was used
as a case study in this research. The results shown that HGA is an appropriate method
to solve LRPER giving the number of locations and routes that yield the lowest cost.

Article Details

How to Cite
[1]
J. Banthao and P. Jittamai, “Hybrid Genetic Algorithm for the Location - Routing Problem with Emergency Referral”, RMUTI Journal, vol. 11, no. 1, pp. 1–16, Apr. 2018.
Section
บทความวิจัย (Research article)

References

[1] Salhi, S. and Rand, G. K. (1989). The Eeff ect to Ignoring Routes when Locating Depots. European
Journal of Operational Research. Vol. 39, No. 2, pp. 150-156. DOI: 10.1016/0377-2217(89)90188-4

[2] Daskin, M. S. and Dean, L. K. (2004). Location of Healthcare Facilities. In: Sainfort F,
Bradean M, Pierskalla W, Editors. Handbook of OR/MS in Health Care: A Handbook of
Methods and Applications. USA: Kluwer. pp. 43-76

[3] Cornu jols, G., Fisher, M. L., and Wolsey, L. A. (1977). Location of Bank Accounts to Optimize
Float: an Analytic Study of Exact and Approximate Algorithms. Management Science. Vol. 23,
No. 8, pp. 789-810

[4] Lenstra, J. K. and Rinnooy Kan, A. H. G. (1981). Complexity of Vehicle Routing and Scheduling
Problems. Networks. Vol. 11, Issue 2, pp. 221-227. DOI: 10.1002/net.3230110211

[5] Perl, J. and Daskin, M. S. (1985). A Werehouse Location-Routing Problem. Transportation
Research B. Vol. 19B, No. 5, pp. 381-396

[6] Yu, V. F., Lin S. W., Lee W., and Ting C. J. (2010). A Simulated Annealing Heuristic for the
Capacitated Location Routing Problem. Computer and Industrial Engineering. Vol. 58,
No. 2, pp. 288-299

[7] Nagy, G. and Salhi, S. (1999). Location-Routing: Issues, Models and Methods and Methods.
European Journal of Operational Research. Vol. 177, No. 2, pp. 649-672

[8] Bruns, A., Klose, A., and St hly, P. (2000). Restructuring of Swiss Parcel Delivery Service.
R Spektrum. Vol. 22, Issue 2, pp. 285-302

[9] Wasner, M. and Z pfel, G. (2004). An Integrated Multi-Depot Hub Location Vehicle Routing
Model for Network Planning of Parcel Service. International Journal of Production
Economics. Vol. 90, pp. 403-329

[10] Kulcar, T. (1996). Optimizing Solid Waste Collection in Brussels. European Journal of
Operational Research. Vol. 90, Issue 1, pp. 26-44

[11] Madson, O. B. G. (1983). Methods for Solving Combined Two Level Location Routing
Problems of Realistic Dimensions. European Journal of Operational Research. Vol. 12,
Issue 3, pp. 295-301

[12] Aksen, D. and Altinkemer, K. (2008). A Location-Routing Problem for the Conversation to the
Click-and-Mortar Retailing. European Journal of Operational Research. Vol. 186, No. 2,
pp. 554-575

[13] Chan, Y., Carter, W. B., and Burnes, M. D. (2001). A Multiple-Eepot, Multiple-Vehicle,
Location-Routing Problem with Stochastically Processed Demands. Computers and
Operations Research. Vol. 28, Issue 8, pp. 803-826

[14] Or, I. and Pierskalla, W. P. (1979). A Transportation Location-Allocation Model for Regional
Blood Banking. AIIE Transactions. Vol. 11, No. 2, pp. 86-95

[15] ahin, G., S ral, H., and Meral, S. (2007). Location Analysis for Regionalization of Turkish
Red Crescent Blood Services. Computer and Operations Research. Vol. 34, Issue 3, pp. 692-704

[16] Laporte, G. and Nobert, Y. (1981). An Exact Algorithm for Minimizing Routing and Operating
Costs in Facility Location. European Journal of Operation Research. Vol. 6, pp. 224-225

[17] Min, H. (1996). Consolidation Terminal Location-Allocation and Consolidated Routing
Problem. Journal of Business Logistics. Vol. 17, No. 2, pp. 235-263

[18] Wu, T. H., Low, C., and Bai, J. W. (2002). Heuristics Solutions to Multiple-Depot Location-Routing
Problems. Computers and Operations Research. Vol. 29, Issue 10, pp. 1393-1415

[19] Su, C. T. (1999). Dynamic Vehicle Control and Scheduling of a Multi - Depot Physical
Distribution System. Integrated Manufacturing Systems. Vol. 10, Issue 1, pp. 56-65

[20] Albaread-Sambola, M., Diaz, J. A., and Fernandez, E. (2005). A Compact Model and Tight
Bounds for a Combined Location Routing Problem. Computers and Operations Research.
Vol. 32, Issue 3, pp. 407-428

[21] Julia, R., Ehrenberg, C., and Zimmermann, J. (2014). Many-to-Many Location-Routing with
Inter-Hub Transport and Multi-Commodity Pickup-and-Delivery. European Journal of
Operational Research. Vol. 236, Issue 3, pp. 863-878

[22] Surekha, P. and Sumathi, S. (2011). Solution to Multi-Depot Vehicle Routing Problem Using
Genetic Algorithms. World Applied Programming. Vol. 1, No. 3, pp. 118-131

[23] Derbal, H., Jarboui, B., Hanafi , S., and Chabchoub, H. (2012). Genetic Algorithm with Iterated
Local Search for Solving a Location-Routing Problem. Expert Systems with Applications.
Vol. 39, No. 3, pp. 2865-2871