Double Fuzzy Stopping Rule for a hybrid metaheuristic for the Strip Packing Problem.pdf

Double Fuzzy Stopping Rule for a hybrid metaheuristic for the Strip Packing Problem.pdf

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Double Fuzzy Stopping Rule for a hybrid metaheuristic for the Strip Packing Problem

Double Fuzzy Stopping Rule for a hybrid metaheuristic for the Strip Packing Problem Jesu?s David Beltra?n Cano, Jose Eduardo Caldero?n Benito Ignacio Jose? Garc??a del Amo, Rayco Jorge Cabrera, Jose? A. Moreno Pe?rez and J. Marcos Moreno-Vega Departamento de E., I.O. y Computacio?n Escuela Te?cnica Superior de Ingenier??a Informa?tica, Universidad de La Laguna. 38271 La Laguna SPAIN. e-mail: jamoreno@ull.es, jmmoreno@ull.es Abstract: In this work we propose a double fuzzy stopping rule for an hybrid metaheuristic approach to solve the Strip Packing Problem (SPP). The hybrid algorithm has two phases, in the second phase a Variable Neighbourhood Search (VNS) improves the quality of part of the solutions obtained with a Greedy Randomized Adaptive Search Procedure (GRASP) in the first phase. The stopping rule is one of the elements of the metaheuristics least studied due to, among other reasons, the imprecision in the terminology used by experts to formulate good stopping rules. We formulate in fuzzy terms a double stopping rule for solving the SPP. The double stopping rule decides when to stop each phase of the hybrid based on different characteristics of the solution found. The results achieved with the double stopping rule for the hybrid method are compared with those existing in the literature. Keywords: GRASP, VNS, Metaheuristics, Fuzzy Stopping Rules, Strip Packing Problem 1 Introduction The Strip Packing Problem (SPP) consists of packing a finite set of the rectangles, that can be rotated 90 degrees, in the fixed width strip minimizing the height of the packing. Metaheuristic searches are general solution procedures for solving problems that must provide high quality solutions consuming moderate resource (time). A review of the application of metaheuristic algorithms to the SPP is found in [7]. Two metaheuristics with good performance are Greedy Randomized Adaptive Search Procedure (GRASP) [5] and Variable Neighborhood Search (VNS) [6]. In this work we consider a

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档