scholarly journals A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps

2013 ◽  
Vol 40 (5) ◽  
pp. 1435-1447 ◽  
Author(s):  
Rafael G. Cano ◽  
Guilherme Kunigami ◽  
Cid C. de Souza ◽  
Pedro J. de Rezende
Keyword(s):  
OR Spectrum ◽  
2013 ◽  
Vol 36 (3) ◽  
pp. 693-722 ◽  
Author(s):  
Matthias Gerhard Wichmann ◽  
Thomas Volling ◽  
Thomas Stefan Spengler
Keyword(s):  

2003 ◽  
Vol 02 (04) ◽  
pp. 597-617 ◽  
Author(s):  
BERNARD T. HAN ◽  
V. T. RAJA

Local Access Networks (LACNs) are often considered the "last mile" over the Internet provided that they are connected to some existing Wide Area Network backbone. In this paper, a revised LACN-WAN interconnection model is presented as an extension to the conventional Capacitated Concentrator Location Problem (CCLP). An efficient heuristic is also developed to seek near-optimal deployment of telecommunication devices (e.g. links, concentrators, etc.) while minimizing the total connection costs for the network interconnection. Our solution algorithm could serve as a decision-making tool in solving problems with a real world size (i.e. 120 nodes and 30 concentrators).


2011 ◽  
Vol 13 (3) ◽  
pp. 31-40
Author(s):  
Tiago de Azevedo Santos ◽  
Dalessandro Soares Vianna ◽  
Marcilene de Fátima Dianin Vianna

2015 ◽  
Vol 86 (5) ◽  
pp. 537-573 ◽  
Author(s):  
Karen Puttkammer ◽  
Matthias G. Wichmann ◽  
Thomas S. Spengler

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Yang Wang ◽  
Snezana Mitrovic Minic ◽  
Robert Leitch ◽  
Abraham P. Punnen

This paper investigates an image acquisition scheduling problem for a Canadian surveillance-of-space satellite named Sapphire that takes images of deep space Earth-orbiting objects. For a set of resident space objects (RSOs) that needs to be imaged within the time horizon of one day, the Sapphire image acquisition scheduling (SIAS) problem is to find a schedule that maximizes the “Figure of Merit” of all the scheduled RSO images. To address the problem, we propose an effective GRASP heuristic that alternates between a randomized greedy constructive procedure and a local search procedure. Experimental comparisons with the currently used greedy algorithm are presented to demonstrate the merit of the proposed algorithm in handling the SIAS problem.


Top ◽  
2010 ◽  
Vol 20 (3) ◽  
pp. 679-706 ◽  
Author(s):  
Juan A. Díaz ◽  
Dolores Luna ◽  
Ricardo Luna

2008 ◽  
Vol 15 (4) ◽  
pp. 387-416 ◽  
Author(s):  
Luis F. Santos ◽  
Simone L. Martins ◽  
Alexandre Plastino
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document