نتایج جستجو برای: hub covering location problem

تعداد نتایج: 1137877  

Abstract The purpose of this study is to consider an international facility location problem under uncertainty and present an integrated model for strategic and operational planning. The paper offers two methodologies for the location selection decision. First the extended VIKOR method for decision making problem with interval numbers is presented as a methodology for strategic evaluation of po...

Journal: :Operational Research 2007
Francisco de Assis Corrêa Antonio Augusto Chaves Luiz Antonio Nogueira Lorena

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...

2012
Mehdi Seifbarghy

This paper provides a framework in order to incorporate reliability issue as a sign of disruption in distribution systems and partial covering theory as a response to limitation in coverage radios and economical preferences, simultaneously into the traditional literatures of capacitated facility location problems. As a result we develop a bi-objective model based on the discrete scenarios for e...

Mahdi Rashidi Kahag Mehdi Seifbarghy Seyed Taghi Akhavan Niaki Sina Zabihi

A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software t...

2001
Reinaldo Gen Ichiro Arakaki Luiz Antonio Nogueira Lorena

The Constructive Genetic Algorithm (CGA) was proposed by Lorena and Furtado [6], as an alternative to the traditional GAs approach. Particularly the CGA directly evaluates schemata, works with a dynamic population size, performs mutation in complete structures, and uses heuristics in schemata and/or structure representation. The schemata are evaluated and can be added to the population if they ...

Journal: :Computers & OR 2003
Luis Gonzalo Acosta Espejo Roberto D. Galvão Brian Boffey

A 2-level hierarchical extension of the maximal covering location problem is considered and an e0ective method for its solution developed. A combined Lagrangean–surrogate (L–S) relaxation is de6ned which reduces to a 0–1 knapsack problem. Tests were carried out using a subgradient-based heuristic incorporating the L–S relaxation, with the resulting knapsack problems being solved both with and w...

Journal: :Jurnal Sistem dan Manajemen Industri 2022

Operation Timbang (OPT) Plus is one of the Philippines’ programs that focuses on nutrition by conducting an annual assessment for 0-59 months old children in barangays to identify malnutrition data area. The barangay smallest administrative entity Philippines. OPT a plan action estimates number individuals and identifies those who will get prioritized community. Iloilo City Health Office conduc...

Journal: :Adv. Operations Research 2010
Edson Luiz França Senne Marcos Antonio Pereira Luiz Antonio Nogueira Lorena

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید