A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- 1 June 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (3), 759-774
- https://doi.org/10.1016/j.ejor.2005.03.058
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A New Placement Heuristic for the Orthogonal Stock-Cutting ProblemOperations Research, 2004
- A Tabu-Search Hyperheuristic for Timetabling and RosteringJournal of Heuristics, 2003
- Genetic algorithms applied to leather lay plan material utilizationProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2003
- A survey of computational approaches to three-dimensional layout problemsComputer-Aided Design, 2002
- Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and OptimisationLecture Notes in Computer Science, 2002
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 2002
- An exact algorithm for the pallet loading problemEuropean Journal of Operational Research, 1987
- Determining an upper bound for a class of rectangular packing problemsComputers & Operations Research, 1985
- A note on solving large p-median problemsEuropean Journal of Operational Research, 1985
- An Application of the Micro to Product Design and DistributionJournal of the Operational Research Society, 1982