Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 31 for “"branch-and-price algorithm"”.
-
A Branch-and-Price Algorithm for Bin Packing Problem
… pack a set of items of various sizes. Employing branch-and-bound and column generation usually requires designation of the problem-specific branching rules compatible with the nature of the pricing sub-problem of column generation, or alternatively it requires determination of the k-best …
-
A branch-and-price algorith, for a compressor scheduling problem
This work presents the study and application of a branch-and-price algorithm for solving a compressor scheduling problem. The problem is related to oil production and consists of defining a set of compressors to be activated, supplying the gas-lift demand of a set of wells and minimizing the …
-
Lot-sizing and inventory routing for a production-distribution supply chain
The integration of production and distribution decisions presents a challenging problem for manufacturers trying to optimize their supply chain. At the planning level, the immediate goal is to coordinate production, inventory, and delivery to meet customer demand so that the corresponding costs are …
-
Branch-and-price and multicommodity flows
… column generation based methods for linear and integer programming and apply them to three multicommodity flow problems. For (mixed) integer programming problems, the approach taken consists in reformulating an original model, using the Dantzig-Wolfe decomposition principle, and then …
-
A Multistage Stochastic Mixed-Integer Model for Perishable Capacity Expansion Problem
… multi-stage capacity expansion problem under demand uncertainty. We consider the problem where there are multiple resources to be expanded at each stage. Moreover, the resources have limited life time after acquisition. Our goal is to determine the time and size of each resource to be expanded so …
-
Home therapist network modeling
… companies depends on effective management and efficient operations. This dissertation aims at reducing costs and improving productivity for home healthcare companies. The first part of the research involves the development of a new formulation for the therapist routing and scheduling …
-
Service Consistency in Vehicle Routing
… are considered, namely, driver consistency and time consistency. Driver consistency refers to using the fewest number of different drivers to perform all of the visits required by a customer over a planning horizon and time consistency refers to visiting a customer at roughly the same time …
-
SCHEDULING UNRELATED PARALLEL BATCH PROCESSING MACHINES WITH VARIOUS CONSTRAINTS
… prove new properties of optimal solutions, and design the exact algorithm and a fast approximation algorithm. Second, we improve the formulations for UPBPM scheduling with 2D packing constraints and design the branch-and-price algorithm for this problem. Third, based on the previous …
-
OPTIMIZATION ALGORITHMS FOR THE SYMMETRIC AND ASYMMETRIC ELECTRIC TRAVELING SALESMAN PROBLEM
… vehicle needs to be recharged along the route, and, for this purpose, a set of recharge stations is provided. The aim is to visit all the customers once, minimizing the overall cost of recharged energy. We consider both the symmetric and asymmetric versions of the problem. We propose an extended …
-
Optimal Scheduling of Power Plant Maintenance with Gas Portfolio
… horizon so that the overall costs are minimized and all the constraints are satisfied. Optimization in maintenance scheduling could reduce greenhouse gases and help meeting the surging global energy demand. Maintenance scheduling with gas portfolio could not only cut down the cost for purchasing …
-
An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems
… programs which can be solved exactly using branch-and-price methods. However, in practice, in order to find a good schedule expediently, the branch-and-price tree is often only partially explored. A constraint branching heuristic called connection fixing often selects branches containing …
-
Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study
… programming model to determine the locations and capacities of charging facilities over finite planning horizons. We use the logit choice model to estimate drivers’ random choices towards different charging stations nearby. The objective of the model is to minimize the expected total cost of …
-
Saturation-based Algebraic Reasoning for Description Logic ALCHQ
… ALCHQ permits intersection, disjunction, and negation of concepts. It also allows existential and universal restrictions, role hierarchy, and qualified number restrictions that are of particular interest to us. Avalanche incorporates a number of widely applied and well known optimization …
-
A Branch-and-Price Framework for Time-Sensitive Request Routing in Terrestrial-Satellite Communication Networks
… connections, dynamic link availability, and intense competition for resources among time-sensitive data-routing requests. Existing routing protocols, such as Contact Graph Routing, typically rely on sequential heuristics that schedule requests one at a time, often failing to resolve …
-
Machine Learning-Enhanced Column Generation for the Crew Pairing Problem: Leveraging Gated Recurrent Units to Generate the Initial Restricted Master Problem
… Integer Column Generation frameworks such as the branch-and-price algorithm. This work proposes the integration of Gated Recurrent Units (GRU) into the stateof- the-art industry algorithms used to solve the crew pairing problem. This method, named the GRU-Enhanced Pairing Initializer (GEPI), …
-
New Models and Algorithms in Telecommunication Networks
… telecommunications industry is growing very fast and frequently faces technological developments. Due to the competition between service providers and high expected reliability from their customers, they should be able first, to migrate their networks to the novel advancements in order to be able …
-
Optimization Models for Kidney Paired Donation
… own is not a match. Compatibilities among donors and patients can be modelled in a digraph, whose vertex set represents a donor with or without a paired patient and an arc depicts compatibility between donors and patients. Kidney allocation in this context consists of finding a matching, i.e., a …
-
MOBILE EDGE COMPUTING NETWORK OPTIMIZATION
Smart mobile devices are becoming more and more important in every aspects of human life, and mobile application are becoming more and more resources demanding with a widening gap between the required resources and those available on mobile devices. To bridge this gap, Mobile Edge Computing …
-
Models and advanced optimization algorithms for the integrated management of logistics operations
In this thesis, we propose a set of algorithms regarding real combinatorial optimization problems in the context of transportation of goods. These problems consist in the combination of the vehicle routing problem with the two-dimensional bin-packing problem, which is also known as the vehicle …
Page 1 of 2