Sustainable supply chains depend on three critical decisions: production, inventory management, and distribution with reverse flows. To achieve an effective level of operational performance, policymakers must consider all these decisions, especially in Closed-Loop Supply Chains (CLSCs) remanufacturing option. In this research paper, we address the Integrated Production-Inventory-Routing Problem...

This paper presents a new formulation for the routing problem in which available fleet consists of trucks and trailers divided into compartments. Solving model large instances is computationally expensive. Therefore, we introduce implemented two-phase heuristic algorithm. In first phase, an initial solution generated through constructive algorithm based on concepts from classic Clarke–Wright se...

T integrated production and transportation scheduling problem (PTSP) with capacity constraints is common in many industries. An optimal solution to PTSP requires one to simultaneously solve the production scheduling and the transportation routing problems, which requires excessive computational time, even for relatively small problems. In this study, we consider a variation of PTSP that involve...

The network design problem we study in this paper is as follows. Given an undirected network, a set of origin-destination node pairs (commodities) and a demand for each commodity, the non-bifurcated network design problem is to install integer multiples of some capacity unit on the edges of the network and to route the commodities so that each commodity follows a single path. The objective is t...

One of the core problems in software product family (SPF) is the coordination of product building and core asset development, specifically the integration of production strategy decision and core asset scenario selection. In the current paper, a model of Cost Optimization under Functional And Quality (CoFAQ) goal satisfaction constraints is developed. It provides a systematic mechanism for mana...

In the dynamic Pickup and Delivery Problem with Transfers (dPDPT), a set of transportation requests that arrive at arbitrary times must be assigned to a fleet of vehicles. We use two cost metrics that capture both the company’s and the customer’s viewpoints regarding the quality of an assignment. In most related problems, the rule of thumb is to apply a two-phase local search algorithm to heuri...

In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new multiple stage search method, namely stochastic beam search algorithm, is proposed to solve it. New techniques such as an improved beam search scheme, a two-phase node goodness estimation, and a stochastic node selection criteria are proposed. Real-life ...

Nowadays railway companies are confronted with high infrastructure maintenance costs. Therefore good strategies are needed to carry out these maintenance activities in a most cost effective way. In this paper we solve the preventive maintenance scheduling problem (PMSP) using genetic algorithms, memetic algorithms and a two-phase heuristic based on opportunities. The aim of the PMSP is to sched...

Improved Formulations, Heuristics and Metaheuristics for the Dynamic Demand Coordinated Lot-sizing Problem. (August 2006) Arunachalam Narayanan, B.E., Anna University, India; M.S., Texas A&M University Chair of Advisory Committee: Dr. E. Powell Robinson Coordinated lot sizing problems, which assume a joint setup is shared by a product family, are commonly encountered in supply chain contexts. T...

Previous studies have solved many variations of the routing and wavelength assignment (RWA) problem in optical networks under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate the RWA problem while allowing for degradation of routed signals by optical components. The problem is formulated as a mixed-integer non-linear program. We propose a two-p...