Search Results - binary crew search algorithm

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

“… 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…”
Get full text

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

“… To improve the rest time of crews, this paper proposes a binary programming model to optimise the NMDPP…”
Get full text

Binary Fruit Fly Swarm Algorithms for the Set Covering Problem by Crawford, Broderick, Soto, Ricardo, de la Fuente Mella, Hanns, Elortegui, Claudio, Palma, Wenceslao, Torres-Rojas, Claudio, Vasconcellos-Gaete, Claudia, Becerra, Marcelo, Pe馻, Javier, Misra, Sanjay

Get full text

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

“…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…”
Get full text

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

“…•Among three initial solution models the single crew assignment works faster.•The relaxed models perform efficiently under binary recovery assumption…”
Get full text

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

“…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…”
Get full text

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

“… The problem is solved by a genetic algorithm (GA) that uses binary encoding and standard genetic operators adapted to the problem…”
Get full text

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

“…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…”
Get full text

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

“…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…”
Get full text

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

“… 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…”
Get full text

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

“…Constructing a random binary search tree with n nodes needs /spl theta/(nlog n) time on RAM, and /spl omega/(log n…”
Get full text

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

“…The main contribution of this paper is to present a simple exhaustive search algorithm for the quadratic un-constraint binary optimization (QUBO) problem…”
Get full text

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

“… We propose a genetic algorithm (GA) that uses the binary encoding and the standard genetic operators adapted to the problem…”
Get full text

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

“…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…”
Get full text

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

“…An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented…”
Get full text

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

“…(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…”
Get full text

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

“…We present a unified parallel algorithm for constructing various search trees. The tree construction is based on a unified scheme, called bottom-level balancing…”
Get full text

Parallel algorithms for geometric intersection graphs by Kim, Sung Kwon

“…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…”
Get full text

Coloring permutation graphs in parallel by Nikolopoulos, Stavros D.

“…— 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…”
Get full text