A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

Determining the best location to be profitable for the facility’s lifetime is the important decision of public and private firms, so this is why discussion about dynamic location problems (DLPs) is a critical significance. This paper presented a comprehensive review from 1968 up to most recent...

This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new...

Aggregate production-distribution planning (APDP) is one of the most critical and strategic process in supply chains. Considering the prevalence of supplier selection and inventory control problems in supply chain management, this paper addresses the economic optimization of supply chain...