Benchmark for Multiple Traveling Salesmen Problem with Visiting Constraints

Xin-Ai Dou; Qiang Yang; Xudong Gao; Zhenyu Lu; Dan-Ting Duan

doi:10.1109/mita60795.2024.10751704

ScienceGate Book Chapters

JOURNAL ARTICLE

Benchmark for Multiple Traveling Salesmen Problem with Visiting Constraints

Xin-Ai Dou Qiang Yang Xudong Gao Zhenyu Lu Dan-Ting Duan

Year: 2024 Pages: 1-8

DOI: 10.1109/mita60795.2024.10751704

Get Full-Text PDF Get Analytical Report

Keywords:

Benchmark (surveying) Computer science Mathematical optimization Travelling salesman problem Parallel computing Theoretical computer science Algorithm Mathematics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.31

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Supply Chain and Inventory Management

Social Sciences → Business, Management and Accounting → Management Information Systems

Benchmark for Multiple Traveling Salesmen Problem with Visiting Constraints

Metrics

Topics

Related Documents

Genetic Algorithm with Adapted Crossover Operators for Multiple Traveling Salesmen Problem with Visiting Constraints

A Comparative Study on Population-Based Evolutionary Algorithms for Multiple Traveling Salesmen Problem with Visiting Constraints

A Benchmark Test Suite for Multiple Traveling Salesmen Problem with Pivot Cities

The multiple traveling salesmen problem with moving targets

Ant colony optimization with shortest distance biased dispatch for visiting constrained multiple traveling salesmen problem