scholarly journals Solving thep-Center problem with Tabu Search and Variable Neighborhood Search

Networks ◽  
2003 ◽  
Vol 42 (1) ◽  
pp. 48-64 ◽  
Author(s):  
Nenad Mladenović ◽  
Martine Labbé ◽  
Pierre Hansen
Keyword(s):  
Tabu Search ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Center Problem

Resolution Methods

2020 ◽  
pp. 29-60
Keyword(s):  
Linear Programming ◽  
Simulated Annealing ◽  
Tabu Search ◽  
Symmetry Breaking ◽  
Constraint Programming ◽  
Design Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Performance Profiles ◽  
Portfolio Design

The aim of this chapter is to introduce the different notions of the techniques used to solve the portfolio design problem. These techniques can be divided into two exact (or complete) methods and approached (or incomplete) methods. In the first part, the authors provide the exact approaches, namely linear programming and constraint programming, as well as the techniques of symmetry breaking, the modeling notions, and the different solving algorithms. The second part concerns approached methods, namely Simulated Annealing, IDWalk, Tabu Search, GWW, and Variable Neighborhood Search, including the techniques of studying the performance profiles of a method.

An approximation method for the P-median problem: A bioinspired tabu search and variable neighborhood search partitioning approach

2016 ◽  
Vol 13 (2) ◽  
pp. 87-98 ◽  
Author(s):  
María Beatríz Bernábe-Loranca ◽  
Jorge Ruíz-Vanoye ◽  
Rogelio González Velazquez ◽  
Martín Estrada Analco ◽  
Abraham Sánchez López ◽  
...  
Keyword(s):  
Tabu Search ◽  
Approximation Method ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Median Problem

An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem

2020 ◽  
Vol 11 (1) ◽  
pp. 23-35
Author(s):  
Sana Frifita ◽  
Ines Mathlouthi ◽  
Abdelaziz Dammak
Keyword(s):  
Tabu Search ◽  
Variable Neighborhood Search ◽  
Diversity Management ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Adaptive Memory ◽  
Weighted Distance ◽  
Routing And Scheduling ◽  
Electronic Transactions ◽  
Management Method

This article addresses a technician routing and scheduling problem inspired from an application for the repair of electronic transactions equipment. It consists of designing routes for staff to perform requests while considering certain constraints and resources. The objective is to minimize a linear combination of total weighted distance, overtime, and maximize the served requests. An efficient meta-heuristic algorithm based on variable neighborhood search with an adaptive memory and advanced diversity management method is proposed. Numerical results show that the meta-heuristic outperforms the best existing algorithm from the literature which is a Tabu Search.

General variable neighborhood search for the uncapacitated single allocation p-hub center problem

2016 ◽  
Vol 11 (2) ◽  
pp. 377-388 ◽  
Author(s):  
Jack Brimberg ◽  
Nenad Mladenović ◽  
Raca Todosijević ◽  
Dragan Urošević
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Center Problem ◽  
Single Allocation
Sign in / Sign up

Export Citation Format

Share Document