scholarly journals L-SHAPED DECOMPOSITION METHOD FOR MULTI-STAGE STOCHASTIC CONCENTRATOR LOCATION PROBLEM

2000 ◽  
Vol 43 (2) ◽  
pp. 317-332 ◽  
Author(s):  
Takayuki Shiina
Keyword(s):  
Decomposition Method ◽  
Location Problem ◽  
Multi Stage ◽  
Concentrator Location

A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem

2021 ◽  
Vol 289 (3) ◽  
pp. 975-986
Author(s):  
Massimo Di Francesco ◽  
Manlio Gaudioso ◽  
Enrico Gorgone ◽  
Ishwar Murthy
Keyword(s):  
Location Problem ◽  
Valid Inequalities ◽  
Extended Formulation ◽  
Concentrator Location

Developing Reduced Gradient Approach for Solving Multi-Stage Stochastic Nonlinear Programs

2020 ◽  
Vol 17 (7) ◽  
pp. 3194-3199
Author(s):  
Suparni ◽  
Herman Mawengkang ◽  
Opim Salim Sitompul ◽  
Saib Suwilo
Keyword(s):  
Stochastic Programming ◽  
Decomposition Method ◽  
Multistage Stochastic Programming ◽  
Analysis Method ◽  
Nonlinear Programs ◽  
Multi Stage ◽  
Successful Solution ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient ◽  
Gradient Approach

An increasing number of practical scenarios continue to experience problems associated with multistage stochastic programming. This study proposes a decomposition method through which they can be a successful solution to multi-stage stochastic nonlinear programs. The proposed method entails the scenario analysis method. The proposed method also performs its role via search direction generation in such a way that sets of quadratic programming sub-issues are solved in a parallel way, especially when the size is significant lower, compared to the case involving original problems at the respective iterations. Relative to the dual multiplier derivation, which focuses on non-anticipativity constraints, the proposed system advocates for the introduction of generalized reduced gradient approaches.

Hierarchical concentrator location problem

1992 ◽  
Vol 15 (3) ◽  
pp. 185-191 ◽  
Author(s):  
Sridhar Narasimhan ◽  
Hasan Pirkul
Keyword(s):  
Location Problem ◽  
Concentrator Location

A GRASP HEURISTIC FOR SOLVING AN EXTENDED CAPACITATED CONCENTRATOR LOCATION PROBLEM

2003 ◽  
Vol 02 (04) ◽  
pp. 597-617 ◽  
Author(s):  
BERNARD T. HAN ◽  
V. T. RAJA
Keyword(s):  
Location Problem ◽  
Area Network ◽  
Wide Area Network ◽  
Last Mile ◽  
Local Access ◽  
Optimal Deployment ◽  
Network Backbone ◽  
Concentrator Location ◽  
Grasp Heuristic ◽  
Decision Making Tool

Local Access Networks (LACNs) are often considered the "last mile" over the Internet provided that they are connected to some existing Wide Area Network backbone. In this paper, a revised LACN-WAN interconnection model is presented as an extension to the conventional Capacitated Concentrator Location Problem (CCLP). An efficient heuristic is also developed to seek near-optimal deployment of telecommunication devices (e.g. links, concentrators, etc.) while minimizing the total connection costs for the network interconnection. Our solution algorithm could serve as a decision-making tool in solving problems with a real world size (i.e. 120 nodes and 30 concentrators).

The support unit location problem to road traffic surveys with multi-stages

2019 ◽  
Vol 53 (4) ◽  
pp. 1109-1127
Author(s):  
Marcus Vinicius Oliveira Camara ◽  
Glaydston Mattos Ribeiro
Keyword(s):  
Large Scale ◽  
Location Problem ◽  
Road Traffic ◽  
Coverage Area ◽  
Military Organization ◽  
Support Unit ◽  
Travel Costs ◽  
Multi Stage ◽  
Three Stages ◽  
The Cost

Large countries with extensive road networks, such as Brazil, require large volumes of financial resources to perform traffic surveys. In Brazil, the biggest road traffic survey was performed in 2011 with 120 counting survey stations. This survey was divided into three stages and 83 support units provided survey teams. A support unit is a place, such as a military organization, close to the survey stations. A stage indicates that only some survey stations must be considered at a time. In large scale traffic surveys with multi-stages, we must define which support unit will serve each survey station so that travel costs for the survey teams and the costs to use the support units are minimized. We present the Support Unit Location Problem to Assist Road Traffic Survey with Multi-Stages where, given a set of available support units, each one with a coverage area, and a set of multi-stage traffic survey stations, we must select units to serve stations so that the cost is minimized. Scenarios are evaluated for a real traffic survey with 300 counting stations and four stages in Brazil. Computational experiments show that large cost reductions can be found when a mathematical model is used.

Sign in / Sign up

Export Citation Format

Share Document