LAUSR

Variable neighborhood search approach with intensified shake for monitor placement

Sign Up to like & get
recommendations!
1 Published in 2022 at "Networks"

DOI: 10.1002/net.22134

Abstract: Several problems are emerging in the context of communication networks and most of them must be solved in reduced computing time since they affect to critical tasks. In this research, the monitor placement problem is… read more here.

Keywords: variable neighborhood; monitor placement; neighborhood search; search ... See more keywords

An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem

Sign Up to like & get
recommendations!
0 Published in 2017 at "Soft Computing"

DOI: 10.1007/s00500-016-2225-8

Abstract: A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement.… read more here.

Keywords: algorithm; search; course timetabling; variable neighborhood ... See more keywords

Outer Wall Segmentation of Abdominal Aortic Aneurysm by Variable Neighborhood Search Through Intensity and Gradient Spaces

Sign Up to like & get
recommendations!
0 Published in 2018 at "Journal of Digital Imaging"

DOI: 10.1007/s10278-018-0049-z

Abstract: Aortic aneurysm segmentation remains a challenge. Manual segmentation is a time-consuming process which is not practical for routine use. To address this limitation, several automated segmentation techniques for aortic aneurysm have been developed, such as… read more here.

Keywords: segmentation; aortic aneurysm; intensity; gradient ... See more keywords

Solving the capacitated clustering problem with variable neighborhood search

Sign Up to like & get
recommendations!
0 Published in 2019 at "Annals of Operations Research"

DOI: 10.1007/s10479-017-2601-5

Abstract: Variable neighborhood search (VNS) is a proven heuristic framework for finding good solutions to combinatorial and global optimization problems. In this paper two VNS-based heuristics are proposed for solving the capacitated clustering problem. The first… read more here.

Keywords: capacitated clustering; clustering problem; solving capacitated; variable neighborhood ... See more keywords

A general variable neighborhood search for the cyclic antibandwidth problem

Sign Up to like & get
recommendations!
2 Published in 2022 at "Computational Optimization and Applications"

DOI: 10.1007/s10589-021-00334-y

Abstract: Graph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function.… read more here.

Keywords: cyclic antibandwidth; neighborhood; antibandwidth problem; general variable ... See more keywords

GRASP with Variable Neighborhood Descent for the online order batching problem

Sign Up to like & get
recommendations!
1 Published in 2020 at "Journal of Global Optimization"

DOI: 10.1007/s10898-020-00910-2

Abstract: The Online Order Batching Problem (OOBP) is a variant of the well-known Order Batching Problem (OBP). As in the OBP, the goal of this problem is to collect all the orders that arrive at a… read more here.

Keywords: batching problem; order; online order; variable neighborhood ... See more keywords

A general variable neighborhood search for solving the uncapacitated $$r$$r-allocation $$p$$p-hub median problem

Sign Up to like & get
recommendations!
1 Published in 2017 at "Optimization Letters"

DOI: 10.1007/s11590-015-0867-6

Abstract: The $$p$$p-hub median problem consists of choosing $$p$$p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs at minimum cost. We accept general… read more here.

Keywords: hub; variable neighborhood; problem; neighborhood search ... See more keywords

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

Sign Up to like & get
recommendations!
0 Published in 2017 at "Optimization Letters"

DOI: 10.1007/s11590-016-1004-x

Abstract: In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). For the local search step we develop a nested variable neighborhood descent strategy. The… read more here.

Keywords: neighborhood; variable neighborhood; general variable; uncapacitated single ... See more keywords

Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem

Sign Up to like & get
recommendations!
0 Published in 2020 at "Optimization Letters"

DOI: 10.1007/s11590-020-01551-w

Abstract: In this paper, we consider a Rich k-travelling repairmen problem (R-k-TRP), motivated by an application for the maintenance and repair of electronic transaction equipment. It consists of designing routes of polyvalent repairmen to perform customers… read more here.

Keywords: travelling repairmen; rich travelling; variable neighborhood; problem ... See more keywords

Preface to the special issue on variable neighborhood search

Sign Up to like & get
recommendations!
3 Published in 2022 at "Optimization Letters"

DOI: 10.1007/s11590-021-01817-x

Abstract: This special issue of Optimization Letters presents selected, peer-reviewed, papers that were accepted for presentation in the two recent International Conferences on Variable Neighborhood Search. The “ICVNS 2018” was held in Sithonia, Halkidiki, Greece, during… read more here.

Keywords: special issue; preface special; neighborhood search; variable neighborhood ... See more keywords

A variable neighborhood search heuristic for supply chain coordination using dynamic price discounts

Sign Up to like & get
recommendations!
0 Published in 2018 at "EURO Journal on Transportation and Logistics"

DOI: 10.1007/s13676-018-0122-2

Abstract: This research studies the problem of supply chain coordination using temporary price discounts. The supplier decides how much discount should be introduced in each period to each of the customers, aiming to maximize its profit,… read more here.

Keywords: variable neighborhood; chain coordination; coordination using; supply chain ... See more keywords