Exact Algorithms for the (A)symmetric Traveling Salesman Problem with Order Dependent Constraints and Objective Function

Abstract

This research focused on variants of the traveling salesman, k-Vertex problem, Knapsack problem and chance constrained problems was productive in making algorithmic improvements. Research was published in 6 top tier peer reviewed international journals with citation provided below. In addition, this research was presented at 11 academic conferences.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 30, 2020
Accession Number
AD1106379

Entities

People

  • Valentina Cacchiani

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Energy and Power Technologies
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Computations
  • Computer Programming
  • Dynamic Programming
  • Evolutionary Algorithms
  • Freight Transportation
  • Fuel Consumption
  • Genetic Algorithms
  • Integer Programming
  • Linear Programming
  • Literature
  • Mathematical Programming
  • Models
  • Networks
  • Operations Research
  • Optimization
  • Radio Communications
  • Random Variables
  • Vehicles

Readers

  • Defense Technology Research and Development.
  • Operations Research
  • Technical Research and Report Writing.