GRASP with path-relinking: Recent advances and applications
MGC Resendel, CC Ribeiro - Metaheuristics: progress as real problem …, 2005 - Springer
Path-relinking is a major enhancement to the basic greedy randomized adaptive search
procedure (GRASP), leading to significant improvements in solution time and quality. Path …
procedure (GRASP), leading to significant improvements in solution time and quality. Path …
[图书][B] Optimization by GRASP
MGC Resende, CC Ribeiro - 2016 - Springer
Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
An annotated bibliography of GRASP–Part I: Algorithms
P Festa, MGC Resende - International Transactions in …, 2009 - Wiley Online Library
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
An annotated bibliography of GRASP–Part II: Applications
P Festa, MGC Resende - International Transactions in …, 2009 - Wiley Online Library
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion
We consider a hub-and-spoke network design problem with inter-hub economies-of-scale
and hub congestion. We explicitly model the economies-of-scale as a concave piece-wise …
and hub congestion. We explicitly model the economies-of-scale as a concave piece-wise …
Optimal fitness aware cloud service composition using modified invasive weed optimization
Abstract Quality of Service (QoS)-aware cloud service composition is one of the pivotal
problems in cloud computing. With the seamless proliferation of cloud services, it becomes …
problems in cloud computing. With the seamless proliferation of cloud services, it becomes …
Opposition-based learning for competitive hub location: a bi-objective biogeography-based optimization algorithm
AH Niknamfar, STA Niaki, SAA Niaki - Knowledge-Based Systems, 2017 - Elsevier
This paper introduces a new hub-and-center transportation network problem for a new
company competing against an operating company. The new company intends to locate p …
company competing against an operating company. The new company intends to locate p …
[HTML][HTML] Path relinking approach for multiple allocation hub maximal covering problem
B Qu, K Weng - Computers & Mathematics with Applications, 2009 - Elsevier
We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering
a serviced O–D flow was required to reach the destination optionally passing through one or …
a serviced O–D flow was required to reach the destination optionally passing through one or …
Location of urban logistic terminals as hub location problem
In this paper the problems of locating urban logistic terminals are studied as hub location
problems that due to a large number of potential nodes in big cities belong to hard non …
problems that due to a large number of potential nodes in big cities belong to hard non …
RAMP for the Capacitated Single Allocation p-Hub Location Problem
T Matos - International Conference on Hybrid Intelligent Systems, 2021 - Springer
This paper presents an effective Dual-RAMP algorithm for solving the Capacitated Single
Allocation p-Hub Location Problem (CSA p HLP). This problem aims to determine the set of …
Allocation p-Hub Location Problem (CSA p HLP). This problem aims to determine the set of …