Sökning: "asymmetric generalized multiple traveling salesman problem"
Hittade 1 avhandling innehållade orden asymmetric generalized multiple traveling salesman problem.
1. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem
Sammanfattning : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. LÄS MER
Resultatsidor:
1