A fuzzy AHP based integer linear programming model for the multi-criteria transshipment problem

Purpose – The purpose of this research is to develop a holistic approach to maximize the customer service level while minimizing the logistics cost by using an integrated multiple criteria decision making (MCDM) method for the contemporary transshipment problem. Unlike the prevalent optimization techniques, this paper proposes an integrated approach which considers both quantitative and qualitative factors in order to maximize the benefits of service deliverers and customers under uncertain environments. Design/methodology/approach – This paper proposes a fuzzy-based integer linear programming model, based on the existing literature and validated with an example case. The model integrates the developed fuzzy modification of the analytic hierarchy process (FAHP), and solves the multi-criteria transshipment problem. Findings – This paper provides several novel insights about how to transform a company from a cost-based model to a service-dominated model by using an integrated MCDM method. It suggests that the contemporary customer-driven supply chain remains and increases its competitiveness from two aspects: optimizing the cost and providing the best service simultaneously. Research limitations/implications – This research used one illustrative industry case to exemplify the developed method. Considering the generalization of the research findings and the complexity of the transshipment service network, more cases across multiple industries are necessary to further enhance the validity of the research output. Practical implications – The paper includes implications for the evaluation and selection of transshipment service suppliers, the construction of optimal transshipment network as well as managing the network. Originality/value – The major advantages of this generic approach are that both quantitative and qualitative factors under fuzzy environment are considered simultaneously and also the viewpoints of service deliverers and customers are focused. Therefore, it is believed that it is useful and applicable for the transshipment service network design.

Data Flow Analysis and the Linear Programming Model

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

A developmental education program model for high -risk minority baccalaureate nursing students

The purpose of this study was to define and describe a Developmental Education Program Model for high-risk minority baccalaureate nursing students based upon perceived needs determined by nursing students and nursing faculty. The research examined differences between Black and Non-Black nursing students in level of importance of concerns and issues related to academic, financial, psycho-social and personal areas of student life; faculty perceptions of the differences between Black and Non-Black nursing students in the level of importance of concerns and issues related to academic, financial, psycho-social and personal areas of student life; and the difference between Black and Non-Black nursing faculty perceptions of level of importance of issues and concerns of academic, financial, psycho-social, and personal areas for Black nursing students. In this study two data collection methods were used, questionnaire and interview. The questionnaire was completed by all students and faculty. Black baccalaureate nursing students and nursing faculty were interviewed. The most significant differences were seen in the category of Personal Issues. Student identified concerns and issues related to both academic and health problems. Faculty identified the greatest differences in Academic Issues. The framework for the model which evolved out of the data uses needs from: (1) a whole person perspective (outcome oriented needs); (2) a programmatic perspective (input oriented needs); and (3) learning domain perspective (process oriented needs). ^

Comparison of Some Improved Estimators for Linear Regression Model under Different Conditions

Multiple linear regression model plays a key role in statistical inference and it has extensive applications in business, environmental, physical and social sciences. Multicollinearity has been a considerable problem in multiple regression analysis. When the regressor variables are multicollinear, it becomes difficult to make precise statistical inferences about the regression coefficients. There are some statistical methods that can be used, which are discussed in this thesis are ridge regression, Liu, two parameter biased and LASSO estimators. Firstly, an analytical comparison on the basis of risk was made among ridge, Liu and LASSO estimators under orthonormal regression model. I found that LASSO dominates least squares, ridge and Liu estimators over a significant portion of the parameter space for large dimension. Secondly, a simulation study was conducted to compare performance of ridge, Liu and two parameter biased estimator by their mean squared error criterion. I found that two parameter biased estimator performs better than its corresponding ridge regression estimator. Overall, Liu estimator performs better than both ridge and two parameter biased estimator.

Caracterização e modelagem dos sistemas de produção de caprinos leiteiros

The objectives of this research were characterizing the dairy goat production systems and model it using linear program. On the first step of this research, the model was developed using data from farms that was affiliated in the ACCOMIG/Caprileite, used a similar dairy goat production systems and have a partnership program with Universidade Federal de Minas Gerais . The data of research were from a structured questionnaire applied with farmers and monitoring of production systems during a guided visit on their farms. The results permitted identify that all farms were classified as a small and have a intensive production system. The average herd size had 63.75 dairy goats on lactation; it permits a production of 153, 38 kg of goat milk per day. It was observed that existing more than one channel of commercialization for the goat milk and their derivative products. The data obtained, on the first step of this research, was used to develop a linear program model. It was evaluated in two goat production systems, called P1 and P2. The results showed that the P1 system, with an annual birth and lactation during approximately 300 days was the best alternative for business. These results were compared with a mixed (beef and dairy) goat system in the semiarid region, which indicated merged with both systems. Therefore, to achieve profits and sustainability of the system, in all simulations it was necessary a minimum limit of funding of U.S. $ 10,000.00; this value permit earning of U.S. $ 792.00 per month and pay the investment within 5 years

A zero-augmented gamma mixed model for longitudinal data with many zeros

In many occupational safety interventions, the objective is to reduce the injury incidence as well as the mean claims cost once injury has occurred. The claims cost data within a period typically contain a large proportion of zero observations (no claim). The distribution thus comprises a point mass at 0 mixed with a non-degenerate parametric component. Essentially, the likelihood function can be factorized into two orthogonal components. These two components relate respectively to the effect of covariates on the incidence of claims and the magnitude of claims, given that claims are made. Furthermore, the longitudinal nature of the intervention inherently imposes some correlation among the observations. This paper introduces a zero-augmented gamma random effects model for analysing longitudinal data with many zeros. Adopting the generalized linear mixed model (GLMM) approach reduces the original problem to the fitting of two independent GLMMs. The method is applied to evaluate the effectiveness of a workplace risk assessment teams program, trialled within the cleaning services of a Western Australian public hospital.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Patterns of impact resulting from a 'sit less, move more' web-based program in sedentary office employees

Purpose Encouraging office workers to ‘sit less and move more’ encompasses two public health priorities. However, there is little evidence on the effectiveness of workplace interventions for reducing sitting, even less about the longer term effects of such interventions and still less on dual-focused interventions. This study assessed the short and mid-term impacts of a workplace web-based intervention (Walk@WorkSpain, W@WS; 2010-11) on self-reported sitting time, step counts and physical risk factors (waist circumference, BMI, blood pressure) for chronic disease. Methods Employees at six Spanish university campuses (n=264; 42±10 years; 171 female) were randomly assigned by worksite and campus to an Intervention (used W@WS; n=129; 87 female) or a Comparison group (maintained normal behavior; n=135; 84 female). This phased, 19-week program aimed to decrease occupational sitting time through increased incidental movement and short walks. A linear mixed model assessed changes in outcome measures between the baseline, ramping (8 weeks), maintenance (11 weeks) and followup (two months) phases for Intervention versus Comparison groups.A significant 2 (group) × 2 (program phases) interaction was found for self-reported occupational sitting (F[3]=7.97, p=0.046), daily step counts (F[3]=15.68, p=0.0013) and waist circumference (F[3]=11.67, p=0.0086). The Intervention group decreased minutes of daily occupational sitting while also increasing step counts from baseline (446±126; 8,862±2,475) through ramping (+425±120; 9,345±2,435), maintenance (+422±123; 9,638±3,131) and follow-up (+414±129; 9,786±3,205). In the Comparison group, compared to baseline (404±106), sitting time remained unchanged through ramping and maintenance, but decreased at follow-up (-388±120), while step counts diminished across all phases. The Intervention group significantly reduced waist circumference by 2.1cms from baseline to follow-up while the Comparison group reduced waist circumference by 1.3cms over the same period. Conclusions W@WSis a feasible and effective evidence-based intervention that can be successfully deployed with sedentary employees to elicit sustained changes on “sitting less and moving more”.

Abordagem probabilística em um modelo de programação linear aplicado ao planejamento mineiro

Neste trabalho é discutido o impacto causado pelos parâmetros de processo com comportamento estocástico em um modelo de otimização, aplicado ao planejamento mineiro. Com base em um estudo de caso real, construiu-se um modelo matemático representando o processo produtivo associado à mineração, beneficiamento e comercialização de carvão mineral. Este modelo foi otimizado com a técnica de programação linear, sendo a solução ótima perturbada pelo comportamento estocástico de um dos principais parâmetros envolvidos no processo produtivo. A análise dos resultados permitiu avaliar o risco associado à decisão ótima, sendo com isto proposta uma metodologia para avaliação do risco operacional.

Non-linear dynamics of a tower orchard sprayer based on an inverted pendulum model

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Genetic analysis of the temperament of Nellore cattle using linear and threshold models

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Efficient certification of feasibility and objective value of linear programs and its applications

The use of linear programming in various areas has increased with the significant improvement of specialized solvers. Linear programs are used as such to model practical problems, or as subroutines in algorithms such as formal proofs or branch-and-cut frameworks. In many situations a certified answer is needed, for example the guarantee that the linear program is feasible or infeasible, or a provably safe bound on its objective value. Most of the available solvers work with floating-point arithmetic and are thus subject to its shortcomings such as rounding errors or underflow, therefore they can deliver incorrect answers. While adequate for some applications, this is unacceptable for critical applications like flight controlling or nuclear plant management due to the potential catastrophic consequences. We propose a method that gives a certified answer whether a linear program is feasible or infeasible, or returns unknown'. The advantage of our method is that it is reasonably fast and rarely answers unknown'. It works by computing a safe solution that is in some way the best possible in the relative interior of the feasible set. To certify the relative interior, we employ exact arithmetic, whose use is nevertheless limited in general to critical places, allowing us to rnremain computationally efficient. Moreover, when certain conditions are fulfilled, our method is able to deliver a provable bound on the objective value of the linear program. We test our algorithm on typical benchmark sets and obtain higher rates of success compared to previous approaches for this problem, while keeping the running times acceptably small. The computed objective value bounds are in most of the cases very close to the known exact objective values. We prove the usability of the method we developed by additionally employing a variant of it in a different scenario, namely to improve the results of a Satisfiability Modulo Theories solver. Our method is used as a black box in the nodes of a branch-and-bound tree to implement conflict learning based on the certificate of infeasibility for linear programs consisting of subsets of linear constraints. The generated conflict clauses are in general small and give good rnprospects for reducing the search space. Compared to other methods we obtain significant improvements in the running time, especially on the large instances.

Cholesky Residuals for Assessing Normal Errors in a Linear Model with Correlated Outcomes: Technical Report

Despite the widespread popularity of linear models for correlated outcomes (e.g. linear mixed models and time series models), distribution diagnostic methodology remains relatively underdeveloped in this context. In this paper we present an easy-to-implement approach that lends itself to graphical displays of model fit. Our approach involves multiplying the estimated margional residual vector by the Cholesky decomposition of the inverse of the estimated margional variance matrix. The resulting "rotated" residuals are used to construct an empirical cumulative distribution function and pointwise standard errors. The theoretical framework, including conditions and asymptotic properties, involves technical details that are motivated by Lange and Ryan (1989), Pierce (1982), and Randles (1982). Our method appears to work well in a variety of circumstances, including models having independent units of sampling (clustered data) and models for which all observations are correlated (e.g., a single time series). Our methods can produce satisfactory results even for models that do not satisfy all of the technical conditions stated in our theory.