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

被引:93
作者
Dowsland, Kathryn A.
Soubeiga, Eric
Burke, Edmund
机构
[1] Gower Opt Algorithms Ltd, Swansea SA3 4YH, W Glam, Wales
[2] Univ Nottingham, Sch Comp Sci & IT, Nottingham NG8 1BB, England
关键词
packing; logistics; simulated annealing; hyperheuristics;
D O I
10.1016/j.ejor.2005.03.058
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The current drive to reduce packaging waste has led many companies to consider the use of multi-trip containers or shippers in which to transport their products in order to reduce packaging waste. The efficiency of such systems obviously depends on selecting shipper dimensions in such a way as to ensure high volumetric utilisation. As is the case with many practical problems the efficiency/solution quality can be improved if problem specific information is used to enhance the operation of a meta-heuristic solution approach. The problem can be modelled as a p-median problem but is too large to be solved in reasonable time without further modification. Four such modifications, all based on properties of the physical problem, are introduced and incorporated into a hyperheuristic driven simulated annealing solution approach. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:759 / 774
页数:16
相关论文
共 42 条
[1]   A survey of very large-scale neighborhood search techniques [J].
Ahuja, RK ;
Ergun, Ö ;
Orlin, JB ;
Punnen, AP .
DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) :75-102
[2]   A NOTE ON SOLVING LARGE P-MEDIAN PROBLEMS [J].
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) :270-273
[3]   AN APPLICATION OF THE MICRO TO PRODUCT DESIGN AND DISTRIBUTION [J].
BISCHOFF, E ;
DOWSLAND, WB .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1982, 33 (03) :271-280
[4]  
Burke E., 2003, HDB METAHEURISTICS, P457, DOI DOI 10.1007/0-306-48056-5_16
[5]   A new placement heuristic for the orthogonal stock-cutting problem [J].
Burke, EK ;
Kendall, G ;
Whitwell, G .
OPERATIONS RESEARCH, 2004, 52 (04) :655-671
[6]   A tabu-search hyperheuristic for timetabling and rostering [J].
Burke, EK ;
Kendall, G ;
Soubeiga, E .
JOURNAL OF HEURISTICS, 2003, 9 (06) :451-470
[7]   A survey of computational approaches to three-dimensional layout problems [J].
Cagan, J ;
Shimada, K ;
Yin, S .
COMPUTER-AIDED DESIGN, 2002, 34 (08) :597-611
[8]   An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem [J].
Congram, RK ;
Potts, CN ;
van de Velde, SL .
INFORMS JOURNAL ON COMPUTING, 2002, 14 (01) :52-67
[9]  
Cowling P, 2001, LECT NOTES COMPUT SC, V2079, P176
[10]  
Cowling P, 2002, LECT NOTES COMPUT SC, V2279, P1