Similar Search Results

Minimising the number of gap-zeros in binary matrices

Chakhlevitch, Konstantin; Glass, Celia A.; Shakhlevich, … - In: European Journal of Operational Research 229 (2013) 1, pp. 48-58

linear-time in the number of rows if the number of columns is constant, and two constructive heuristics to tackle instances … with an arbitrary number of columns. The heuristics use a novel solution representation based upon row sequencing. In our … computational study, all heuristic solutions are either optimal or close to an optimum. One of the heuristics is particularly …

Persistent link: https://www.econbiz.de/10010664718

Instance-specific multi-objective parameter tuning based on fuzzy logic

Ries, Jana; Beullens, Patrick; Salt, David - In: European Journal of Operational Research 218 (2012) 2, pp. 305-315

Finding good parameter values for meta-heuristics is known as the parameter setting problem. A new parameter tuning …

Persistent link: https://www.econbiz.de/10010577574

An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem

Messelis, Tommy; De Causmaecker, Patrick - In: European Journal of Operational Research 233 (2014) 3, pp. 511-528

This paper investigates the construction of an automatic algorithm selection tool for the multi-mode resource-constrained project scheduling problem (MRCPSP). The research described relies on the notion of empirical hardness models. These models map problem instance features onto the performance...

Persistent link: https://www.econbiz.de/10010719585

On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem

Hoos, Holger H.; Stützle, Thomas - In: European Journal of Operational Research 238 (2014) 1, pp. 87-94

The travelling salesman problem (TSP) is one of the most prominent NP-hard combinatorial optimisation problems. After over fifty years of intense study, the TSP continues to be of broad theoretical and practical interest. Using a novel approach to empirical scaling analysis, which in principle...

Persistent link: https://www.econbiz.de/10011052604

Optimisation of gravity-fed water distribution network design: A critical review

De Corte, Annelies; Sörensen, Kenneth - In: European Journal of Operational Research 228 (2013) 1, pp. 1-10

30years, a large number of methods, especially in the field of (meta) heuristics, have been developed to solve this …

Persistent link: https://www.econbiz.de/10011052625

The linear ordering problem revisited

Ceberio, Josu; Mendiburu, Alexander; Lozano, Jose A. - In: European Journal of Operational Research 241 (2015) 3, pp. 686-696

The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an...

Persistent link: https://www.econbiz.de/10011117488

Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling

Li, Jingpeng; Bai, Ruibin; Shen, Yindong; Qu, Rong - In: European Journal of Operational Research 242 (2015) 3, pp. 798-806

This paper presents a state transition based formal framework for a new search method, called Evolutionary Ruin and Stochastic Recreate, which tries to learn and adapt to the changing environments during the search process. It improves the performance of the original Ruin and Recreate principle...

Persistent link: https://www.econbiz.de/10011190747

Tabu search heuristics for the order batching problem in manual order picking systems

Henn, Sebastian; Wäscher, Gerhard - In: European Journal of Operational Research 222 (2012) 3, pp. 484-494

In a manual order picking system, order pickers walk or ride through a distribution warehouse in order to collect items requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders be combined into (more substantial)...

Persistent link: https://www.econbiz.de/10011052554

Solving the container relocation problem by an improved greedy look-ahead heuristic

Jin, Bo; Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 240 (2015) 3, pp. 837-847

The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a...

Persistent link: https://www.econbiz.de/10010939782

On service consistency in multi-period vehicle routing

Luo, Zhixing; Qin, Hu; Che, ChanHou; Lim, Andrew - In: European Journal of Operational Research 243 (2015) 3, pp. 731-744

In this paper, we investigate a new variant of the vehicle routing problem (VRP), termed the multi-period vehicle routing problem with time windows and limited visiting quota (MVRPTW-LVQ), which requires that any customer can be served by at most a certain number of different vehicles over the...

Persistent link: https://www.econbiz.de/10011209299