An Efficient Two-Phase Metaheuristic Algorithm for the Time Dependent Traveling Salesman Problem

RAIRO - Operations Research - France
doi 10.1051/ro/2019006
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem With Precedence Constraints

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2014English

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

American Journal of Computational Mathematics
2019English

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2014English

Technical Note—Ann-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1980English

Accelerating the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

PLoS ONE
Multidisciplinary
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy