The Hub center problem: modeling, tractability, and solution via a single-relocation algorithm with tabu search

Pamuk, Fatma Selcen


The planar hub location problem: a probabilistic clustering approach
İyigün, Cem (Springer Science and Business Media LLC, 2013-12-01)
Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.
The Unit Commitment Problem: A Mixed Integer Coded Genetic Algorithm-based Approach
Karabaş, Tolga; Meral, Fatma Sedef (2019-06-24)
Unit commitment(UC) is one of the essential activities in power systems planning and operation that comprises two decisions: scheduling of on/off states of electricity generating units and their dispatching over the planning horizon. The objective is the minimization of total operating costs -fuel and startup costs-, while meeting the forecasted load requirements, and satisfying several operational and technical constraints. Some of these constraints are initial status restriction of each unit, minimum up a...
The one-warehouse multi-retailer problem: reformulation, classification, and computational results
Solyali, Oguz; Süral, Haldun (2012-07-01)
We consider the one-warehouse multi-retailer problem where a warehouse replenishes multiple retailers with deterministic dynamic demands over a horizon. The problem is to determine when and how much to order to the warehouse and retailers such that the total system-wide costs are minimized. We propose a new (combined transportation and shortest path based) integer programming reformulation for the problem in addition to the echelon stock and transportation based formulations in the literature. We analyze th...
The congested multicommodity network design problem
Paraskevopoulos, Dimitris C.; Gürel, Sinan; Bektas, Tolga (2016-01-01)
This paper studies a version of the fixed-charge multicommedity network design problem where in addition to the traditional costs of flow and design, congestion at nodes is explicitly considered. The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm usi...
The multi-resource agent bottleneck generalised assignment problem
Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01)
In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...
Citation Formats
F. S. Pamuk, “The Hub center problem: modeling, tractability, and solution via a single-relocation algorithm with tabu search,” Middle East Technical University, 1997.