Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem With Time Windows

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-20520-0_51
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A QUBO Model for the Traveling Salesman Problem With Time Windows

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

PLoS ONE
Multidisciplinary
2016English

Optimization Approaches for the Traveling Salesman Problem With Drone

SSRN Electronic Journal
2015English

A Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem

2007English

Optimization of Postal Routes by Genetic Algorithm for Solving the Multiple Traveling Salesman Problem

CBU International Conference Proceedings
2015English

The Traveling Salesman Problem

English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

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

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2019English

A Hybrid Firefly Algorithm €“ Ant Colony Optimization for Traveling Salesman Problem

Jurnal Buana Informatika
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy