Competition-based neural network for the multiple travelling salesmen problem with minmax objective
From MaRDI portal
Publication:1302604
DOI10.1016/S0305-0548(98)00069-0zbMath0940.90016OpenAlexW2089754250MaRDI QIDQ1302604
Abdolhamid Modares, Takao Enkawa, Samerkae Somhom
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00069-0
Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)
Related Items (7)
The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ A simple model for the multiple traveling salesmen problem with single depot and multiple sink ⋮ A columnar competitive model for solving multi-traveling salesman problem ⋮ An new self-organizing maps strategy for solving the traveling salesman problem ⋮ Combined location-routing problems -- a neural network approach
This page was built for publication: Competition-based neural network for the multiple travelling salesmen problem with minmax objective
