We consider stochastic discrete optimization problems where the decision variables are non-negative integers. We propose and analyze an on-line control scheme which transforms the problem into a “surrogate” continuous optimization problem and proceeds to solve the latter using standard gradient-based approaches while simultaneously updating both actual and surrogate system states. Convergence o...

The penalty method is a method to generate alternative solutions for many discrete optimization problems. A penalty parameter easily allows to have influence on the difference between optimal and alternative solution. We experimentally test the penalty method for three optimization problems (shortest paths, assignments, travelling salesman) with parameters that change between planning phase and...

A discrete whale optimization algorithm (DWOA) is presented to solve the no-wait flow shop scheduling problem (NWFSSP) with objective makespan. An effective combination of nearest neighbor (NN) and standard deviation heuristics (SDH) used acquire initial solutions population. After that, three crossover operators, two-point (TPX), multiple-point (MPX) job-based (JBX) are designed mimics humpbac...

Point feature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose positions for the labels that do not give rise to label overlaps and that minimize obscuration of features. A practical goal is to minimize the number of overlaps while considering cartographic preferences. This article proposes a new heuris...

In this paper, a novel discrete particle swarm optimization (PSO) algorithm is proposed to solve the team orienteering problem (TOP). Discrete evaluation is achieved by redefining all operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solu...

A new approach in the discrete optimization (partitioning and covering) problems is presented based on the expert knowledge presentations. An a priori uncertain information on the alternatives is given by some probability distribution and an a priori certain information on the knowledge competitions is given by some weights. A new criterion is introduced for a minimal fuzzy covering or partitio...