Suchergebnisse - binary crew search algorithm

A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems von 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 …”
Volltext

Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure von 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 …”
Volltext

Binary Fruit Fly Swarm Algorithms for the Set Covering Problem von 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

Volltext

Parallel dynamic programming von 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 …”
Volltext

A heuristic approach to an interdependent restoration planning and crew routing problem von 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 …”
Volltext

Modeling and solving a Crew Assignment Problem in air transportation von 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 …”
Volltext

Computing minimal doubly resolving sets of graphs von 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 …”
Volltext

Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning von 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 …”
Volltext

Solving the non-unicost set covering problem by using cuckoo search and black hole optimization von 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 …”
Volltext

A decomposition-based heuristic for a multicrew coordinated road restoration problem von 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 …”
Volltext

O(1) time algorithm on BSR for constructing a random binary search tree von 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 …”
Volltext

A Work-Time Optimal Parallel Exhaustive Search Algorithm for the QUBO and the Ising model, with GPU implementation von 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 …”
Volltext

Computing the metric dimension of graphs by genetic algorithms von 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 …”
Volltext

Parallel dynamic programming von 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 …”
Volltext

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

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

An optimal hypercube algorithm for the all nearest smaller values problem von 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 …”
Volltext

A Unified Approach to Construct Search Trees in Parallel von 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 …”
Volltext

Parallel algorithms for geometric intersection graphs von 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 …”
Volltext

Coloring permutation graphs in parallel von 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 …”
Volltext