A transportation network model with intelligent probabilistic travel times and two hybrid algorithms

References

• Aarts, E. H., and J. K. Lenstra. 1997. Local Search in Combinatorial Optimization. New York: Wiley.
   Google Scholar
• Alumur, S., and B. Kara. 2007. “A New Model for the Hazardous Waste Location-Routing Problem.” Computers & Operations Research 34: 1406–1423.
   Web of Science ®Google Scholar
• Aydin, M. E., and T. C. Fogarty. 2004. “A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimization Problems.” Journal of Heuristics 10 (3): 269–92.
   Web of Science ®Google Scholar
• Azarmand, Z., and E. Neishabouri. 2009. “Location Allocation Problem.” In Facility Location, edited by R. Zanjirani-Farahani and M. Hekmatfar, 93–109. Berlin: Physica-Verlag HD.
   Google Scholar
• Badri, M. A. 1999. “Combining the Analytic Hierarchy Process and Goal Programming for Global Facility Location-Allocation Problem.” International Journal of Production Economic 62 (1): 237–248.
   Web of Science ®Google Scholar
• Berman, O., D. Krass, and J. Wang. 2006. “Locating Service Facilities to Reduce Lost Demand.” IIE Transactions 38 (11): 933–946.
   Web of Science ®Google Scholar
• Berman, O., R. Huang, S. Kim, and B. C. Menezes. 2007. “Locating Capacitated Facilities to Maximize Captured Demand.” IIE Transactions 39 (11): 1015–1029.
   Web of Science ®Google Scholar
• Boccia, M., T. G. Crainic, A. Sforza, and C. Sterle. 2010. “A Metaheuristic for a Two Echelon Location-Routing Problem.” In Proceeding of SEA, Lecture Notes in Computer Science 6049/2010, Ischia Island, Naples, Italy, 288–301.
   Google Scholar
• Boventer, V. 1961. “The Relationship between Transportation Costs and Location Rent in Transportation Problems.” Journal of Regional Science 3: 27–40.
   Web of Science ®Google Scholar
• Caballero, R., and M. González. 2007. “Solving a Multiobjective Location Routing Problem with a Metaheuristic Based on Tabu Search, Application to a Real Case in Andalusia.” European Journal of Operational Research 177: 1751–1763.
   Web of Science ®Google Scholar
• Cappanera, P., G. Gallo, and F. Maffioli. 2004. “Discrete Facility Location and Routing of Obnoxious Activities.” Discrete Appl Math 133: 3–28.
   Web of Science ®Google Scholar
• Chevalier, P. H., I. Thomas, D. Geraets, E. Goetghebeur, O. Janssens, D. Peeters, and F. Plastria. 2012. “Locating fire Stations: An Integrated Approach for Belgium.” Socio-Economic Planning Sciences 46: 173–182.
   Google Scholar
• Christofides, N., and S. Eilon. 1969. “An Algorithm for the Vehicle Dispatching Problem.” Operational Research Quarterly 20: 309–318.
   Google Scholar
• Conde, E. 2007. “Minmax Regret Location-Allocation Problem on a Network under Uncertainty.” European Journal of Operational Research 179: 1025–1039.
   Web of Science ®Google Scholar
• Cooper, L. 1963. “Location-Allocation Problems.” Operations Research 11 (3): 331–343.
   Web of Science ®Google Scholar
• Cooper, L. 1972. “The Transportation-Location Problems.” Operational Research 20: 94–108.
   Web of Science ®Google Scholar
• Cortinhal, M. J., and M. E. Captivo. 2003. “Upper and Lower Bounds for the Single Source Capacitated Location Problem.” European Journal of Operational Research 51: 151–333.
   Google Scholar
• Duhamel, C., P. Lacomme, C. Prins, and C. Prodhon. 2010. “A GRASPxELS Approach for the Capacitated Location-Routing Problem.” Computers & Operations Research 37 (11): 1912–1923.
   Web of Science ®Google Scholar
• Fazel Zarandi, M. H., A. Hemmati, and S. Davari. 2011. “The Multi-Depot Capacitated Location-Routing Problem with Fuzzy Travel times.” Expert Systems with Applications 38: 10075–10084.
   Web of Science ®Google Scholar
• Fazel Zarandi, M. H., A. Hemmati, S. Davari, and I. Burhan Turksen. 2013. “Capacitated Location-Routing Problem with Time Windows under Uncertainty.” Knowledge-Based Systems 37: 480–489.
   Web of Science ®Google Scholar
• Franceschetti, A., D. Honhon, T. V. Woensel, T. Bektas, and G. Laporte. 2013. “The Time-dependent Pollution-Routing Problem.” Transportation Research Part B 56: 293–265.
   Google Scholar
• Gerny, V. 1985. “A Thermodynamic Approach to the Travelling Salesman Problem: An Efficient Simulation.” Journal of Optimization Theory and Applications 45: 41–51.
   Web of Science ®Google Scholar
• Glover, F., J. P. Kelly, and M. Laguna. 1995. “Genetic Algorithms and Tabu Search: Hybrids for Optimization.” Computers & Operations Research 22: 111–134.
   Web of Science ®Google Scholar
• Haghani, A., and S. Jung. 2005. “A Dynamic Vehicle Routing Problem with Time-Dependent Travel times.” Computers & Operations Research 32: 2959–2986.
   Web of Science ®Google Scholar
• Hakimi, S. 1964. “Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems.” Operations Research 13 (1): 462–475.
   Google Scholar
• Hansen, P. H., B. Hegedahl, S. Hjortkjaer, and B. Obel. 1994. “A Heuristic Solution to the Warehouse Locationrouting Problem.” European Journal of Operational Research 76: 111–127.
   Web of Science ®Google Scholar
• Higgins, J. C. 1972. “On the Merits of Simple Models in Distribution Planning.” International Journal of Physical Distribution 2: 144–148.
   Google Scholar
• Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Michigan: The University of Michigan Press.
   Google Scholar
• Hongzhong, J., O. Fernando, and D. Maged. 2005. A Modeling Framework for Facility Location of Medical Services for Large-Scale Emergencies. www.illposed.usc.edu.
   Google Scholar
• http://en.wikipedia.org/wiki/Failure_rate.
   Google Scholar
• http://en.wikipedia.org/wiki/Poisson_distribution.
   Google Scholar
• Hua, S., and G. Ziyou. 2012. “Stochastic Traffic Equilibrium Based on Travel Time Robust Reliability.” Journal of Transportation Systems Engineering and Information Technology 12 (2): 76–84.
   Google Scholar
• Ishfaq, R., and C. R. Sox. 2011. “Hub Location-Allocation in Intermodal Logistic Networks.” European Journal of Operational Research 210: 213–230.
   Web of Science ®Google Scholar
• Jacobsen, S. K., and O. B. G. Madsen. 1978. “On the Location of Transfer Points in a Two-Level Newspaper Delivery System – A Case Study.” Presented at the International Symposium on Locational Decisions, Banff, Alberta, Canada, 24–28.
   Google Scholar
• Jacobsen, S. K., and O. B. G. Madsen. 1980. “Acomparative Study of Heuristics for a Two-Level Location Routing Problem.” European Journal of Operational Research 5: 378–387.
   Web of Science ®Google Scholar
• Karp, R. 1972. Reducibility among Combinatorial Problems. New York: Plenum.
   Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680.
   PubMed Web of Science ®Google Scholar
• Klose, A., and A. Drexl. 2005. “Facility Location Models for Distribution System Design.” European Journal of Operational Research 162: 4–29.
   Web of Science ®Google Scholar
• Kritzinger, S., K. F. Doerner, R. F. Hartl, G. Kiechle, H. Stadler, and S. S. Manohar. 2012. “Using Traffic Information for Time-dependent Vehicle Routing.” Procedia Social and Behavioral Sciences 39: 217–229.
   Google Scholar
• Laporte, G., and Y. Norbert. 1981. “An Exact Algorithm for Minimizing Routing and Operating Costs in Depot Location.” European Journal of Operational Research 6: 224–226.
   Web of Science ®Google Scholar
• Laporte, G., F. Louveaux, and H. Mercure. 1992. “The Vehicle Routing Problem with Stochastic Travel times.” Transportation Science 26: 161–70.
   Web of Science ®Google Scholar
• Lawrence, R. M., and P. J. Pengilly. 1969. “The Number and Location of Depots Required for Handling Products for Distribution to Retail Stores in South-East England.” Operational Research Quarterly 20: 23–32.
   Google Scholar
• Madsen, O. B. G. 1983. “Methods for Solving Combined Two Leve Location-Routing Problems of Realistic Dimensions.” European Journal of Operational Research 12: 295–301.
   Web of Science ®Google Scholar
• Maranzana, F. E. 1964. “On the Location of Supply Points to Minimise Transports Costs.” Operational Research Quarterly 15: 261–270.
   Google Scholar
• Marinakis, Y., and M. Marainaki. 2008. “A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem.” Journal of Mathematical Modelling and Algorithms 7: 59–78.
   Google Scholar
• Martínez-Salazar, I. A., J. Molina, F. Ángel-Bello, T. Gómez, and R. Caballero. 2014. “Solving a Bi-Objective Transportation Location Routing Problem by Metaheuristic Algorithms.” European Journal of Operational Research 234: 25–36.
   Web of Science ®Google Scholar
• Melechovsky, J., C. Prins, and R. W. Calvo. 2005. “A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs.” Journal of Heuristics 11: 375–391.
   Web of Science ®Google Scholar
• Miandoabchi, E., and R. Zanjirani-Farahani. 2011. “Optimizing Reserve Capacity of Urban Road Networks in a Discrete Network Design Problem.” Advances in Engineering Software 42 (12): 1041–1050.
   Web of Science ®Google Scholar
• Miandoabchi, E., F. Daneshzand, W. Y. Szeto, and R. Zanjirani-Farahani. 2013. “Multi-Objective Discrete Urban Road Network Design.” Computers and Operations Research 40: 2429–2449.
   Web of Science ®Google Scholar
• Neema, M. N., and A. Ohgai. 2010. “Multi-Objective Location Modeling of Urban Parks and Open Spaces: Continuous Optimization.” Computers, Environment and Urban Systems 34: 359–376.
   Web of Science ®Google Scholar
• Neema, M., K. Maniruzzaman, and A. Ohgai. 2008. “New Genetic Algorithms Based Approaches to Continuous P-median Problem.” Networks and Spatial Economics, 11 (1): 1–17.
   Google Scholar
• Or, I., and W. P. Pierskalla. 1979. “A Transportation, Location-Allocation Model for Regional Blood Banking.” AIIE Trans 11: 86–95.
   Web of Science ®Google Scholar
• Park, Y. B., and S. Song. 1997. “Vehicle Scheduling Problems with Time-Varying Speed.” Computers & Industrial Engineering 33: 853–6.
   Web of Science ®Google Scholar
• Perl, J., and M. S. Daskin. 1985. “A Warehouse Location-Routing Problem.” Transportation Research B 19: 381–396.
   Google Scholar
• Salhi, S., and M. D. H. Gamal. 2003. “A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location-Allocation Problem.” Annals of Operation Research 123: 203–222.
   Web of Science ®Google Scholar
• Scaparra, M. P., and M. G. Scutella. 2001. Facility Locaties, Locations, Customers: Building Blocks of Location Models. a Survey, Technical Report TR-01-18. Pisa, IT: Università di Pisa.
   Google Scholar
• Schulze, L., and L. Li. 2009. “Location-Allocation Model for Logistics Networks with Implementing Commonality and Postponement Strategies.” Proceedings of the International Multi Conference of Engineers and Computer Scientists, March 18–20, Hong Kong.
   Google Scholar
• Shao, Z., S. Gao, and S. Wang. 2009. “A Hybrid Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Stochastic Travel Time.” In Fuzzy Information and Engineering, Vol. 54, edited by Bing-yuan Cao, Cheng-yi Zhang, and Tai-fu Li, 566–574. Berlin: Springer.
   Google Scholar
• Snzder, L. V. 2006. “Facility Location under Uncertainty: A Review.” IIE Transactions 38: 537–554.
   Web of Science ®Google Scholar
• Srivastava, R. 1993. “Alternate Solution Procedures for the Locating-Routing Problem.” OMEG 21: 497–506.
   Web of Science ®Google Scholar
• Srivastava, R., and W. C. Benton. 1990. “The Location-Routing Problem: Considerations in Physical Distribution System Design.” Computers and Operations Research 17: 427–435.
   Web of Science ®Google Scholar
• Tas, D., N. Dellaert, T. V. Woensel, and T. D. Kok. 2013. “Vehicle Routing Problem with Stochastic Travel times including Soft Time Windows and Service Costs.” Computers & Operations Research 40: 214–224.
   Web of Science ®Google Scholar
• Ting, C. J., and C. H. Chen. 2013. “A Multiple Ant Colony Optimization Algorithm for the Capacitated Location Routing Problem.” International Journal of Production Economics 141: 34–44.
   Web of Science ®Google Scholar
• Verter, V., and S. D. Lapierre. 2002. “Location of Preventive Health Care Facilities.” Annals of Operations Research 32: 110–123.
   Google Scholar
• Wang, Y., and C. Wang. 2010. “Locating Passenger Vehicle Refueling Stations.” Transportation Research Part E 46 (5): 791–801.
   Google Scholar
• Webb, M. H. J. 1968. “Cost Functions in the Location of Depots for Multiple-Delivery Journeys.” Operational Research Quarterly 19: 11–320.
   Google Scholar
• Xie, B. 2003. Research on Stochastic Vehicle Routing Problems. PhD thesis, Xinan Jiaotong University, China.
   Google Scholar
• Yan, S., C. K. Lin, and S. Y. Chen. 2012. “Optimal Scheduling of Logistical Support for an Emergency Roadway Repair Work Schedule.” Engineering Optimization 44: 1035–1055.
   Web of Science ®Google Scholar
• Yan, S., C. K. Lin, and S. Y. Chen. 2014. “Logistical Support Scheduling under Stochastic Travel Times Given an Emergency Repair Work Schedule.” Computers & Industrial Engineering 67: 20–35.
   Web of Science ®Google Scholar
• Yang, K., Y. K. Liu, and G. Q. Yang. 2013. “Solving Fuzzy P-Hub Center Problem by Genetic Algorithm Incorporating Local Search.” Applied Soft Computing 13: 2624–2632.
   Web of Science ®Google Scholar
• Yesilkokcen, G. N., and G. O. Wesolowsky. 1998. “A Branch-and-Bound Algorithm for the Supply Connected Location-Allocation Problem on Networks.” Location Science 6: 395–415.
   Google Scholar
• Zanjirani-Farahani, R., E. Miandoabchi, W. Y. Szeto, and H. Rashidi. 2013. “A Review of Urban Transportation Network Design Problems.” European Journal of Operational Research 229: 281–302.
   Web of Science ®Google Scholar
• Zeinal Hamadani, A., M. Abouei Ardakan, T. Rezvan, and M. M. Honarmandian. 2013. “Location-Allocation Problem for Intra-transportation System in a Big Company by Using Meta-Heuristic Algorithm.” Socio-Economic Planning Sciences, 47 (4): 309–317.
   Web of Science ®Google Scholar
• Zhang, T., W. A. Chaovalitwongse, and Y. Zhang. 2012. “Scatter Search for the Stochastic Travel-time Vehicle Routing Problem with Simultaneous Pick-Ups and Deliveries.” Computers & Operations Research 39: 2277–2290.
   Web of Science ®Google Scholar
• Zheng, Y., and B. Liu. 2006. “Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm.” Applied Mathematics and Computation 176 (2): 673–683.
   Web of Science ®Google Scholar
• Zhou, J., and B. Liu. 2003. “New Stochastic Models for Capacitated Location-allocation Problem.” Computers & Industrial Engineering 45 (1): 111–125.
   Web of Science ®Google Scholar
• Zhou, J., and B. Liu. 2007. “Modeling Capacitated Location-allocation Problem with Fuzzy Demands.” Computers & Industrial Engineering 53 (3): 454–468.
   Web of Science ®Google Scholar
• Zhou, J., H. Min, and M. Gen. 2002. “The Balanced the Allocation of Customers to Multiple Distribution Centers in the Supply Chain Network: A Genetic Algorithm Approach.” Computers & Industrial Engineering 43: 251–261.
   Web of Science ®Google Scholar