nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and re-cently has been considered as one of the most important research topic. in this paper, a metaheuristic algo-rithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. in this method, the 1d-...

recently, much attention has been given to stochastic demand due to uncertainty in the real -world. in the literature, decision-making models and suppliers' selection do not often consider inventory management as part of shopping problems. on the other hand, the environmental sustainability of a supply chain depends on the shopping strategy of the supply chain members. the supplier selection pl...

Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute ...

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...

In this paper, we present a problem independent general purpose parallel implementation of simulated annealing on distributed message-passing multiproces-sor systems. The sequential algorithm is studied and we give a classiication of combinatorial optimization problems together with their neighborhood structures. Several parallelization approaches are examined c on-sidering their suitability fo...

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

The aim of this paper is to provide a parallel strategy to be used when implementing the Simulated Annealing process by distributed memory systems. It focuses the attention on the portfolio selection problem with dynamic and integer constraints on the variables. However, this method can be extended to any dynamic optimisation problem as the optimal control. In the first part it develops the seq...