Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices.
Vladimir G. DeinekoGeorge SteinerZhihui XuePublished in: J. Comb. Optim. (2005)
Keyphrases
- traveling salesman problem
- robotic cell
- polynomially solvable
- scheduling problem
- processing times
- combinatorial optimization
- ant colony optimization
- np complete
- flowshop
- np hard
- special case
- optimization problems
- combinatorial optimization problems
- traveling salesman
- vehicle routing problem
- valid inequalities
- crossover operator
- subtour elimination
- rows and columns
- job shop scheduling
- force control
- neural network
- hamiltonian cycle
- genetic local search
- single machine
- upper bound
- setup times
- metaheuristic