A colored traveling salesman problem with varying city colors

DOI10.1155/2021/4533483MaRDI QIDQ2065425zbMATH OpenOpenAlexFDO

Authors Xianghu Meng, Jun Li, MengChu Zhou

Publication date 7 January 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• The traveling salesman problem with flexible coloring
• Traveling salesman problem in a time varying network
• Comparison of heuristics for the colourful travelling salesman problem
• The Colorful Traveling Salesman Problem
• A multivariant travelling-salesman problem

Cites work

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

Cited in

(2)

• The traveling salesman problem with flexible coloring
• Comparison of heuristics for the colourful travelling salesman problem

Describes a project that uses

Uses Software

• TSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065425)