arXiv (All)
open access
Node-Shift-Encoding Genetic Algorithm with fuzzy-enhanced reference tour to solve the bi-objective service-oriented TSP
The Travelling Salesman Problem (TSP) remains a key area of research in combinatorial optimization, with applications in logistics, manufacturing, and service delivery. This paper addresses a bi-objective service-oriented TSP in which the clients' ranks in the delivery path matter. Unlike convention
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem#1014130
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
- GENERATIVE AI FOR SUPPLY CHAIN OPTIMIZATION: OPPORTUNITIES AND ETHICAL RISKS IN PROCUREMENT#692784
- NIST SP 800-146: Cloud Computing Synopsis and Recommendations#2899
- Network Mobility Route Optimization Solution Space Analysis#500873
Record · ID 998800
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive