Ozdamar L.2023-06-162023-06-1620071109-2769https://hdl.handle.net/20.500.14365/3900We propose a dual sequence Simulated Annealing algorithm, DSAC, for solving constrained optimization problems. This approach eliminates the need for imposing penalties in the objective function by tracing feasible and infeasible solution sequences independently. We compare DSAC with a similar single sequence algorithm, PSAC, where the objective function is augmented by various penalty forms related to constraint infeasibilities. Numerical experiments show that DSAC is more effective than its counterpart PSAC in the worst and average case performances.eninfo:eu-repo/semantics/closedAccessConstrained optimizationFeasible and infeasible solution sequencesLocal searchPenaltiesSimulated annealingAlgorithmsConstraint theoryProblem solvingSimulated annealingConstrained optimizationDual sequence simulated annealing algorithmLocal searchOptimizationArticle2-s2.0-33751560793