0000000000594202

AUTHOR

J. Manuel Colmenar

showing 2 related works from this author

Iterated greedy with variable neighborhood search for a multiobjective waste collection problem

2020

Abstract In the last few years, the application of decision making to logistic problems has become crucial for public and private organizations. Efficient decisions clearly contribute to improve operational aspects such as cost reduction or service improvement. The particular case of waste collection service considered in this paper involves a set of economic, labor and environmental issues that translate into difficult operational problems. They pose a challenge to nowadays optimization technologies since they have multiple constraints and multiple objectives that may be in conflict. We therefore need to resort to multiobjective approaches to model and solve this problem, providing efficie…

0209 industrial biotechnologyService (systems architecture)Mathematical optimizationComputer sciencemedia_common.quotation_subjectGeneral EngineeringWaste collection02 engineering and technologyMulti-objective optimizationComputer Science ApplicationsSet (abstract data type)020901 industrial engineering & automationArtificial Intelligence0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingIterated greedyFunction (engineering)Variable neighborhood searchmedia_commonExpert Systems with Applications
researchProduct

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem

2016

Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…

Mathematical optimization021103 operations researchInformation Systems and ManagementOptimization problemGeneral Computer ScienceHeuristic (computer science)business.industryGRASP0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringTabu searchModeling and Simulation0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingLocal search (optimization)businessBranch and cutAlgorithmMetaheuristicGreedy randomized adaptive search procedureMathematicsEuropean Journal of Operational Research
researchProduct