Výsledky vyhledávání - binary crew search algorithm

  • Zobrazuji výsledky 1 - 19 z 19
Upřesnit hledání
  1. 1

    A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems Autor Astorga, Gino, Peña, Alvaro, Altimiras, Francisco, García, José, Peredo, Oscar

    ISSN: 1076-2787, 1099-0526
    Vydáno: Cairo, Egypt Hindawi Publishing Corporation 01.01.2018
    Vydáno v Complexity (New York, N.Y.) (01.01.2018)
    “… This article explores the application of Big Data techniques in the implementation of metaheuristic algorithms with the purpose of applying it to decision-making in industrial processes…”
    Získat plný text
    Journal Article
  2. 2

    Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure Autor Zhu, Zixuan, Xu, Ruihua, Wang, Fangsheng, Vansteenwegen, Pieter

    ISSN: 2324-9935, 2324-9943
    Vydáno: Taylor & Francis 03.05.2024
    “… To improve the rest time of crews, this paper proposes a binary programming model to optimise the NMDPP…”
    Získat plný text
    Journal Article
  3. 3
  4. 4

    Parallel dynamic programming Autor Huang, S.-H.S., Hongfei Liu, Viswanathan, V.

    ISSN: 1045-9219
    Vydáno: Los Alamitos, CA IEEE 01.03.1994
    “…Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988…”
    Získat plný text
    Journal Article
  5. 5

    A heuristic approach to an interdependent restoration planning and crew routing problem Autor Tajik, Nazanin, Barker, Kash, González, Andrés D., Ermagun, Alireza

    ISSN: 0360-8352, 1879-0550
    Vydáno: Elsevier Ltd 01.11.2021
    Vydáno v Computers & industrial engineering (01.11.2021)
    “…•Among three initial solution models the single crew assignment works faster.•The relaxed models perform efficiently under binary recovery assumption…”
    Získat plný text
    Journal Article
  6. 6

    Modeling and solving a Crew Assignment Problem in air transportation Autor Zeghal, F.M., Minoux, M.

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 16.11.2006
    “…A typical problem arising in airline crew management consists in optimally assigning the required crew members to each flight segment of a given time period, while complying with a variety of work…”
    Získat plný text
    Journal Article
  7. 7

    Computing minimal doubly resolving sets of graphs Autor Kratica, Jozef, Čangalović, Mirjana, Kovačević-Vujčić, Vera

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydáno: Kidlington Elsevier Ltd 01.07.2009
    Vydáno v Computers & operations research (01.07.2009)
    “… The problem is solved by a genetic algorithm (GA) that uses binary encoding and standard genetic operators adapted to the problem…”
    Získat plný text
    Journal Article
  8. 8

    Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning Autor Poddar, Prithvi, Esfahani, Ehsan Tarkesh, Dantu, Karthik, Chowdhury, Souma

    ISSN: 2161-8089
    Vydáno: IEEE 17.08.2025
    “…Operations in disaster response, search & rescue, and military missions that involve multiple agents demand automated processes to support the planning of the courses of action (COA…”
    Získat plný text
    Konferenční příspěvek
  9. 9

    Solving the non-unicost set covering problem by using cuckoo search and black hole optimization Autor Soto, Ricardo, Crawford, Broderick, Olivares, Rodrigo, Barraza, Jorge, Figueroa, Ignacio, Johnson, Franklin, Paredes, Fernando, Olguín, Eduardo

    ISSN: 1567-7818, 1572-9796
    Vydáno: Dordrecht Springer Netherlands 01.06.2017
    Vydáno v Natural computing (01.06.2017)
    “…The set covering problem is a classical optimization benchmark that finds application in several real-world domains, particularly in line balancing production, crew scheduling, and service installation…”
    Získat plný text
    Journal Article
  10. 10

    A decomposition-based heuristic for a multicrew coordinated road restoration problem Autor Akbari, Vahid, Sadati, Mir Ehsan Hesam, Kian, Ramez

    ISSN: 1361-9209, 1879-2340
    Vydáno: Elsevier Ltd 01.06.2021
    “… We provide an efficient novel heuristic algorithm for this problem. In our algorithm, the problem is first pre-processed to define a binary problem to generate initial…”
    Získat plný text
    Journal Article
  11. 11

    O(1) time algorithm on BSR for constructing a random binary search tree Autor Limin Xiang, Kazuo Ushijiam, Jianjun Zhao, Tianqing Zhang, Changjie Tang

    ISBN: 0780378407, 9780780378407
    Vydáno: IEEE 02.03.2004
    “…Constructing a random binary search tree with n nodes needs /spl theta/(nlog n) time on RAM, and /spl omega/(log n…”
    Získat plný text
    Konferenční příspěvek
  12. 12

    A Work-Time Optimal Parallel Exhaustive Search Algorithm for the QUBO and the Ising model, with GPU implementation Autor Tao, Masaki, Nakano, Koji, Ito, Yasuaki, Yasudo, Ryota, Tatekawa, Masaru, Katsuki, Ryota, Yazane, Takashi, Inaba, Yoko

    Vydáno: IEEE 01.05.2020
    “…The main contribution of this paper is to present a simple exhaustive search algorithm for the quadratic un-constraint binary optimization (QUBO) problem…”
    Získat plný text
    Konferenční příspěvek
  13. 13

    Computing the metric dimension of graphs by genetic algorithms Autor Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana

    ISSN: 0926-6003, 1573-2894
    Vydáno: Boston Springer US 01.11.2009
    “… We propose a genetic algorithm (GA) that uses the binary encoding and the standard genetic operators adapted to the problem…”
    Získat plný text
    Journal Article
  14. 14

    Parallel dynamic programming Autor Viswanathan, V., Huang, S.-H.S., Hongfei Liu

    ISBN: 0818620870, 9780818620874
    Vydáno: IEEE Comput. Soc. Press 1990
    “…Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal triangulation of polygons assume a similar form…”
    Získat plný text
    Konferenční příspěvek
  15. 15

    An optimal parallel minimax tree algorithm Autor Kirkpatrick, D.G., Przytycka, T.

    ISBN: 0818620870, 9780818620874
    Vydáno: IEEE Comput. Soc. Press 1990
    “…An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented…”
    Získat plný text
    Konferenční příspěvek
  16. 16

    An optimal hypercube algorithm for the all nearest smaller values problem Autor Kravets, D., Plaxton, C.G.

    ISBN: 0818664274, 9780818664274
    Vydáno: IEEE Comput. Soc. Press 1994
    “…(lg n) time on an (n/lg n)-processor CREW PRAM. In this paper, we present an O(lg n)-time n-processor normal hypercube algorithm for the ANSV problem…”
    Získat plný text
    Konferenční příspěvek
  17. 17

    A Unified Approach to Construct Search Trees in Parallel Autor Das, S.K., Kwang Bae Min

    ISBN: 0849324939, 9780849324932
    ISSN: 0190-3918
    Vydáno: 1994
    “…We present a unified parallel algorithm for constructing various search trees. The tree construction is based on a unified scheme, called bottom-level balancing…”
    Získat plný text
    Konferenční příspěvek
  18. 18

    Parallel algorithms for geometric intersection graphs Autor Kim, Sung Kwon

    ISBN: 9798207240183
    Vydáno: ProQuest Dissertations & Theses 01.01.1990
    “…This dissertation presents efficient parallel algorithms on the PRAM for solving several problems on the interval graphs, circular-arc graphs, and intersection graphs of rectangles, assuming…”
    Získat plný text
    Dissertation
  19. 19

    Coloring permutation graphs in parallel Autor Nikolopoulos, Stavros D.

    ISSN: 1571-0653, 1571-0653
    Vydáno: Elsevier B.V 01.05.1999
    “…— We study the problem of coloring permutations graphs using some properties of the Lattice representation of a permutation and the relationship between permutations and binary search trees…”
    Získat plný text
    Journal Article