Publication | Closed Access

Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures

EngineeringOtis-mesh Optoelectronic ArchitecturesLocal Search (Optimization)Traveling Salesman ProblemComputer EngineeringDiscrete OptimizationParallel ProgrammingVehicle Routing ProblemSalesman ProblemParallel ComputingCombinatorial OptimizationComputational GeometryParallel MetaheuristicsVariable Neighborhood SearchOperations Research