We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and exten...

We present a generic branch-and-bound algorithm for finding all the Pareto solutions of biobjective mixed-integer linear program. The main contributions are new algorithms obtaining dual bounds at node, checking node fathoming, presolve, and duality gap measurement. Our is predominantly decision space search method because branching performed on variables, akin to single objective problems, alt...

in this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. we consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. the transportation system arises in the form of a star/star net...

This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and integer variables. MLD systems include constrained linear systems, finite state machines, some cl...

In this paper, a cardinality constrained mean-variance model is introduced for the portfolio optimization problems. This model is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. The use of heuristic algorithms in this case is necessary. Some studies have investigated the cardinality constrained mean-variance model using heuristic algorithm. But alm...

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

In this paper, a cooperative task computation framework exploits the resource in user equipments (UEs) to accomplish more tasks meanwhile minimizes power consumption of UEs. The system cost includes UEs' and penalty unaccomplished tasks, is minimized by jointly optimizing binary offloading decisions, computational frequencies, transmit power. To solve formulated mixed-integer non-linear program...

Most production planning models are deterministic and often assume a linear relation between production volume and production cost. In this paper, we investigate a production planning problem in a steel production process considering the energy consumption cost which is a nonlinear function of the production quantity. Due to the uncertain environment, the production demands are stochastic. Taki...