A colored traveling salesman problem with varying city colors
type: Item
instance of: scholarly article
title: A colored traveling salesman problem with varying city colors
zbMATH Open document ID: 1486.90040
DOI: 10.1155/2021/4533483
author: Xianghu Meng
author: Jun Li
author: MengChu Zhou
published in: Discrete Dynamics in Nature and Society
publication date: 2022-01-07T00:00:00Z
review text: Summary: A colored traveling salesman problem (CTSP) is a path optimization problem in which colors are used to characterize diverse matching relationship between cities and salesmen. Namely, each salesman has a single color while every city has one to multiple salesmen's colors, thus allowing salesmen to visit exactly once the cities of their colors. It is noteworthy that cities' accessibilities to salesmen may change over time, which usually takes place in the multiwarehouse distribution of online retailers. This work presents a new CTSP with dynamically varying city colors for describing and modeling some scheduling problems with variable city accessibilities. The problem is more complicated than the previously proposed CTSP with varying edge weights. In particular, the solution feasibility changes as the cities change their colors, that is, a feasible original solution path may become no longer feasible after city colors change. A variable neighborhood search (VNS) algorithm is presented to solve the new problem. Specifically, a dynamic environment simulator with an adjustable frequency and amplitude is designed to mimic such color changes. Then, direct-route encoding, greedy initialization, and appropriate population immigrant are proposed to form an enhanced VNS, and then its performance is evaluated. The results of extensive experiments show that the proposed VNS can quickly track the environmental changes and effectively resolve the problem.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7453822
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2021/4533483
OpenAlex ID: W4200517719
cites work: Dynamic path optimization in sharing mode to relieve urban traffic congestion
cites work: Distribution of waiting time for dynamic pickup and delivery problems
cites work: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
cites work: Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment
description: scientific article; zbMATH DE number 7453822