Narrow search
Showing 1 - 10 of 116
Cover Image
Long term production planning of open pit mines by ant colony optimization
Shishvan, Masoud Soleymani; Sattarvand, Javad - In: European Journal of Operational Research 240 (2015) 3, pp. 825-836
The problem of long-term production planning of open pit mines is a large combinatorial problem. Application of mathematical programming approaches suffer from reduced computational efficiency due to the large amount of decision variables. This paper presents a new metaheuristic approximation...
Persistent link: https://www.econbiz.de/10010939771
Cover Image
Decomposition based hybrid metaheuristics
Raidl, Günther R. - In: European Journal of Operational Research 244 (2015) 1, pp. 66-76
metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical … recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics. We review the basic … principles of these decomposition techniques and discuss for each promising possibilities for combinations with metaheuristics …
Persistent link: https://www.econbiz.de/10011209303
Cover Image
Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
Talarico, Luca; Sörensen, Kenneth; Springael, Johan - In: European Journal of Operational Research 244 (2015) 2, pp. 457-470
resulting metaheuristics are able to obtain solutions of excellent quality in very limited computing times. …
Persistent link: https://www.econbiz.de/10011209398
Cover Image
Effective learning hyper-heuristics for the course timetabling problem
Soria-Alcaraz, Jorge A.; Ochoa, Gabriela; Swan, Jerry; … - In: European Journal of Operational Research 238 (2014) 1, pp. 77-86
Course timetabling is an important and recurring administrative activity in most educational institutions. This article combines a general modeling methodology with effective learning hyper-heuristics to solve this problem. The proposed hyper-heuristics are based on an iterated local search...
Persistent link: https://www.econbiz.de/10010871281
Cover Image
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem
Rabello, Rômulo Louzada; Mauri, Geraldo Regis; … - In: European Journal of Operational Research 234 (2014) 3, pp. 802-808
The Point-Feature Cartographic Label Placement (PFCLP) problem consists of placing text labels to point features on a map avoiding overlaps to improve map visualization. This paper presents a Clustering Search (CS) metaheuristic as a new alternative to solve the PFCLP problem. Computational...
Persistent link: https://www.econbiz.de/10010738160
Cover Image
Integrated distribution and loading planning via a compact metaheuristic algorithm
Zachariadis, Emmanouil E.; Tarantilis, Christos D.; … - In: European Journal of Operational Research 228 (2013) 1, pp. 56-71
The present article examines a vehicle routing problem integrated with two-dimensional loading constraints, called 2L-CVRP. The problem is aimed at generating the optimal route set for satisfying customer demand. In addition, feasible loading arrangements have to be determined for the...
Persistent link: https://www.econbiz.de/10010662518
Cover Image
Formalizing and solving the problem of clustering in MCDA
Meyer, Patrick; Olteanu, Alexandru-Liviu - In: European Journal of Operational Research 227 (2013) 3, pp. 494-502
The topic of clustering has been widely studied in the field of Data Analysis, where it is defined as an unsupervised process of grouping objects together based on notions of similarity. Clustering in the field of Multi-Criteria Decision Aid (MCDA) has seen a few adaptations of methods from Data...
Persistent link: https://www.econbiz.de/10010617179
Cover Image
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Mladenović, Nenad; Kratica, Jozef; … - In: European Journal of Operational Research 220 (2012) 2, pp. 328-337
In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly resolving set with the minimum cardinality. Both are present in many diverse areas, including network discovery and verification, robot...
Persistent link: https://www.econbiz.de/10011052511
Cover Image
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
Mladenović, Nenad; Urošević, Dragan; Hanafi, Saı¨d; … - In: European Journal of Operational Research 220 (2012) 1, pp. 270-285
We present a variable neighborhood search approach for solving the one-commodity pickup-and-delivery travelling salesman problem. It is characterized by a set of customers such that each of the customers either supplies (pickup customers) or demands (delivery customers) a given amount of a...
Persistent link: https://www.econbiz.de/10011052534
Cover Image
Metaheuristics for the linear ordering problem with cumulative costs
Duarte, Abraham; Martí, Rafael; Álvarez, Ada; … - In: European Journal of Operational Research 216 (2012) 2, pp. 270-277
The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this...
Persistent link: https://www.econbiz.de/10011052629