A Neural-Network-Based Approach to the Double Traveling Salesman Problem

摘要

The double traveling salesman problem is a variation of the basic travel- ing salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function. The proposed solution is based on a self-organizing map structure, Initialized with as many artificial neurons as the number of targets to be Reached.