The Dynamic Multi-objective Multi-vehicle Covering Tour Problem

Abstract

This work introduces a new routing problem called the Dynamic Multi-Objective Multi-vehicle Covering Tour Problem (DMOMCTP). The DMOMCTPs is a combinatorial optimization problem that represents the problem of routing multiple vehicles to survey an area in which unpredictable target nodes may appear during execution. The formulation includes multiple objectives that include minimizing the cost of the combined tour cost, minimizing the longest tour cost, minimizing the distance to nodes to be covered and maximizing the distance to hazardous nodes. This study adapts several existing algorithms to the problem with several operator and solution encoding variations. The efficacy of this set of solvers is measured against six problem instances created from existing Traveling Salesman Problem instances which represent several real countries. The results indicate that repair operators, variable length solution encodings and variable-length operators obtain a better approximation of the true Pareto front.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 2013
Accession Number
ADA587192

Entities

People

  • Joshua S. Ziegler

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Algorithms
  • Artificial Intelligence
  • Autonomous Underwater Vehicles
  • Computations
  • Computer Science
  • Control Systems
  • Department Of Defense
  • Evolutionary Algorithms
  • Genetic Algorithms
  • Geographic Information Systems
  • Information Systems
  • Optimization
  • Random Variables
  • Two Dimensional
  • Unmanned Aerial Vehicles

Fields of Study

  • Computer science

Readers

  • Distributed Systems and Data Platform Development
  • Operations Research