Discrete optimization

About: Discrete optimization is a research topic. Over the lifetime, 4598 publications have been published within this topic receiving 158297 citations. The topic is also known as: discrete optimisation.

Optimum design of trusses with discrete sizing and shape variables

Abstract: The objective here is to present a method for optimizing truss structures with discrete design variables. The design variables are considered to be sizing variables as well as coordinates of joints. Both types of variables can be discrete simultaneously. Mixed continuous-discrete variables can also be considered. To increase the efficiency of the method, the structural responses, such as forces and displacements are approximated in each design cycle. The approximation of responses is carried out with respect to the design variables or their reciprocals. By substituting these approximate functions of the responses into the original design problem, an explicit high quality approximation is achieved, the solution of which does not require the detailed finite element analysis of the structure in each sub-optimization iteration. First it is assumed that all the design variables are continuous and a continuous variable optimization is performed. With the results of this step, the branch and bound method is employed on the same approximate problem to achieve a discrete solution. The numerical results indicate that the method is efficient and robust in terms of the required number of structural analyses. Several examples are presented to show the efficiency of the method.

Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes

Abstract: This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.

Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization

Abstract: In this paper, the basic characteristics of particle swarm optimization (PSO) for the global search are discussed at first, and then the PSO for the mixed discrete nonlinear problems (MDNLP) is suggested. The penalty function approach to handle the discrete design variables is employed, in which the discrete design variables are handled as the continuous ones by penalizing at the intervals. As a result, a useful method to determine the penalty parameter of penalty term for the discrete design variables is proposed. Through typical mathematical and structural optimization problems, the validity of the proposed approach for the MDNLP is examined.

Local Computation in Hypertrees

Abstract: This is an unpublished monograph that was widely distributed (and cited). It was first written in August 1988 and subseqently revised.

Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem

Abstract: A novel PSO method is presented for the discrete time-cost trade-off problem (DTCTP).The proposed discrete PSO outperforms the state-of-the-art methods.High quality solutions are achieved within seconds for large-scale instances.New large scale benchmark DTCTP instances are generated and are solved to optimal. Despite many research studies have concentrated on designing heuristic and meta-heuristic methods for the discrete time-cost trade-off problem (DTCTP), very little success has been achieved in solving large-scale instances. This paper presents a discrete particle swarm optimization (DPSO) to achieve an effective method for the large-scale DTCTP. The proposed DPSO is based on the novel principles for representation, initialization and position-updating of the particles, and brings several benefits for solving the DTCTP, such as an adequate representation of the discrete search space, and enhanced optimization capabilities due to improved quality of the initial swarm. The computational experiment results reveal that the new method outperforms the state-of-the-art methods, both in terms of the solution quality and computation time, especially for medium and large-scale problems. High quality solutions with minor deviations from the global optima are achieved within seconds, for the first time for instances including up to 630 activities. The main contribution of the proposed particle swarm optimization method is that it provides high quality solutions for the time-cost optimization of large size projects within seconds, and enables optimal planning of real-life-size projects.