An Efficient Approach for Solving Reliable Facility Location Models

Aboolian, Robert; Tingting Cui; Zuo-Jun Max Shen
October 2013
INFORMS Journal on Computing;Fall2013, Vol. 25 Issue 4, p720
Academic Journal
We consider reliable facility location models in which facilities are subject to unexpected failures, and customers may be reassigned to facilities other than their regular facilities. The objective is to minimize the total expected costs in normal and failure scenarios. We allow facilities to have different failure rates and do not limit the number of facilities that might be assigned to a customer. Lower bounds for reliable uncapacitated fixed-charge location problem (RUFLP) are derived and used to introduce a class of efficient algorithms for solving the RUFLP problem.


Related Articles

  • Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. Navaei, J.; Ghomi, S. M. T. Fatemi; Jolai, F.; Shiraqai, M. E.; Hidaji, H. // International Journal of Advanced Manufacturing Technology;Dec2013, Vol. 69 Issue 9-12, p2215 

    This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear...

  • The Generalized Regenerator Location Problem. Si Chen; Ljubić, Ivana; Raghavan, S. // INFORMS Journal on Computing;Spring2015, Vol. 27 Issue 2, p204 

    In an optical network a signal can only travel a maximum distance dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high, we wish to deploy as few regenerators as possible in the...

  • Mathematical Programming Modeling and Resolution of the Location-Routing Problem in Urban Logistics. Herazo-Padilla, Nilson; Montoya-Torres, Jairo R.; Muñoz-Villamizar, Andrés Felipe // Ingeniería y Universidad;jul-dic2014, Vol. 18 Issue 2, p271 

    The implementation of urban distribution centers near to city centers to allow freight consolidation is a widely extended initiative worldwide, seeking to improve traffic congestion and quality of life in downtown, among others. This paper considers the problem of locating urban distribution...

  • Flow Merging and Hub Route Optimization in Collaborative Transportation. Kerui Weng; Zi-hao Xu // Journal of Applied Mathematics;2014, p1 

    This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers' transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route...

  • A mathematical model and a heuristic approach for periodic material delivery in lean production environment. Kilic, Huseyin; Durmusoglu, Mehmet // International Journal of Advanced Manufacturing Technology;Nov2013, Vol. 69 Issue 5-8, p977 

    One of the important design elements for a good production system is material handling. In cases where it is not well-designed, it can be the bottleneck in the system. Moreover, it can cause a lot of wastes such as waiting time, idle time, and excessive transportation and cost. In this study,...

  • An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. Coco, Amadeu; Júnior, João; Noronha, Thiago; Santos, Andréa // Journal of Global Optimization;Oct2014, Vol. 60 Issue 2, p265 

    The well-known Shortest Path problem (SP) consists in finding a shortest path from a source to a destination such that the total cost is minimized. The SP models practical and theoretical problems. However, several shortest path applications rely on uncertain data. The Robust Shortest Path...

  • Time-partitioning heuristic algorithm for optimal production, inventory, and transportation planning with direct shipment. Napaporn Rianthong; Aussadavut Dumrongsiri // Songklanakarin Journal of Science & Technology;May/Jun2013, Vol. 35 Issue 3, p369 

    We developed a mixed integer linear programming model for an integrated decision problem of production, inventory, and transportation planning. Our model combines the direct shipment into the production, inventory, and distribution planning. The objective was to minimize the total operation cost...

  • MineLib: a library of open pit mining problems. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93 

    Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit...

  • Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level. Carrie Ka Yuk Lin // Mathematical Problems in Engineering;2014, p1 

    Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units), satisfying the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics