Journal of Heuristics, Volume 6

Volume 6, Number 1, April 2000

Eric Rosenberg: Telecommunications Network Case Study: Selecting a Data Network Architecture. 9-20
Rauf Izmailov, Atsushi Iwata, Bhaskar Sengupta: ATM Routing Algorithms for Multimedia Traffic in Private ATM Networks. 21-38
Joel W. Gannett: Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks. 39-64
Iraj Saniee, Joel S. Sokol: Virtual Path Design in Service-Specific ATM Networks. 65-83
Mor Armony, John G. Klincewicz, Hanan Luss, Moshe B. Rosenwein: Design of Stacked Self-Healing Rings Using a Genetic Algorithm. 85-105
Mario Pickavet, Piet Demeester: A Zoom-In Approach to Design SDH Mesh Restorable Networks. 107-130
Geraldo Robson Mateus, Henrique Pacca Loureiro Luna, Adriana B. Sirihal: Heuristics for Distribution Network Design in Telecommunication. 131-148
V. Sridhar, June S. Park, Bezalel Gavish: LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges. 149-166
Gustavo Paramés, Javier Calatrava, Gonzalo Carrión: Detecting and Preventing Routing Problems in the Planning Process of CCSS #7 Networks. 167-181

Rachid Chelouah, Patrick Siarry: A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions. 191-213
Laurent Hérault: Rescaled Simulated Annealing-Accelerating Convergence of Simulated Annealing by Rescaling the States Energies. 215-252
David Berger, Bernard Gendron, Jean-Yves Potvin, S. Raghavan, Patrick Soriano: Tabu Search for a Network Loading Problem with Multiple Facilities. 253-267
Maria Satratzemi, Constantine Tsouros, Frank Harary: An Heuristic Algorithm for Handling Multiple Responses. 269-282

Daniel Tuyttens, Jacques Teghem, Philippe Fortemps, K. Van Nieuwenhuyze: Performance of the MOSA Method for the Bicriteria Assignment Problem. 295-310
Esra Köktener Karasakal, Murat Köksalan: A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine. 311-327
Maciej Hapke, Andrzej Jaszkiewicz, Roman Slowinski: Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization. 329-345
Thomas Hanne: Global Multiobjective Optimization Using Evolutionary Algorithms. 347-360
Xavier Gandibleux, Arnaud Fréville: Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case. 361-383
Maria João Alves, João C. N. Clímaco: An Interactive Method for 0-1 Multiobjective Problems Using Simulated Annealing and Tabu Search. 385-403
Pedro Castro Borges: CHESS-Changing Horizon Efficient Set Search: A Simple Principle for Multiobjective Optimization. 405-418
Michael Pilegaard Hansen: Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP. 419-431

Tzung-Pei Hong, Hong-Shung Wang, Wei-Chou Chen: Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms. 439-455
Anant Singh Jain, Balasubramanian Rangaswamy, Sheik Meeran: New and "Stronger" Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996). 457-480
Irfan M. Ovacik, Srikanth Rajagopalan, Reha Uzsoy: Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems. 481-500
Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, Patrick Prosser: Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. 501-523
Louis Anthony Cox Jr., Jennifer Ryan Sanchez: Designing Least-Cost Survivable Wireless Backhaul Networks. 525-540