Search results for "Variable neighborhood search"

showing 2 items of 12 documents

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

2011

Abstract: The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.

Traveling purchaser problemWaiting timeMathematical optimizationEconomicsTraveling repairman problemGRASPManagement Science and Operations ResearchTheoretical Computer ScienceManagement Information SystemsTravel timeComputational Theory and MathematicsRouting (electronic design automation)MetaheuristicVariable neighborhood searchMathematics4OR
researchProduct

Max–min dispersion with capacity and cost for a practical location problem

2022

Diversity and dispersion problems deal with selecting a subset of elements from a given set in such a way that their diversity is maximized. This study considers a practical location problem recently proposed in the context of max–min dispersion models. It is called the generalized dispersion problem, and it models realistic applications by introducing capacity and cost constraints. We propose two effective linear formulations for this problem, and develop a hybrid metaheuristic algorithm based on the variable neighborhood search methodology, to solve real instances. Extensive numerical computational experiments are performed to compare our hybrid metaheuristic with the state-of-art heurist…

metaheuristicsArtificial IntelligenceGeneral Engineeringcombinatorial optimizationdispersionUNESCO::CIENCIAS TECNOLÓGICASdiversity maximizationvariable neighborhood searchComputer Science Applications
researchProduct