Browsing Industrial Engineering by Issue Date
Now showing items 21-40 of 216
-
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
(Elsevier, 2010-12-01)Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that ... -
Lane-exchange mechanisms for truckload carrier collaboration
(Informs, 2011-02)Because of historically high fuel prices, the trucking industry's operating expenses are higher than ever and thus profit margins are lower than ever. To cut costs, the trucking industry is searching for and exploring new ... -
Flexible aircraft fleeting and routing at TunisAir
(Palgrave Macmillan, 2011-02)This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of ... -
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ... -
Relaxations and exact solution of the variable sized bin packing problem
(Springer Science+Business Media, 2011-03)We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this ... -
Exact approaches for integrated aircraft fleeting and routing at TunisAir
(Science+Business Media, 2011-06)We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost ... -
Exact methods for the robotic cell problem
(Springer Science+Business Media, 2011-06)This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. ... -
Bounding strategies for the hybrid flow shop scheduling problem
(Elsevier, 2011-07-01)In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ... -
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
(Informs, 2011-08)The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ... -
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ... -
Integrated blood collection and appointment scheduling
(Institute of Industrial Engineers, 2012)Considering the processing requirements of donated blood, we study an integrated blood collection and appointment scheduling problem. We develop a mixed integer programming model to maximize the amount of donated blood ... -
Modelling and solving an m-location, n-courier, priority-based planning problem on a network
(Springer Nature, 2012-01)In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the ... -
Calibrating artificial neural networks by global optimization
(Elsevier, 2012-01)Artificial neural networks (ANNs) are used extensively to model unknown or unspecified functional relationships between the input and output of a “black box” system. In order to apply the generic ANN concept to actual ... -
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
(Elsevier, 2012-05)We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and ... -
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
(Elsevier, 2012-05)This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact ... -
A branch-and-cut algorithm for the Steiner tree problem with delays
(Springer Science+Business Media, 2012-12)In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ... -
Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem
(Elsevier, 2012-12-25)We propose a new nature inspired metaheuristic approach based on the V flight formation of the migrating birds which is proven to be an effective formation in energy saving. Its performance is tested on quadratic assignment ... -
Solving credit card fraud detection problem by the new metaheuristics migrating birds optimization
(Springer Science+Business Media, 2013)Statistical fraud detection problem is a very difficult problem in that there are very few examples of fraud. The great majority of transactions are legitimate. On the other hand, for this binary classification problem the ... -
Applying migrating birds optimization to credit card fraud detection
(Springer Science+Business Media, 2013)We discuss how the Migrating Birds Optimization algorithm (MBO) is applied to statistical credit card fraud detection problem. MBO is a recently proposed metaheuristic algorithm which is inspired by the V flight formation ... -
A novel and successful credit card fraud detection system Implemented in a Turkish Bank
(IEEE, 2013)We developed a credit card fraud detection solution for a major bank in Turkey. The study was completed in about three years and the developed system has been in use since February 2013. It had a great impact in the rule ...
Share this page