Index Catalog // Dickinson Scholar

Nova pesquisa

Filtragem por: Date created tesim

2018

Palavra-chave

Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS)

Coleção

Mathematics Faculty Publications

A Comparison of Algorithms for Finding an Efficient Theme Park Tour

Correspondências de palavras-chave:

... Hindawi Journal of Applied Mathematics Volume 2018, Article ID 2453185, 14 pages https://doi.org ...

... /10.1155/2018/2453185 Research Article A Comparison of Algorithms for Finding an Efficient Theme Park Tour ...

... @dickinson.edu Received 23 August 2018; Accepted 17 September 2018; Published 16 October 2018 Academic Editor ...

... : Quanke Pan Copyright 2018 Elizabeth L. Bouzarth et al. This is an open access article distributed under ...

mais >>

O Criador:

Bouzarth, Elizabeth L. , Forrester, Richard J., Hutson, Kevin R. , Isaac, Rahul, Midkiff, James , Rivers, Danny , and Testa, Leonard J.

Descrição:

The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a...

Tipo:

Article