A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation

DOI10.1016/j.ejor.2005.03.058zbMath1127.90007OpenAlexW1987220363MaRDI QIDQ863991

Eric Soubeiga, Kathryn A. Dowsland, Edmund Kieran Burke

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.058

zbMATH Keywords

simulated annealingpackinglogisticshyperheuristics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Unified encoding for hyper-heuristics with application to bioinformatics, Fast machine reassignment, A hyper-heuristic approach to sequencing by hybridization of DNA sequences, A cooperative hyper-heuristic search framework, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, A new model and a hyper-heuristic approach for two-dimensional shelf space allocation, A simulated annealing hyper-heuristic methodology for flexible decision support, A graph-based hyper-heuristic for educational timetabling problems, Advancing Shannon entropy for measuring diversity in systems, Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems, New feature selection paradigm based on hyper-heuristic technique, Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem, Monte Carlo hyper-heuristics for examination timetabling, Hyper-heuristic approaches for the response time variability problem, Determining the best shipper sizes for sending products to customers

Uses Software

• Hyperheuristics
• OR-Library

Cites Work

• A survey of very large-scale neighborhood search techniques
• A comparison of two dual-based procedures for solving the p-median problem
• A note on solving large p-median problems
• Determining an upper bound for a class of rectangular packing problems
• An efficient tabu search procedure for the \(p\)-median problem
• A dynamic programming heuristic for the \(P\)-median problem
• Applied simulated annealing
• Some experiments with simulated annealing techniques for packing problems
• A robust simulated annealing based examination timetabling system.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• The rectangular packing problem: local optimum search methods based on block structures
• An exact algorithm for the pallet loading problem
• A hybrid heuristic for the \(p\)-median problem
• Two-dimensional packing problems: a survey
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Order Allocation for Stock Cutting in the Paper Industry
• Convergence of an annealing algorithm
• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
• Variable neighborhood search for the p-median
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Evolutionary Computation in Combinatorial Optimization
• A note on an open-end bin packing problem
• Unnamed Item
• Unnamed Item
• Unnamed Item