ScholarLens Back to search
2008•Kongzhi yu jueceRequires access

Dynasearch Algorithms for Solving Time Dependent Traveling Salesman Problem

Da Jun Zhao

Open publisher page 4 citations

Abstract

Time dependent traveling salesman problem(TDTSP)is an extension of the traveling salesman problem(TSP),in which the travel time or cost between two nodes depends on not only the distance between the nodes,but also the time of day or the node position in the Hamilton cycle.In this paper,we formulate the model for the TDTSP based on the node position in the Hamilton cycle,and develop the novel dynasearch algorithms to solve it.Simulation shows that the dynasearch algorithms are superior to the most effective dynamic programming heuristics in local search area.

About this research paper

What this paper is about

Time dependent traveling salesman problem(TDTSP)is an extension of the traveling salesman problem(TSP),in which the travel time or cost between two nodes depends on not only the distance between the nodes,but also the time of day or the node position in the Hamilton cycle.In this paper,we formulate the model for the TDTSP based on the node position in the Hamilton cycle,and develop the novel dynasearch algorithms to solve it.Simulation shows that the dynasearch algorithms are superior to the most effective dynamic programming heuristics in local search area.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Time dependent traveling salesman problem(TDTSP)is an extension of the traveling salesman problem(TSP),in which the travel time or cost between two nodes depends on not only the distance between the nodes,but also the time of day or the node position in the Hamilton cycle.In this paper,we formulate the model for the TDTSP based on the node position in the Hamilton cycle,and develop the novel dynasearch algorithms to solve it.Simulation shows that the dynasearch algorithms are superior to the most effective dynamic programming heuristics in local search area.

Key concepts: Travelling salesman problem, 2-opt, Traveling purchaser problem, Bottleneck traveling salesman problem, Heuristics, Position (finance), Mathematical optimization, Node (physics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Dynasearch Algorithms for Solving Time Dependent Traveling Salesman Problem — Research Paper | ScholarLens