Journal of Heuristics, Volume 16
Volume 16, Number 1, February 2010
Francisco Parreño, Ramón Alvarez-Valdés, J. F. Oliveira, José Manuel Tamarit: Neighborhood structures for the container loading problem: a VNS implementation. 1-22- Masataka Mizusawa, Masahito Kurihara: Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms. 23-36
- Halit Üster, Sarath K. S. Kumar: Algorithms for the design of network topologies with balanced disjoint rings. 37-63
- Liangjun Ke, Zuren Feng, Zhigang Ren, Xiaoliang Wei: An ant colony optimization approach for the multidimensional knapsack problem. 65-83
- João Claro, Jorge Pinho de Sousa: A multiobjective metaheuristic for a mean-risk multistage capacity investment problem. 85-115
Volume 16, Number 2, April 2010
- Jarl Eirik Korsvik, Kjetil Fagerholt: A tabu search heuristic for ship routing and scheduling with flexible cargo quantities. 117-137
- Camino R. Vela, Ramiro Varela, Miguel A. González: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. 139-165
- Julia A. Bennell, Xiang Song: A beam search implementation for the irregular shape packing problem. 167-188
- Jade Herbots, Willy Herroelen, Roel Leus: Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning. 189-209
- Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari: Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. 211-233
Volume 16, Number 3, June 2010
- Teodor Gabriel Crainic, Michel Gendreau, Louis-Martin Rousseau: Special issue on recent advances in metaheuristics. 235-237
- Lars Magnus Hvattum, Halvard Arntzen, Arne Løkketangen, Fred Glover: Alternating control tree search for knapsack/covering problems. 239-258
- Gualtiero Colombo, Stuart M. Allen: A comparison of problem decomposition techniques for the FAP. 259-288
- Sabine Piana, Sebastian Engell: Hybrid evolutionary optimization of the operation of pipeless plants. 311-336
- Alberto García-Villoria, Rafael Pastor: Solving the response time variability problem by means of a psychoclonal approach. 337-351
- Lang Fan, Christine L. Mumford: A metaheuristic approach to the urban transit routing problem. 353-372
- Claude-Guy Quimper, Louis-Martin Rousseau: A large neighbourhood search approach to the multi-activity shift scheduling problem. 373-392
- John Silberholz, Bruce L. Golden: The effective application of a new approach to the generalized orienteering problem. 393-415
- Manar I. Hosny, Christine L. Mumford: The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms. 417-439
- Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill: An adaptive memory algorithm for the split delivery vehicle routing problem. 441-473
- Thibaut Lust, Jacques Teghem: Two-phase Pareto local search for the biobjective traveling salesman problem. 475-510
- Yun-Chia Liang, Min-Hua Lo: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. 511-535
Volume 16, Number 4, August 2010
- Michael Ciarleglio, J. Wesley Barnes, Sahotra Sarkar: ConsNet - A tabu search approach to the spatially coherent conservation area network design problem. 537-557
- Peter Brucker, Edmund K. Burke, Timothy Curtois, Rong Qu, Greet Vanden Berghe: A shift sequence based approach for nurse scheduling and a new benchmark dataset. 559-573
- Rafael Elizondo, Víctor Parada, Lorena Pradenas, Christian Artigues: An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport. 575-591
- Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem. 593-616
- Costas P. Pappis, Nikolaos Panagiotis Rachaniotis: Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires. 617-632
Volume 16, Number 5, October 2010
- Arild Hoff, Arnt-Gunnar Lium, Arne Løkketangen, Teodor Gabriel Crainic: A metaheuristic for stochastic service network design. 653-679
- Grégoire Carpentier, Gérard Assayag, Emmanuel Saint-James: Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach. 681-714
- Chris Wallace: ZI round, a MIP rounding heuristic. 715-722
Volume 16, Number 6, December 2010
- Jaime Cano-Belmán, Roger Z. Ríos-Mercado, Joaquín Bautista: A scatter search based hyper-heuristic for sequencing a mixed-model assembly line. 749-770
- José Antonio Vázquez Rodríguez, Sanja Petrovic: A new dispatching rule based genetic algorithm for the multi-objective job shop problem. 771-793
- Pablo Garrido, María Cristina Riff Rojas: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. 795-834
- David Meignan, Abderrafiaa Koukam, Jean-Charles Créput: Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism. 859-879
- Jorge Maturana, Frédéric Lardeux, Frédéric Saubion: Autonomous operator management for evolutionary algorithms. 881-909
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team