Abstract
We are concerned with a capacitated location-multi allocation-routing problem in a road network with flexible travel times. It is assumed that all links are two-way and capacities of the server nodes and arcs for accepting of population are limited. The aim of our work is to find numbers and locations of server nodes, allocation of the existing population in existing demand nodes on the network to the servers and the allocation of existing population in each node to different routes to determine the decided server for each member so that total transportation time is minimized. Here, two basic concepts are considered: multi allocation and flexible travel times. The concept of multi allocation arises from the possibility of allocating the existing population in a demand node to more than one server node. Also, flexible travel times concentrate on impact of traveling population on the times of links simultaneously, that is, depending on how the population is distributed on the network, the travel times on links may be increased. So, to have the least increase in the time of each link, it is necessary to decide upon the distribution of population in the network. We formulate the proposed problem as a mixed-integer nonlinear programming model and then present a genetic algorithm (GA) for solving large problems Finally, we make two sets of numerical experiments and analyze the obtained results by LINGO solver and GA. Numerical results show the proposed GA to be highly efficient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies, Physica-Verlag (2009)
Neema, M.N., Ohgai, A.: Multi-objective location modeling of urban parks and open spaces: Continuous optimization. Comput. Environ. Urban. Syst. 34, 359–376 (2010)
Neema, M., Maniruzzaman, K., Ohgai, A.: New genetic algorithms based approaches to continuous p-median problem. Networks and Spatial Economics 11, 83–99 (2011)
Jiang, J., Xu, Y.: MiniSum location problem with farthest Euclidean distances. Math. Meth. Oper. Res. 64, 285–308 (2006)
Hamacher, H.W., Nickel, S.: Classification of location models. Locat. Sci. 6, 229–242 (1998)
Scaparra, M.P., Scutella, M.G.: Facility Locaties, Locations, Customers: Building Blocks of Location Models, A survey, Technical Report TR-01-18 (2001)
Fouard, C., Malandain, G.: 3-D chamfer distances and norms in anisotropic grids. Image Vis. Comput. 23, 143–158 (2005)
Hakimi, S.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(1), 462–475 (1964)
Yesilkokcen, G.N., Wesolowsky, G.O.: A branch-and-bound algorithm for the supply connected location-allocation problem on networks. Locat. Sci. 6, 395–415 (1998)
Zhou, J., Min, H., Gen, M.: The balanced the allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach. Comput. Ind. Eng. 43, 251–261 (2002)
Berman, O., Krass, D., Wang, J.: Locating Service facilities to reduce lost demand. IIE Trans. 38(11), 933–946 (2006)
Wang, Y., Wang, C.: Locating passenger vehicle refueling stations. Transp. Res. E 46(5), 791–801 (2010)
Iyigun, C., Ben-Israel, A.: A generalized Weiszfeld method for the multi-facility location problem. Oper. Res. Lett. 38(1), 207–214 (2010)
Miandoabchi, E., Zanjirani-Farahani, R.: Optimizing reserve capacity of urban road networks in a discrete network design problem. Adv. Eng. Softw. Work. 42(12), 1041–1050 (2011)
Miandoabchi, E., Daneshzand, F., Szeto, W.Y., Zanjirani-Farahani, R.: Multi-objective discrete urban road network design. Comput. Oper. Res. 40, 2429–2449 (2013)
Ishfaq, R., Sox, C.R.: Hub location-allocation in intermodal logistic networks. Eur. J. Oper. Res. 210, 213–230 (2011)
Zeinal Hamadani, A., Abouei Ardakan, M., Rezvan, T., Honarmandian, M.M.: Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm. Socio Econ. Plan. Sci. 47, 309–317 (2013)
Wu, T.H., Chinyao, L., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29, 1393–1415 (2002)
Melechovsky, J., Prins, C., Calvo, R.W.: A metaheuristic to solve a location-routing problem with non-linear costs. J. Heuristics 11, 375–391 (2005)
Ozyurt, Z., Aksen, D.: Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation: In Book Series Operations Research/Computer Science Interfaces, vol. 37, pp. 125–144 (2007)
Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASPxELS approach for the capacitated location-routing problem. Comput. Oper. Res. – Metaheuristics for Logistics and Vehicle Routing 37(11), 1912–1923 (2010)
Fazel Zarandi, M.H., Hemmati, A., Davari, S.: The multi-depot capacitated location-routing problem with fuzzy travel times. Expert Systems with Applications 38, 10075–10084 (2011)
Ting, C.J., Chen, C.H.: A multiple ant colony optimization algorithm for the capacitated location routing problem. Int. J. Prod. Econ. 141, 34–44 (2013)
Martínez-Salazar, I.A., Molina, j., Ángel-Bello, F., Gómez, T., Caballero, R.: Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms. Eur. J. Oper. Res. 234, 25–36 (2014)
Karp, R.: Reducibility among combinatorial problems, Plenum, New York, pp. 85–104 (1972)
Burke, L.I.D.: A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116, 87–99 (1999)
Holland, J.H.: Adaptation in Natural and Artificial Systems, Michigan, USA, The University of Michigan Press (1975)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shiripour, S., Mahdavi-Amiri, N. & Mahdavi, I. Planning a Capacitated Road Network with Flexible Travel Times: A Genetic Algorithm. J Math Model Algor 14, 425–451 (2015). https://doi.org/10.1007/s10852-015-9277-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-015-9277-0