Browsing by Keywords "Branchandcut"
Now showing items 115 of 15

An application of capacitated lotsizing model in petroleum sector
(Bilkent University, 2006)In this thesis, we study capacitated lotsizing problem with special feature, applicable to the petroleum refinery sector. In our model, the endproducts should be stored in itemspecific and capacitated storage tanks ... 
Benders decomposition algorithms for two variants of the single allocation hub location problem
(Springer, 2019)The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. This paper addresses two ... 
A branchandcut algorithm for quadratic assignment problems based on linearizations
(Elsevier, 200704)The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even though ... 
A branchandcut algorithm for the alternative fuel refueling station location problem with routing
(INFORMS, 2019)Because of the limited range of alternative fuel vehicles (AFVs) and the sparsity of the available alternative refueling stations (AFSs), AFV drivers cooperatively deviate from their paths to refuel. This deviation is ... 
A branchandcut algorithm for the hub location and routing problem
(Elsevier, 2014)We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total ... 
A branchandcut algorithm for twolevel survivable network design problems
(Elsevier, 2016)This paper approaches the problem of designing a twolevel network protected against singleedge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ... 
Exact solution approaches for nonHamiltonian vehicle routing problems
(Bilkent University, 201708)In this thesis, we study di erent nonHamiltonian vehicle routing problem variants and concentrate on developing e cient optimization algorithms to solve them. First, we consider the split delivery vehicle routing problem ... 
Hierarchical Survivable Network Design Problems
(Elsevier, 2016)We address the problem of designing twolevel networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals ... 
knodedisjoint hopconstrained survivable networks: polyhedral analysis and branch and cut
(SpringerVerlag France, 2018)Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the knodedisjoint hopconstrained network design problem is to find a minimum weight subgraph of ... 
The periodic vehicle routing problem with driver consistency
(Elsevier, 2018)The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ... 
The periodic vehicle routing problem with driver consistency
(Elsevier, 2018)The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ... 
Relay location in telecommunications and transportation networks
(Bilkent University, 201603)With di↵erent names and functions, relays play a crucial role in the design of telecommunications and transportation networks and finding optimal relay locations is an important concern in various applications. We ... 
The ring/κrings network design problem: model and branchandcut algorithm
(John Wiley & Sons, 2016)This article considers the problem of designing a twolevel network where the upper level consists of a backbone ring network connecting the socalled hub nodes, and the lower level is formed by access ring networks that ... 
Survivability in hierarchical telecommunications networks
(John Wiley & Sons, 2012)The survivable hierarchical telecommunications network design problem consists of locating concentrators, assigning user nodes to concentrators, and linking concentrators in a reliable backbone network. In this article, ... 
Time constrained maximal covering salesman problem with weighted demands and partial coverage
(Elsevier Ltd, 2016)In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of ...