Abstract
A multi-bridge processing system (MBPS) has multiple bridge machines working at their serially arranged and partially overlapping workspaces. Its job scheduling can be abstracted as a colored travelling salesman problem (CTSP). CTSP is a new type of multiple traveling salesman problems in which each salesman must visit his exclusive cities and may visit some shared cities. This work presents a two-stage method for scheduling multi-bridge jobs first and resolve inter-bridge collision next. First, it proposes a population-based incremental learning (PBIL) algorithm to solve a serial-CTSP and the job scheduling problem of MBPS. PBIL processes two types of possibility vectors for city assignment/selection and a local search operation for improving its search ability. Second, this work designs a mechanism of collision resolution to remove potential inter-bridge collision contained in the obtained schedule. Finally, this work applies the proposed method to a triple-bridge waterjet cutting process to show its validity.
Original language | English (US) |
---|---|
Title of host publication | ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 151-156 |
Number of pages | 6 |
ISBN (Electronic) | 9781479980697 |
DOIs | |
State | Published - Jan 1 2015 |
Event | 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 - Taipei, Taiwan, Province of China Duration: Apr 9 2015 → Apr 11 2015 |
Other
Other | 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 |
---|---|
Country/Territory | Taiwan, Province of China |
City | Taipei |
Period | 4/9/15 → 4/11/15 |
All Science Journal Classification (ASJC) codes
- Instrumentation
- Control and Systems Engineering
- Computer Networks and Communications