Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Browsing Endüstri Mühendisliği Bölümü Koleksiyonu by browse.metadata.publisher "Taylor and Francis"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    Article
    A Lot-Sizing Problem in Deliberated and Controlled Co-Production Systems
    (Taylor and Francis, 2021) Kabakulak, Banu; Ağralı, Semra; Taşkın, Z. Caner; Pamuk, Bahadır
    We consider an uncapacitated lot sizing problem in co-production systems, in which it is possible to produce multiple items simultaneously in a single production run. Each product has a deterministic demand to be satisfied on time. The decision is to choose which items to co-produce and the amount of production throughout a predetermined planning horizon. We show that the lot sizing problem with co-production is strongly NP-Hard. Then, we develop various mixed-integer linear programming (MILP) formulation of the problem and show that LP relaxations of all MILPs are equal. We develop a separation algorithm based on a set of valid inequalities, lower bounds based on a dynamic lot-sizing relaxation of our problem and a constructive heuristic that is used to obtain an initial solution for the solver, which form the basis of our proposed Branch & Cut algorithm for the problem. We test our models and algorithms on different data sets and provide the results.
  • Thumbnail Image
    Article
    Citation - WoS: 44
    Citation - Scopus: 40
    Branch-And Methods for the Electric Vehicle Routing Problem With Time Windows
    (Taylor and Francis, 2021) Çatay, Bülent; Duman, Ece Naz; Taş, Duygu
    In this paper, we address the electric vehicle routing problem with time windows and propose two branch-and-price-and-cut methods based on a column generation algorithm. One is an exact algorithm whereas the other is a heuristic method. The pricing sub-problem of the column generation method is solved using a label correcting algorithm. The algorithms are strengthened with the state-of-the-art acceleration techniques and a set of valid inequalities. The acceleration techniques include: (i) an intermediate column pool to prevent solving the pricing sub-problem at each iteration, (ii) a label correcting method employing the ng-route algorithm adopted to our problem, (iii) a bidirectional search mechanism in which both forward and backward labels are created, (iv) a procedure for dynamically eliminating arcs that connect customers to remote stations from the network during the path generation, (v) a bounding procedure providing early elimination of sub-optimal routes, and (vi) an integer programming model that generates upper bounds. Numerical experiments are conducted using a benchmark data set to compare the performances of the algorithms. The results favour the heuristic algorithm in terms of both the computational time and the number of instances solved. Moreover, the heuristic algorithm is shown to be specifically effective for larger instances. Both algorithms introduce a number of new solutions to the literature.
  • Thumbnail Image
    Article
    Citation - WoS: 10
    Citation - Scopus: 16
    Minimizing the Misinformation Spread in Social Networks
    (Taylor and Francis, 2019) Güney, Evren; Kuban, İ. Kuban Altınel; Tanınmış, Kübra; Aras, Necati
    The Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player’s problem. In both of them, the second player’s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.