Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Automating the Packing Heuristic Design Process with Genetic Programming

Evolutionary Computation (2012) 20 (1): 63–89.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Genetic Programming for Dynamic Workflow Scheduling in Fog Computing
  • Meng Xu
  • Yi Mei
  • Shiqiang Zhu
  • Beibei Zhang
  • Tian Xiang
  • Fangfang Zhang
  • Mengjie Zhang
IEEE Transactions on Services Computing (2023) 16 (4): 2657.
A Multi-Objective Genetic Programming Algorithm With α Dominance and Archive for Uncertain Capacitated Arc Routing Problem
  • Shaolin Wang
  • Yi Mei
  • Mengjie Zhang
IEEE Transactions on Evolutionary Computation (2023) 27 (6): 1633.
A review on learning to solve combinatorial optimisation problems in manufacturing
  • Cong Zhang
  • Yaoxin Wu
  • Yining Ma
  • Wen Song
  • Zhang Le
  • Zhiguang Cao
  • Jie Zhang
IET Collaborative Intelligent Manufacturing (2023) 5 (1)
A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems
  • Chaofan Tu
  • Ruibin Bai
  • Uwe Aickelin
  • Yuchang Zhang
  • Heshan Du
Expert Systems with Applications (2023) 230: 120568.
Evolving ensembles of heuristics for the travelling salesman problem
  • Francisco J. Gil-Gala
  • Marko Durasević
  • María R. Sierra
  • Ramiro Varela
Natural Computing (2023) 22 (4): 671.
Effective and Interpretable Rule Mining for Dynamic Job-Shop Scheduling via Improved Gene Expression Programming with Feature Selection
  • Adilanmu Sitahong
  • Yiping Yuan
  • Junyan Ma
  • Yongxin Lu
  • Peiyin Mo
Applied Sciences (2023) 13 (11): 6631.
Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity
  • Francisco J. Gil-Gala
  • María R. Sierra
  • Carlos Mencía
  • Ramiro Varela
Expert Systems with Applications (2023) 233: 120916.
A study of ant-based pheromone spaces for generation constructive hyper-heuristics
  • Emilio Singh
  • Nelishia Pillay
Swarm and Evolutionary Computation (2022) 72: 101095.
Using priority rules for resource-constrained project scheduling problem in static environment
  • Mateja Ðumić
  • Domagoj Jakobović
Computers & Industrial Engineering (2022) 169: 108239.
Genetic Programming With Niching for Uncertain Capacitated Arc Routing Problem
  • Shaolin Wang
  • Yi Mei
  • Mengjie Zhang
  • Xin Yao
IEEE Transactions on Evolutionary Computation (2022) 26 (1): 73.
On-line three-dimensional packing problems: A review of off-line and on-line solution approaches
  • Sara Ali
  • António Galrão Ramos
  • Maria Antónia Carravilla
  • José Fernando Oliveira
Computers & Industrial Engineering (2022) 168: 108122.
Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling
  • Francisco J. Gil-Gala
  • María R. Sierra
  • Carlos Mencía
  • Ramiro Varela
Natural Computing (2022) 21 (4): 553.
Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems
  • Yuan Sun
  • Xiaodong Li
  • Andreas Ernst
IEEE Transactions on Pattern Analysis and Machine Intelligence (2021) 43 (5): 1746.
Designing dispatching rules with genetic programming for the unrelated machines environment with constraints
  • Kristijan Jaklinović
  • Marko Ðurasević
  • Domagoj Jakobović
Expert Systems with Applications (2021) 172: 114548.
Adaptive elitist-ant system for solving combinatorial optimization problems
  • Anmar Abuhamdah
Applied Soft Computing (2021) 105: 107293.
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
  • Xavier Sánchez-Díaz
  • José Carlos Ortiz-Bayliss
  • Ivan Amaya
  • Jorge M. Cruz-Duarte
  • Santiago Enrique Conant-Pablos
  • Hugo Terashima-Marín
Applied Sciences (2021) 11 (21): 10209.
Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity
  • Francisco J. Gil-Gala
  • María R. Sierra
  • Carlos Mencía
  • Ramiro Varela
Swarm and Evolutionary Computation (2021) 66: 100944.
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
  • Melissa Sanchez
  • Jorge M. Cruz-Duarte
  • Jose Carlos Ortiz-Bayliss
  • Hector Ceballos
  • Hugo Terashima-Marin
  • Ivan Amaya
IEEE Access (2020) 8: 128068.
Ensemble strategies for population-based optimization algorithms – A survey
  • Guohua Wu
  • Rammohan Mallipeddi
  • Ponnuthurai Nagaratnam Suganthan
Swarm and Evolutionary Computation (2019) 44: 695.
On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems
  • Shelvin Chand
  • Quang Huynh
  • Hemant Singh
  • Tapabrata Ray
  • Markus Wagner
Information Sciences (2018) 432: 146.
Is Evolutionary Computation Evolving Fast Enough?
  • Graham Kendall
IEEE Computational Intelligence Magazine (2018) 13 (2): 42.
Evolutionary hyper-heuristics for tackling bi-objective 2D bin packing problems
  • Juan Carlos Gomez
  • Hugo Terashima-Marín
Genetic Programming and Evolvable Machines (2018) 19 (1-2): 151.
H3AD: A hybrid hyper-heuristic for algorithm design
  • Péricles B.C. Miranda
  • Ricardo B.C. Prudêncio
  • Gisele L. Pappa
Information Sciences (2017) 414: 340.
An Efficient Feature Selection Algorithm for Evolving Job Shop Scheduling Rules With Genetic Programming
  • Yi Mei
  • Su Nguyen
  • Bing Xue
  • Mengjie Zhang
IEEE Transactions on Emerging Topics in Computational Intelligence (2017) 1 (5): 339.
Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem
  • Carlos Contreras-Bolton
  • Carlos Rey
  • Sergio Ramos-Cossio
  • Claudio Rodríguez
  • Felipe Gatica
  • Victor Parada
Scientific Programming (2016) 2016: 1.
Automatic design of algorithms for the traveling salesman problem
  • Cristian Loyola
  • Mauricio Sepúlveda
  • Mauricio Solar
  • Pierre Lopez
  • Victor Parada
  • Yunfeng Zhang
Cogent Engineering (2016) 3 (1): 1255165.
Automated Design of Production Scheduling Heuristics: A Review
  • Jurgen Branke
  • Su Nguyen
  • Christoph W. Pickardt
  • Mengjie Zhang
IEEE Transactions on Evolutionary Computation (2016) 20 (1): 110.
Evolution of new algorithms for the binary knapsack problem
  • Lucas Parada
  • Carlos Herrera
  • Mauricio Sepúlveda
  • Víctor Parada
Natural Computing (2016) 15 (1): 181.
A comparative review of 3D container loading algorithms
  • Xiaozhou Zhao
  • Julia A. Bennell
  • Tolga Bektaş
  • Kath Dowsland
International Transactions in Operational Research (2016) 23 (1-2): 287.
The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems
  • Ghaith Jaradat
  • Masri Ayob
  • Ibrahim Almarashdeh
Applied Soft Computing (2016) 44: 45.
Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems
  • Nasser R. Sabar
  • Graham Kendall
Information Sciences (2015) 314: 225.
A Lifelong Learning Hyper-heuristic Method for Bin Packing
  • Kevin Sim
  • Emma Hart
  • Ben Paechter
Evolutionary Computation (2015) 23 (1): 37.
Evolving an Improved Algorithm for Envelope Reduction Using a Hyper-Heuristic Approach
  • Behrooz Koohestani
  • Riccardo Poli
IEEE Transactions on Evolutionary Computation (2014) 18 (4): 543.
A unified hyper-heuristic framework for solving bin packing problems
  • Eunice López-Camacho
  • Hugo Terashima-Marin
  • Peter Ross
  • Gabriela Ochoa
Expert Systems with Applications (2014) 41 (15): 6876.
Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms
  • Gisele L. Pappa
  • Gabriela Ochoa
  • Matthew R. Hyde
  • Alex A. Freitas
  • John Woodward
  • Jerry Swan
Genetic Programming and Evolvable Machines (2014) 15 (1): 3.
A genetic programming hyper-heuristic for the multidimensional knapsack problem
  • Ranulph Glanville
  • David Griffiths
  • Philip Baron
  • John H Drake
  • Matthew Hyde
  • Khaled Ibrahim
  • Ender Ozcan
Kybernetes (2014) 43 (9/10): 1500.
New Insights Into Diversification of Hyper-Heuristics
  • Zhilei Ren
  • He Jiang
  • Jifeng Xuan
  • Yan Hu
  • Zhongxuan Luo
IEEE Transactions on Cybernetics (2014) 44 (10): 1747.
Genetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments
  • Su Nguyen
  • Mengjie Zhang
  • Mark Johnston
  • Kay Chen Tan
Evolutionary Computation (2014) 22 (1): 105.
Hyper-heuristics: a survey of the state of the art
  • Edmund K Burke
  • Michel Gendreau
  • Matthew Hyde
  • Graham Kendall
  • Gabriela Ochoa
  • Ender Özcan
  • Rong Qu
Journal of the Operational Research Society (2013) 64 (12): 1695.
Understanding the structure of bin packing problems through principal component analysis
  • Eunice López-Camacho
  • Hugo Terashima-Marín
  • Gabriela Ochoa
  • Santiago Enrique Conant-Pablos
International Journal of Production Economics (2013) 145 (2): 488.
Hyper-Heuristics with Low Level Parameter Adaptation
  • Zhilei Ren
  • He Jiang
  • Jifeng Xuan
  • Zhongxuan Luo
Evolutionary Computation (2012) 20 (2): 189.

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter Sign Up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept