Content
June 2018, Volume 24, Issue 3
- 457-481 Finding short and implementation-friendly addition chains with evolutionary algorithms
by Stjepan Picek & Carlos A. Coello Coello & Domagoj Jakobovic & Nele Mentens - 483-513 Metaheuristic approaches to the placement of suicide bomber detectors
by Carlos Cotta & José E. Gallardo - 515-550 On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem
by Sandra Zajac - 551-579 A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
by Christian Blum & Maria J. Blesa
April 2018, Volume 24, Issue 2
- 111-133 A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems
by J. Molina & A. D. López-Sánchez & A. G. Hernández-Díaz & I. Martínez-Salazar - 135-172 Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions
by Mădălina M. Drugan - 173-203 Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem
by Alexander Lawrinenko & Stefan Schwerdfeger & Rico Walter - 205-238 Pareto local search algorithms for the multi-objective beam angle optimisation problem
by Guillermo Cabrera-Guerrero & Andrew J. Mason & Andrea Raith & Matthias Ehrgott
February 2018, Volume 24, Issue 1
- 1-24 Variations on memetic algorithms for graph coloring problems
by Laurent Moalic & Alexandre Gondran - 25-47 Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem
by Marcella S. R. Martins & Myriam R. B. S. Delgado & Ricardo Lüders & Roberto Santana & Richard A. Gonçalves & Carolina P. Almeida - 49-81 Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing
by Alexander Biele & Lars Mönch - 83-109 Dynamic region visit routing problem for vehicles with minimum turning radius
by Douglas G. Macharet & Armando Alves Neto & Vila F. Camara Neto & Mario F. M. Campos
December 2017, Volume 23, Issue 6
- 417-447 Heterogeneous surface-to-air missile defense battery location: a game theoretic approach
by Nicholas T. Boardman & Brian J. Lunday & Matthew J. Robbins - 449-469 Constructive cooperative coevolution for large-scale global optimisation
by Emile Glorieux & Bo Svensson & Fredrik Danielsson & Bengt Lennartson - 471-500 Iterated local search for workforce scheduling and routing problems
by Fulin Xie & Chris N. Potts & Tolga Bektaş - 501-532 Constraint-based search for optimal Golomb rulers
by M. M. A. Polash & M. A. H. Newton & A. Sattar - 533-550 A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem
by H. Faria & M. G. C. Resende & D. Ernst
October 2017, Volume 23, Issue 5
- 285-319 On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
by Audrey Cerqueus & Xavier Gandibleux & Anthony Przybylski & Frédéric Saubion - 321-347 Metaheuristics approach for solving personalized crew rostering problem in public bus transit
by Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl - 349-366 When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem
by Jesus Garcia-Diaz & Jairo Sanchez-Hernandez & Ricardo Menchaca-Mendez & Rolando Menchaca-Mendez - 367-396 An efficient local search algorithm for the winner determination problem
by Haochen Zhang & Shaowei Cai & Chuan Luo & Minghao Yin - 397-415 A heuristic approach for the stochastic optimization of mine production schedules
by Luis Montiel & Roussos Dimitrakopoulos
August 2017, Volume 23, Issue 4
- 165-206 Mathematical programming based heuristics for the 0–1 MIP: a survey
by Saïd Hanafi & Raca Todosijević - 207-229 Finding near-optimal independent sets at scale
by Sebastian Lamm & Peter Sanders & Christian Schulz & Darren Strash & Renato F. Werneck - 231-256 A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production
by Folarin B. Oyebolu & Jeroen Lidth de Jeude & Cyrus Siganporia & Suzanne S. Farid & Richard Allmendinger & Juergen Branke - 257-283 Scatter search for trainees to software project requirements stable allocation
by Mangesh Gharote & Rahul Patil & Sachin Lodha
June 2017, Volume 23, Issue 2
- 81-110 Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
by Miguel A. González & Juan José Palacios & Camino R. Vela & Alejandro Hernández-Arauzo - 111-136 A heuristic approach for dividing graphs into bi-connected components with a size constraint
by Raka Jovanovic & Tatsushi Nishi & Stefan Voß - 137-164 A variable neighborhood search for the network design problem with relays
by Yiyong Xiao & Abdullah Konak
February 2017, Volume 23, Issue 1
- 1-30 Reference sharing: a new collaboration model for cooperative coevolution
by Min Shi & Shang Gao - 31-51 Network design through forests with degree- and role-constrained minimum spanning trees
by Laura Anton-Sanchez & Concha Bielza & Pedro Larrañaga - 53-80 A dynamic programming operator for tour location problems applied to the covering tour problem
by Leticia Vargas & Nicolas Jozefowiez & Sandra Ulrich Ngueveu
December 2016, Volume 22, Issue 6
- 783-813 Can Monte-Carlo Tree Search learn to sacrifice?
by Nathan Companez & Aldeida Aleti - 815-848 Minimizing cyclic cutwidth of graphs using a memetic algorithm
by Pallavi Jain & Kamal Srivastava & Gur Saran - 849-890 Order acceptance and scheduling with earliness and tardiness penalties
by Simon Thevenin & Nicolas Zufferey & Marino Widmer
October 2016, Volume 22, Issue 5
- 665-666 Editor’s Note on the MIC 2013 Special Issue of the Journal of Heuristics (Volume 22, Issue 4, August 2016)
by Manuel Laguna - 667-697 Roster evaluation based on classifiers for the nurse rostering problem
by Roman Václavík & Přemysl Šůcha & Zdeněk Hanzálek - 699-726 A novel GRASP solution approach for the Orienteering Problem
by Morteza Keshtkaran & Koorush Ziarati - 727-757 Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
by Kazuya Haraguchi - 759-782 Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
by Henning Meyerhenke & Peter Sanders & Christian Schulz
August 2016, Volume 22, Issue 4
- 359-363 New developments in metaheuristics and their applications
by Hoong Chuin Lau & Günther R. Raidl & Pascal Hentenryck - 365-382 DC-GRASP: directing the search on continuous-GRASP
by Tiago Maritan Ugulino Araújo & Lisieux Marie M. S. Andrade & Carlos Magno & Lucídio Anjos Formiga Cabral & Roberto Quirino Nascimento & Cláudio N. Meneses - 383-404 Multiobjective improved spatial fuzzy c-means clustering for image segmentation combining Pareto-optimal clusters
by Ahmed Nasreddine Benaichouche & Hamouche Oulhadj & Patrick Siarry - 405-429 A corridor method based hybrid algorithm for redundancy allocation
by Marco Caserta & Stefan Voß - 431-458 Analysing differences between algorithm configurations through ablation
by Chris Fawcett & Holger H. Hoos - 459-474 Proximity search heuristics for wind farm optimal layout
by Martina Fischetti & Michele Monaci - 475-505 A memetic algorithm for the virtual network mapping problem
by Johannes Inführ & Günther Raidl - 507-537 Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems
by Chandra Ade Irawan & Said Salhi & Zvi Drezner - 539-566 A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints
by Jorge E. Mendoza & Louis-Martin Rousseau & Juan G. Villegas - 567-585 New variable depth local search for multiple depot vehicle scheduling problems
by Tomoshi Otsuki & Kazuyuki Aihara - 587-611 An iterated greedy metaheuristic for the blocking job shop scheduling problem
by Marco Pranzo & Dario Pacciarelli - 613-648 Estimating parallel runtimes for randomized algorithms in constraint solving
by Charlotte Truchet & Alejandro Arbelaez & Florian Richoux & Philippe Codognet - 649-664 Flying elephants: a general method for solving non-differentiable problems
by Adilson Elias Xavier & Vinicius Layter Xavier
June 2016, Volume 22, Issue 3
- 245-271 Extending quick hypervolume
by Luís M. S. Russo & Alexandre P. Francisco - 273-300 The hypervolume based directed search method for multi-objective optimization problems
by Oliver Schütze & Víctor Adrián Sosa Hernández & Heike Trautmann & Günter Rudolph - 301-329 Comparative analysis of three metaheuristics for short-term open pit block sequencing
by Amin Mousavi & Erhan Kozan & Shi Qiang Liu - 331-358 Multi-wave algorithms for metaheuristic optimization
by Fred Glover
April 2016, Volume 22, Issue 2
- 125-145 Improving degree-based variable ordering heuristics for solving constraint satisfaction problems
by Hongbo Li & Yanchun Liang & Ning Zhang & Jinsong Guo & Dong Xu & Zhanshan Li - 147-179 PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem
by Gökalp Erbeyoğlu & Ümit Bilge - 181-198 Proximity Benders: a decomposition heuristic for stochastic programs
by Natashia Boland & Matteo Fischetti & Michele Monaci & Martin Savelsbergh - 199-220 A fast meta-heuristic approach for the $$(\alpha ,\beta )-k$$ ( α , β ) - k -feature set problem
by Mateus Rocha de Paula & Regina Berretta & Pablo Moscato - 221-244 Strategic oscillation for the capacitated hub location problem with modular links
by Ángel Corberán & Juanjo Peiró & Vicente Campos & Fred Glover & Rafael Martí
February 2016, Volume 22, Issue 1
- 1-53 Exploiting subproblem optimization in SAT-based MaxSAT algorithms
by Carlos Ansótegui & Joel Gabàs & Jordi Levy - 55-87 A GRASP metaheuristic for humanitarian aid distribution
by José M. Ferrer & M. Teresa Ortuño & Gregorio Tirado - 89-123 A mapping technique for better solution exploration: NSGA-II adaptation
by Julien Autuori & Faicel Hnaien & Farouk Yalaoui