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.90016MaRDI 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
90C47: Minimax problems in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Self-organizing feature maps for the vehicle routing problem with backhauls, Combined location-routing problems -- a neural network approach, The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP, A columnar competitive model for solving multi-traveling salesman problem, An new self-organizing maps strategy for solving the traveling salesman problem, 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