Suchergebnisse - Fast constructive algorithm

  1. 1

    An XGBoost-enhanced fast constructive algorithm for food delivery route planning problem von Wang, Xing, Wang, Ling, Wang, Shengyao, Chen, Jing-fang, Wu, Chuge

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.02.2021
    Veröffentlicht in Computers & industrial engineering (01.02.2021)
    “… •Food delivery route planning problem is studied.•XGBoost-enhanced fast constructive algorithm is proposed …”
    Volltext
    Journal Article
  2. 2

    A fast constructive path planning algorithm for mobile robot navigation von Maoudj, Abderraouf, Hentout, Abdelfetah, Christensen, Anders Lyhne, Kouider, Ahmed

    Veröffentlicht: IEEE 07.09.2021
    “… Instead, it is common to rely on heuristic and meta-heuristic algorithms to find near-optimal solutions …”
    Volltext
    Tagungsbericht
  3. 3
  4. 4

    A fast modified constructive-covering algorithm for binary multi-layer neural networks von Wang, Di, Chaudhari, Narendra. S.

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 01.12.2006
    Veröffentlicht in Neurocomputing (Amsterdam) (01.12.2006)
    “… In this paper, we propose modified constructive-covering algorithm (MCCA), which consists of two processes …”
    Volltext
    Journal Article
  5. 5

    A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration von Cinar, Didem, Gakis, Konstantinos, Pardalos, Panos M.

    ISSN: 0957-4174, 1873-6793
    Veröffentlicht: Elsevier Ltd 01.09.2016
    Veröffentlicht in Expert systems with applications (01.09.2016)
    “… •A new hybrid constructive heuristic including clustering is proposed.•Hybrid algorithm improves CPU time significantly and obtains fairly good solutions. The Clarke & Wright (C&W …”
    Volltext
    Journal Article
  6. 6

    A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria von Jungwattanakit, Jitti, Reodecha, Manop, Chaovalitwongse, Paveena, Werner, Frank

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.02.2009
    Veröffentlicht in Computers & operations research (01.02.2009)
    “… for large problem sizes, and hence heuristics are used to obtain good solutions in a reasonable time. The proposed constructive heuristics for sequencing the jobs start …”
    Volltext
    Journal Article
  7. 7

    A fast constructive algorithm for fixed channel assignment problem von Khan, J.A., Sait, S.M., Khan, S.A.

    ISBN: 9780780366855, 0780366859
    Veröffentlicht: IEEE 2001
    “… In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithm is to obtain a conflict free channel assignment to cells which satisfies traffic demand requirements …”
    Volltext
    Tagungsbericht
  8. 8

    Constructive algorithm for fully connected cascade feedforward neural networks von Qiao, Junfei, Li, Fanjun, Han, Honggui, Li, Wenjing

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 19.03.2016
    Veröffentlicht in Neurocomputing (Amsterdam) (19.03.2016)
    “… In this paper, a novel constructive algorithm, named fast cascade neural network (FCNN …”
    Volltext
    Journal Article
  9. 9

    Fast constructive heuristics for the uncapacitated inventory routing problem von Alarcón, Miguel Ángel Marfurt, Pedrosa, Lehilton Lelis Chaves, Usberti, Fábio Luiz

    ISSN: 1381-1231, 1572-9397
    Veröffentlicht: New York Springer US 01.06.2025
    Veröffentlicht in Journal of heuristics (01.06.2025)
    “… This paper focuses on the uncapacitated IRP, by introducing fast constructive heuristics integrating insights from approximation algorithms, particularly rounding techniques in linear programming (LP …”
    Volltext
    Journal Article
  10. 10

    A beam-search-based constructive heuristic for the PFSP to minimise total flowtime von Fernandez-Viagas, Victor, Framinan, Jose M.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.05.2017
    Veröffentlicht in Computers & operations research (01.05.2017)
    “… The proposed algorithm is inspired in the logic of the beam search, although it remains a fast constructive heuristic …”
    Volltext
    Journal Article
  11. 11

    A fast constructive learning algorithm for single-hidden-layer neural networks von Qin-Yu Zhu, Guang-Bin Huang, Chee-Kheong Siew

    ISBN: 9780780386532, 0780386531
    Veröffentlicht: IEEE 2004
    “… If it sticks in the local minimum in the learning process, the situation tends to be even worse. In Huang et al., a novel fast learning algorithm called extreme learning machine …”
    Volltext
    Tagungsbericht
  12. 12

    Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics von Wu, Peng, Cheng, Junheng, Chu, Feng

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.01.2021
    Veröffentlicht in Annals of operations research (01.01.2021)
    “… Due to its strong NP-hard nature, two fast new ϵ -constraint-based constructive heuristic algorithms are developed to solve …”
    Volltext
    Journal Article
  13. 13

    Models and algorithms for optimising two-dimensional LEGO constructions von Kollsker, Torkil, Malaguti, Enrico

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.02.2021
    Veröffentlicht in European journal of operational research (16.02.2021)
    “… •We introduce mathematical programming formulations and a fast heuristic for the problem.•We integrate the models and the heuristic into a matheuristic algorithm …”
    Volltext
    Journal Article
  14. 14

    ON the influence of parameter theta- on performance of RBF neural networks trained with the dynamic decay adjustment algorithm von Oliveira, Adriano L I, Medeiros, Ericles A, Rocha, Thyago A B V, Bezerra, Miguel E R, Veras, Ronaldo C

    ISSN: 0129-0657
    Veröffentlicht: Singapore 01.08.2006
    Veröffentlicht in International journal of neural systems (01.08.2006)
    “… The dynamic decay adjustment (DDA) algorithm is a fast constructive algorithm for training RBF neural networks (RBFNs …”
    Weitere Angaben
    Journal Article
  15. 15

    Bayesian Compressive Sensing Using Laplace Priors von Babacan, S.D., Molina, R., Katsaggelos, A.K.

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Veröffentlicht: New York, NY IEEE 01.01.2010
    Veröffentlicht in IEEE transactions on image processing (01.01.2010)
    “… Using our model, we develop a constructive (greedy) algorithm designed for fast reconstruction useful …”
    Volltext
    Journal Article
  16. 16

    Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances von Hasani, Keramat, Kravchenko, Svetlana A., Werner, Frank

    ISSN: 0305-215X, 1029-0273
    Veröffentlicht: Abingdon Taylor & Francis 02.01.2016
    Veröffentlicht in Engineering optimization (02.01.2016)
    “… The objective is to minimize the makespan. For this unary NP-hard problem, two fast constructive algorithms with a complexity of O(n 2 ) are presented …”
    Volltext
    Journal Article
  17. 17

    Improving constructive training of RBF networks through selective pruning and model selection von Oliveira, Adriano L.I., Melo, Bruno J.M., Meira, Silvio R.L.

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 01.03.2005
    Veröffentlicht in Neurocomputing (Amsterdam) (01.03.2005)
    “… The proposed method is an extension of the dynamic decay adjustment (DDA) algorithm, a fast constructive algorithm for classification problems …”
    Volltext
    Journal Article
  18. 18

    A bound on modeling error in observable operator models and an associated learning algorithm von Zhao, Ming-Jie, Jaeger, Herbert, Thon, Michael

    ISSN: 0899-7667
    Veröffentlicht: United States 01.09.2009
    Veröffentlicht in Neural computation (01.09.2009)
    “… The mathematical theory of OOMs gives rise to a family of constructive, fast, and asymptotically correct learning algorithms, whose statistical efficiency, however, depends crucially …”
    Weitere Angaben
    Journal Article
  19. 19

    A lagrangian relaxation algorithm for facility location of resource-constrained decentralized multi-project scheduling problems von Rostami, Mohammad, Bagherpour, Morteza

    ISSN: 1109-2858, 1866-1505
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020
    Veröffentlicht in Operational research (01.06.2020)
    “… Then, three heuristic/meta-heuristic methods are proposed to solve larger-size problems. To this end, a fast constructive heuristic algorithm …”
    Volltext
    Journal Article
  20. 20

    Heuristics for the mirrored traveling tournament problem von Ribeiro, Celso C., Urrutia, Sebastián

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.06.2007
    Veröffentlicht in European journal of operational research (16.06.2007)
    “… In this work, we tackle the mirrored version of this problem. We first propose a fast and effective constructive algorithm …”
    Volltext
    Journal Article