Greedy randomized Adaptive search procedure

Part 1 of ebook "Search methodologies: Introductory tutorials in optimization and decision support techniques" provides readers with contents including: classical techniques; integer programming; genetic algorithms; scatter search; genetic programming; artificial immune systems; swarm intelligence; tabu search; simulated annealing; GRASP: greedy randomized adaptive search procedures; variable neighborhood search;...

344p thamnhuocgiai 24-09-2023 6 4   Download

The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the q-stripe TSP with q ≥ 1, the objective function sums the costs for traveling from one vertex to each of the next q vertices along the tour. To solve medium to large-sized instances, a metaheuristic approach is proposed. The proposed method has two main components, which are construction and improvement phases. The construction phase generates an initial solution using the Greedy Randomized Adaptive Search Procedure (GRASP).

18p nguathienthan9 08-12-2020 13 2   Download

This paper addresses the stochastic permutation flow shop problem (SPFSP) in which the stochastic parameters are the processing times. This allows the modeling of setups and machine breakdowns.

24p kelseynguyen 27-05-2020 11 1   Download

This work studies the scheduling of elective procedures, with stochastic durations, in surgery rooms. Given a set of rooms with limited availability and a set of procedures, it must be decided in which room and when each procedure will be performed. The problem’s objectives are to maximize the use of the operating rooms and to minimize the delays in starting the scheduled surgeries.

14p toritori 11-05-2020 15 1   Download

This study proposes a hybrid heuristic method based on the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic and the Clarke and Wright Savings algorithm, to solve a VRPLC with several loading and routing constraints that have not been considered simultaneously before. Experimental results show that the proposed procedure produces competitive solutions in short processing times. Lastly, the impact of the added operational constraints is also analyzed.

26p toritori 11-05-2020 14 1   Download

In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and is built by taking into account the rules that shape its construction, such as number of customers, number of components and types of links, in order to meet operational needs and technical constraints.

26p danhnguyentuongvi27 19-12-2018 11 0   Download

In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase.

17p thuyliebe 05-10-2018 46 2   Download