Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Comparing Greedy Constructive Heuristic Subtour Elimination Methods For The Traveling Salesman Problem, Petar Jackovich, Bruce A. Cox, Raymond R. Hill
Comparing Greedy Constructive Heuristic Subtour Elimination Methods For The Traveling Salesman Problem, Petar Jackovich, Bruce A. Cox, Raymond R. Hill
Faculty Publications
Purpose — This paper aims to define the class of fragment constructive heuristics used to compute feasible solutions for the traveling salesman problem (TSP) into edge-greedy and vertex-greedy subclasses. As these subclasses of heuristics can create subtours, two known methodologies for subtour elimination on symmetric instances are reviewed and are expanded to cover asymmetric problem instances. This paper introduces a third novel subtour elimination methodology, the greedy tracker (GT), and compares it to both known methodologies. Design/methodology/approach — Computational results for all three subtour elimination methodologies are generated across 17 symmetric instances ranging in size from 29 vertices to 5,934 …
Research In Defense Logistics: Where Are We And Where Are We Going?, George A. Zsidisin, Amanda Bresler, Benjamin T. Hazen, Keith F. Schneider, Taylor H. Wilkerson
Research In Defense Logistics: Where Are We And Where Are We Going?, George A. Zsidisin, Amanda Bresler, Benjamin T. Hazen, Keith F. Schneider, Taylor H. Wilkerson
Faculty Publications
The purpose of this paper is to provide insight on high-interest areas of research in defense-related logistics and supply chain management and opportunities for advancing theory and practice in this domain.
A Scenario-Based Parametric Analysis Of The Army Personnel-To-Assignment Matching Problem, Matthew D. Ferguson, Raymond R. Hill, Brian J. Lunday
A Scenario-Based Parametric Analysis Of The Army Personnel-To-Assignment Matching Problem, Matthew D. Ferguson, Raymond R. Hill, Brian J. Lunday
Faculty Publications
This study aims to compare linear programming and stable marriage approaches to the personnel assignment problem under conditions of uncertainty. Robust solutions should exhibit reduced variability of solutions in the presence of one or more additional constraints or problem perturbations added to some baseline problems.
Several variations of each approach are compared with respect to solution speed, solution quality as measured by officer-to-assignment preferences and solution robustness as measured by the number of assignment changes required after inducing a set of representative perturbations or constraints to an assignment instance. These side constraints represent the realistic assignment categorical priorities and limitations …