In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...

This paper introduces a context-oriented component-based application MDA (COCA-MDA) that modularizes the application’s context-dependent behaviour into context-oriented components. The components separate the application’s functional concerns from the extra-functional concerns. The application is organized into two casually connected layers: the base layer, which provides the application’s core...

Transportation network design problem (NDP) is inherently multi-objective in nature, because it involves a number of stakeholders with different needs. In addition, the decision-making process sometimes has to be made under uncertainty where certain inputs are not known exactly. In this paper, we develop three stochastic multi-objective models for designing transportation network under demand u...

Multiobjective mathematical programming problems, in particular the vector optimization problems, de ne a well known and studied area because of its relevance to numerous practical applications. In this paper vector optimization problems with a fuzzy nature are considered. In these problems usually it is assumed that all the objective functions involved come from the same decision maker. The pr...

Abstract This paper addresses the problem of approximating set all solutions for Multi-objective Markov Decision Processes. We show that in vast majority interesting cases, number is exponential or even infinite. In order to overcome this difficulty we propose approximate by means a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. prove ...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

The importance of social responsibility of corporate and business units is increasingly emphasized by researchers and practitioners in recent years. Since supply chains play important roles in today’s business environment, the issue of social responsibility should be considered carefully when designing and planning of supply chains to move towards sustainability. This paper addresses the proble...