.../methodology/approach As a non-deterministic polynomial complete (NP-complete) problem, this CDLSDP seems difficult to be solved by a polynomial-time method. To handle this problem effectively and efficiently, a four-phase heuristic that balances the setup and inventory costs in the coordinating and delivery...

...Mariusz Pyrz; Jadwiga Zawidzka The potential of two distinct approaches applied to the truss discrete optimization problem is presented in the paper. The sequential discrete optimization method SDO (which is a deterministic procedure, using heuristics based on the idea of fully stressed truss...