咨询与建议

限定检索结果

文献类型

  • 36 篇 期刊文献
  • 13 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 50 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 33 篇 工学
    • 27 篇 计算机科学与技术...
    • 7 篇 电气工程
    • 3 篇 信息与通信工程
    • 2 篇 控制科学与工程
  • 33 篇 管理学
    • 33 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 21 篇 理学
    • 19 篇 数学
    • 2 篇 统计学(可授理学、...
  • 4 篇 经济学
    • 4 篇 应用经济学

主题

  • 50 篇 biased random-ke...
  • 12 篇 metaheuristics
  • 9 篇 combinatorial op...
  • 5 篇 heuristics
  • 4 篇 genetic algorith...
  • 4 篇 random keys
  • 3 篇 grasp
  • 3 篇 cloud computing
  • 3 篇 scheduling
  • 2 篇 routing
  • 2 篇 randomized heuri...
  • 2 篇 optimization
  • 2 篇 data mining
  • 2 篇 cutting pattern
  • 2 篇 maximum clique p...
  • 2 篇 two-dimensional ...
  • 2 篇 maximum quasi-cl...
  • 2 篇 heuristic
  • 2 篇 local search
  • 2 篇 facility locatio...

机构

  • 7 篇 at&t labs res al...
  • 3 篇 univ fed flumine...
  • 3 篇 inst fed educ ci...
  • 3 篇 at&t labs res 20...
  • 3 篇 univ fed rio gra...
  • 2 篇 tecnol monterrey...
  • 2 篇 univ fed ouro pr...
  • 2 篇 inst fed sudeste...
  • 2 篇 univ fed pernamb...
  • 1 篇 univ salerno dep...
  • 1 篇 univ republica i...
  • 1 篇 unesp curso cien...
  • 1 篇 univ porto fac e...
  • 1 篇 univ sao paulo l...
  • 1 篇 otto von guerick...
  • 1 篇 queen mary univ ...
  • 1 篇 institute of com...
  • 1 篇 univ nova lisboa...
  • 1 篇 univ hagen dept ...
  • 1 篇 univ estadual ca...

作者

  • 11 篇 resende mauricio...
  • 5 篇 goncalves jose f...
  • 5 篇 andrade carlos e...
  • 4 篇 ribeiro celso c.
  • 3 篇 buriol luciana s...
  • 3 篇 pinto bruno q.
  • 3 篇 rosseti isabel
  • 3 篇 pessoa luciana s...
  • 3 篇 resende m. g. c.
  • 2 篇 aggarwal vaneet
  • 2 篇 carvalho marco a...
  • 2 篇 andretta marina
  • 2 篇 londe mariana a.
  • 2 篇 gonzalez-velarde...
  • 2 篇 moran-mirabal l....
  • 2 篇 soares leonardo ...
  • 2 篇 silva r. m. a.
  • 2 篇 martarelli nadia...
  • 2 篇 stefanello ferna...
  • 2 篇 nagano marcelo s...

语言

  • 48 篇 英文
  • 2 篇 其他
检索条件"主题词=Biased Random-key Genetic Algorithm"
50 条 记 录,以下是21-30 订阅
排序:
A Hybrid biased random key genetic algorithm for a Production and Cutting Problem  15
A Hybrid Biased Random Key Genetic Algorithm for a Productio...
收藏 引用
15th IFAC Symposium on Information Control Problems in Manufacturing
作者: Goncalves, Jose Fernando Univ Porto Fac Econ INESC TEC LIAAD Rua Campo Alegre 823 P-4100 Oporto Portugal
This paper deals with a very common problem in the home-textile industry. Given a set of orders of small rectangles of fabric the problem consists of determining the lengths and widths of a set of large rectangles of ... 详细信息
来源: 评论
Heuristic approaches for a multi-mode resource availability cost problem in aircraft manufacturing
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2025年 176卷
作者: Bierbuesse, Jan Moench, Lars Biele, Alexander Univ Hagen Dept Math & Comp Sci D-58097 Hagen Germany Airbus Operat GmbH Programme & Integrated Planning D-21129 Hamburg Germany
A multi-mode time-constrained project scheduling problem with generalized temporal constraints arising in aircraft manufacturing is studied in the paper. We propose a priority rule-based heuristic (PRH) and a biased r... 详细信息
来源: 评论
The capacitated family traveling salesperson problem
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2024年 第4期31卷 2123-2153页
作者: Dominguez-Casasola, Saul Gonzalez-Velarde, Jose Luis Rios-Solis, Yasmin a. Reyes-Vega, Kevin Alain Tecnol Monterrey Sch Engn & Sci Monterrey Mexico
The capacitated family traveling salesperson problem (CFTSP) is about a graph in which nodes are partitioned into disjoint and differently weighted families. The objective is to find the shortest route that visits a g... 详细信息
来源: 评论
A flow-based model for the multivehicle covering tour problem with route balancing
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2024年 第5期31卷 2930-2955页
作者: Ota, Cristina Teruko Fiorotto, Diego Jacinto Ghidini, Carla Taviane Lucke da Silva de Oliveira, Washington Alves Univ Estadual Campinas UNICAMP Fac Ciencias Aplicadas R Pedro Zaccaria 1300 BR-13484350 Limeira SP Brazil
This paper introduces a new flow-based mathematical formulation for the multivehicle covering tour problem. This problem determines a set of vehicle routes for the available fleet;therefore, the total distance travele... 详细信息
来源: 评论
A biased random-key genetic algorithm for the Steiner triple covering problem
收藏 引用
OPTIMIZATION LETTERS 2012年 第4期6卷 605-619页
作者: Resende, Mauricio G. C. Toso, Rodrigo F. Goncalves, Jose Fernando Silva, Ricardo M. A. AT&T Labs Res Algorithms & Optimizat Res Dept Florham Pk NJ 07932 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA NIAAD Fac Econ Porto P-4200464 Oporto Portugal Univ Fed Pernambuco CIn Recife PE Brazil
We present a biased random-key genetic algorithm (BRKGA) for finding small covers of computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems.... 详细信息
来源: 评论
Superior genetic algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
Superior Genetic Algorithms for the Target Set Selection Pro...
收藏 引用
genetic and Evolutionary Computation Conference (GECCO)
作者: Doerr, Benjamin Krejca, Martin S. Nguyen Vu Ecole Polytech CNRS Inst Polytech Paris Lab Informat LIX Palaiseau France Ecole Polytech Inst Polytech Paris Palaiseau France
The target set selection problem (TSS) asks for a set of vertices such that an influence spreading process started in these vertices reaches the whole graph. The current state of the art for this NP-hard problem are t... 详细信息
来源: 评论
A Hybrid BRKGA for Joint Scheduling Production, Transport, and Storage/Retrieval in Flexible Job Shops
A Hybrid BRKGA for Joint Scheduling Production, Transport, a...
收藏 引用
genetic and Evolutionary Computation Conference (GECCO)
作者: Homayouni, S. Mahdi Fontes, Dalila B. M. M. Fontes, Fernando A. C. C. CESE INESC TEC Campus FEUPRua Dr Roberto P-4200465 Porto Portugal Univ Porto Fac Econ INESC TEC LIAAD Porto Portugal Univ Porto Fac Engn SYSTEC ARISE Porto Portugal
This paper addresses the joint scheduling of production operations, transport tasks, and storage/retrieval activities in flexible job shop systems where the production operations and transport tasks can be done by one... 详细信息
来源: 评论
A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows  1
收藏 引用
14th International Conference on Metaheuristics (MIC)
作者: Festa, Paola Guerriero, Francesca Resende, Mauricio G. C. Scalzo, Edoardo Univ Napoli Federico II Dept Math & Applicat I-80138 Naples Italy Univ Calabria Dept Mech Energy & Management Engn I-87036 Arcavacata Di Rende CS Italy Amazon Com Inc 333 108th Ave NE Bellevue WA 98004 USA Univ Washington 3900 E Stevens Way NE Seattle WA 98195 USA
This paper describes a biased random-key genetic algorithm (BRKGA) with implicit path-relinking for the Vehicle Routing Problem with Occasional Drivers (VRPOD). After a review of the relevant literature, the paper des... 详细信息
来源: 评论
The P-Next Center Problem with Capacity and Coverage Radius Constraints: Model and Heuristics  14th
The P-Next Center Problem with Capacity and Coverage Radius ...
收藏 引用
14th International Conference on Metaheuristics (MIC)
作者: Londe, Mariana A. Pessoa, Luciana S. Andrade, Carlos E. Pontificia Univ Catolica Rio de Janeiro Dept Ind Engn Rua Marques Sae Vicente 225 BR-22453900 Rio de Janeiro RJ Brazil AT&T Labs Res 200 South Laurel Ave Middletown NJ 07748 USA
This paper introduces a novel problem of facility location, called the p-next center problem with capacity and coverage radius constraints. We formulate a mixed integer programming model for this problem, and compare ... 详细信息
来源: 评论
Heuristic approaches for scheduling of a two-machine flowshop with outsourcing lead-time
收藏 引用
ENGINEERING OPTIMIZATION 2024年 第12期56卷 2431-2449页
作者: Kim, Eun-Seok Lee, Ik Sun Queen Mary Univ London Sch Business & Management London England Dong A Univ Sch Business Busan South Korea
This article studies a scheduling problem of a two-machine flowshop , considering outsourcing lead-time, where outsourcing a job incurs outsourcing cost as well as outsourcing lead-time. Each job has an option of bein... 详细信息
来源: 评论