closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. in this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. first, a mixed-integer linear programming formulation is developed to maximize the total profit. the main contribution...

Nowadays, there is a great deal of attention for regulations of carbon emissions to enforce the decision-makers of production and distribution networks to redesign their systems satisfactorily. The literature has seen a rapid interest in developing novel metaheuristics to solve this problem as a complicated optimization problem. Such difficulties motivate us to address a production-distribution...

Models that aim to optimize the design of supply chain networks have gained more interest in the supply chain literature. Mixed-integer linear programming and discrete-event simulation are widely used for such an optimization problem. We present a hybrid approach to support decisions for supply chain network design using a combination of analytical and discrete-event simulation models. The prop...

This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...

We report on a growing class of assignment problems that are increasingly of interest and very challenging in terms of the difficulty they pose to attempts at exact solution. These problems address economic issues in the location and design of factories, hospitals, depots, transportation hubs and military bases. Others involve improvements in communication network design. In this article we sur...

We investigate the problem of topology design of an optical network by bottleneck-cut identification. For an optical network, the topology-design problem can be viewed as a combined two-layer design problem: physical-topology design and virtual-topology design. In this study, we present the definition of bottleneck cut of an optical network. A heuristic algorithm is proposed to find the bottlen...

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

Recent papers in the concept of Supply Chain Network Design (SCND) have seen a rapid development in applying the stochastic models to get closer to real-world applications. Regaring the special characteristics of each product, the stracture of SCND varies. In tire industry, the recycling and remanufacturing of scraped tires lead to design a closed-loop supply chain. This paper proposes a two-st...