Topic
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.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work forms versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities, and merges approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmaoid utilities.
30 citations
25 Feb 2009
TL;DR: The vision is that mathematical tools of computer aided scheduling (CAS) will soon play a similar role in the design and operation of public transport systems as CAD systems in manufacturing.
Abstract: The mathematical treatment of planning problems in public transit has made significant advances in the last decade. Among others, the classical problems of vehicle and crew scheduling can nowadays be solved on a routine basis using combinatorial optimization methods. This is not yet the case for problems that pertain to the design of public transit networks, and for the problems of operations control that address the implementation of a schedule in the presence of disturbances. The article gives a sketch of the state and important developments in these areas, and it addresses important challenges. The vision is that mathematical tools of computer aided scheduling (CAS) will soon play a similar role in the design and operation of public transport systems as CAD systems in manufacturing.
30 citations
••
TL;DR: The performance of an emerging socio inspired metaheuristic optimization technique referred to as Cohort Intelligence (CI) algorithm is evaluated on discrete and mixed variable nonlinear constrained optimization problems.
Abstract: In this study, the performance of an emerging socio inspired metaheuristic optimization technique referred to as Cohort Intelligence (CI) algorithm is evaluated on discrete and mixed variable nonlinear constrained optimization problems. The investigated problems are mainly adopted from discrete structural optimization and mixed variable mechanical engineering design domains. For handling the discrete solution variables, a round off integer sampling approach is proposed. Furthermore, in order to deal with the nonlinear constraints, a penalty function method is incorporated. The obtained results are promising and computationally more efficient when compared to the other existing optimization techniques including a Multi Random Start Local Search algorithm. The associated advantages and disadvantages of CI algorithm are also discussed evaluating the effect of its two parameters namely the number of candidates, and sampling space reduction factor.
30 citations
•
01 Apr 1994
30 citations
••
TL;DR: This paper investigates the scheduling problem on a set of BPMs, arranged in parallel, which have different processing powers, and proposes a bi-objective ant colony optimization algorithm to minimize the makespan and the total energy consumption.
30 citations