The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
Abstract
A new heuristic approach for minimizing the operating path of automated or computer numerically controlled drilling operations is described. The operating path is first defined as a travelling salesman problem. The new heuristic, particle swarm optimization, is then applied to the travelling salesman problem. A model for the approximate prediction of drilling time based on the heuristic solution is presented. The new method requires few control variables: it is versatile, robust and easy to use. In a batch production of a large number of items to be drilled such as in printed circuit boards, the travel time of the drilling device is a significant portion of the overall manufacturing process, hence the new particle swarm optimization–travelling salesman problem heuristic can play a role in reducing production costs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Cited by
Tasgetiren, M. F., Liang, Y.-C., Sevkli, M., & Gencyilmaz, G. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.024 · Cited by 557
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.12.030 · Cited by 445
Swarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Oppositional biogeography-based optimization
Ergezer, M., Simon, D., & Du, D. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346043 · Cited by 300
Leo Kumar, S. P. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.08.005 · Cited by 212
Metadata
- Authors
- Onwubolu, G. C., & Clerc, M.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 2004-02
- Volume
- 42
- Issue
- 3
- Pages
- 473-491
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W2128337573
- Cited by
- 179
- References
- 2
- FWCI
- 8.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. https://app.cochat.ai/papers/10.1080/00207540310001614150
- The paper
- Onwubolu, G. C., & Clerc, M. (2004). Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. International Journal of Production Research. https://doi.org/10.1080/00207540310001614150
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.