<title>Abstract</title> A traveling salesman problem (TSP) is an NP-hard optimization problem. So it is necessary to use intelligent and heuristic methods to solve such a hard problem in a less computational time. This paper proposes a novel hybrid approach, which is a data mining (DM) based on multi-objective...

This article models the resource allocation problem in dynamic PERT networks with finite capacity of concurrent projects (COnstant Number of Projects In Process (CONPIP)), where activity durations are independent random variables with exponential distributions, and the new projects are generated...

This paper presents a novel model for designing a reliable network of facilities in closed-loop supply chain under uncertainty. For this purpose, a bi-objective mathematical programming formulation is developed which minimizes the total costs and the expected transportation costs after failures...