“…For specific combinatorial problems, such as the Traveling Salesman Problem, specialized neighborhood generators have been developed to be used in random sampling in optimization algorithms [3,10,27]. However, for mixed continuous/discrete domains, which are prevalent in many engineering optimization problems [12,18,22,28], appropriate neighborhood generators have not been developed. Many effective global and convex optimization algorithms for continuous problems have embedded the Markov chain Monte Carlo sampler known as Hit-and-Run (HR) [7,11,19,20,29,30].…”