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 12 of 12 for “"Asymmetric Traveling Salesman Problem"”.
-
Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem.
Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
-
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
… of new flow-based formulations for the asymmetric traveling salesman problem (ATSP) and to the demonstration of their applicability in effectively solving some scheduling problems. The ATSP is commonly encountered in the areas of manufacturing planning and scheduling, and transportation …
-
From graphs to matrices, and back : new techniques for graph algorithms
… How well can we solve fundamental optimization problems if our algorithms have to run really quickly? The motivation for the research presented in this thesis stems from addressing the above question in the context of algorithmic graph theory. To pursue this direction, we develop a toolkit that …
-
Measuring Backtracking on Delivery Routes through Community Detection
… method, to predict suboptimality of Asymmetric Traveling Salesman Problem (ATSP) solutions. We find that backtracking does demonstrate viability as a predictor of suboptimality, particularly when it utilizes the Louvain algorithm or the Leiden algorithm for community detection. We …
-
Modeling, Analysis, and Exact Algorithms for Some Biomass Logistics Supply Chain Design and Routing Problems
… focuses on supply chain design and logistics problems with emphasis on biomass logistics and routing problems. In biomass logistics, we have studied problems arising in a switchgrass-based bio-ethanol supply chain encountered in the Southeast, and a corn stover harvest scheduling problem faced …
-
Minimizing current effects on autonomous surface craft operations in Singapore harbor
… second controller, Time-Optimal, uses Zermelo's problem and function minimization to find the time-optimal trajectory between two waypoints using a known current field. We further define near-time-optimal paths covering a set of waypoints by defining an asymmetric Traveling Salesman Problem (TSP) …
-
A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems
… hull representation for linear mixed integer 0-1 problems, and is particularly designed to exploit explicit or implicit special structures defined by the constraints of a problem. Specifically, inherent special structures are exploited by identifying specific classes of multiplicative factors that …
-
A Disassembly Optimization Problem
… to product disposal. One way to deal with this problem is to disassemble an obsolete product and utilize some of its components/subassemblies in the manufacturing of new products. This seems to be a promising solution because products now-a-days are made in accordance with the highest quality …
-
Modeling, Analysis and Solution Approaches for Some Optimization Problems: High Multiplicity Asymmetric Traveling Salesman, Primary Pharmaceutical Manufacturing Scheduling, and Lot Streaming in an Assembly System
… approaches for some optimization-related problems encountered in industrial and manufacturing settings. We begin by introducing a special type of traveling salesman problem called "High Multiplicity Asymmetric Traveling Salesman Problem" (HMATSP). We propose a new formulation for this …
-
Novel Approaches for Some Stochastic and Deterministic Scheduling Problems
… are commonly encountered in machine scheduling problems: uncertainty of problem parameters (in particular, due to job processing times), and batching of jobs for processing on capacitated machines. Our approach to address the uncertainty issue regards the indeterminate parameters as random …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… the general class of minimax mixed-integer 0-1 problems of the type that frequently arise in decomposition approaches and in a variety of location and scheduling problems. We conduct an extensive polyhedral analysis of this problem in order to tighten its representation using the …
-
Modeling and Analysis of a Feedstock Logistics Problem
… dissertation, we address a feedstock logistics problem associated with the delivery of switchgrass for conversion into biofuel. In order to satisfy the continual demand of biomass at a bioenergy plant, production fields within a 48-km radius of its location are assumed to be attracted into …