Solving dynamic traveling salesman problems with deep reinforcement learning
A traveling salesman problem (TSP) is a well-known NP-complete problem. Traditional TSP
presumes that the locations of customers and the traveling time among customers are fixed …
presumes that the locations of customers and the traveling time among customers are fixed …
Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …
salesman problem, where colors are used to differentiate salesmen's the accessibility to …
The one-dimensional dynamic dispatch waves problem
We study same-day delivery systems by formulating the dynamic dispatch waves problem
(DDWP), which models a depot where delivery requests arrive dynamically throughout a …
(DDWP), which models a depot where delivery requests arrive dynamically throughout a …
Solving the dynamic vehicle routing problem under traffic congestion
This paper proposes a dynamic vehicle routing problem (DVRP) model with nonstationary
stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel …
stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel …
Colored traveling salesman problem
J Li, MC Zhou, Q Sun, X Dai… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
The multiple traveling salesman problem (MTSP) is an important combinatorial optimization
problem. It has been widely and successfully applied to the practical cases in which multiple …
problem. It has been widely and successfully applied to the practical cases in which multiple …
Evaluating the effects of supply chain quality management on food firms' performance: The mediating role of food certification and reputation
H Song, R Turson, A Ganguly, K Yu - International Journal of …, 2017 - emerald.com
Purpose The purpose of this paper is to identify the two kinds of supply chain quality
management (SCQM) capabilities: intra-SCQM and inter-SCQM, and explore the effect of …
management (SCQM) capabilities: intra-SCQM and inter-SCQM, and explore the effect of …
Finding paths with least expected time in stochastic time-varying networks considering uncertainty of prediction information
Z Zhang, M Li - IEEE Transactions on Intelligent Transportation …, 2023 - ieeexplore.ieee.org
An increasing number of vehicles cause the deteriorating congestion problem, which leads
to the excessive time spent in commuting. Thus, finding fast driving paths gathers growing …
to the excessive time spent in commuting. Thus, finding fast driving paths gathers growing …
A dynamic traveling salesman problem with stochastic arc costs
A Toriello, WB Haskell, M Poremba - Operations Research, 2014 - pubsonline.informs.org
We propose a dynamic traveling salesman problem (TSP) with stochastic arc costs
motivated by applications, such as dynamic vehicle routing, in which the cost of a decision is …
motivated by applications, such as dynamic vehicle routing, in which the cost of a decision is …
Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
This paper first introduces the fundamental principles of immune algorithm (IA), greedy
algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid …
algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid …
Delaunay-triangulation-based variable neighborhood search to solve large-scale general colored traveling salesman problems
X Xu, J Li, MC Zhou - IEEE Transactions on Intelligent …, 2020 - ieeexplore.ieee.org
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. It utilizes colors to differentiate the accessibility of its cities to its …
traveling salesman problem. It utilizes colors to differentiate the accessibility of its cities to its …