A colored traveling salesman problem with varying city colors

DOI10.1155/2021/4533483zbMath1486.90040OpenAlexW4200517719MaRDI QIDQ2065425

Jun Li, Xianghu Meng, Meng Chu Zhou

Publication date: 7 January 2022

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/4533483

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Uses Software

• TSPLIB

Cites Work

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• Dynamic path optimization in sharing mode to relieve urban traffic congestion
• Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment
• Distribution of waiting time for dynamic pickup and delivery problems

This page was built for publication: A colored traveling salesman problem with varying city colors