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

Consolidating home meal delivery with limited operational disruption

Hewitt, Mike; Nowak, Maciek; Gala, Leo - In: European Journal of Operational Research 243 (2015) 1, pp. 281-291

Non-profit organizations like the Meals On Wheels (MOW) association of America prepare and deliver meals, typically daily, to approximately one million homebound individuals in the United States alone. However, many MOW agencies are facing a steadily increasing number of clients requesting meal...

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

Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic

de Oliveira, Lucas; Souza, Cid C. de; Yunes, Tallys - In: European Journal of Operational Research 236 (2014) 2, pp. 592-600

Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that...

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

A mathematical formulation and complexity considerations for the blocks relocation problem

Caserta, Marco; Schwarze, Silvia; Voß, Stefan - In: European Journal of Operational Research 219 (2012) 1, pp. 96-104

The blocks relocation problem (BRP) may be defined as follows: given a set of homogeneous blocks stored in a two-dimensional stock, which relocations are necessary to retrieve the blocks from the stock in a predefined order while minimizing the number of those relocations? In this paper, we...

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

A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem

Bozer, Yavuz A.; Wang, Chi-Tai - In: European Journal of Operational Research 218 (2012) 2, pp. 382-391

Owing to its theoretical as well as practical significance, the facility layout problem with unequal-area departments has been studied for several decades, with a wide range of heuristic and a few exact solution procedures developed by numerous researchers. In one of the exact procedures, the...

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

A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain

Singh, Gaurav; Sier, David; Ernst, Andreas T.; … - In: European Journal of Operational Research 220 (2012) 1, pp. 210-224

The Hunter Valley Coal Chain is the largest coal export operation in the world with a throughput in excess of 100 million tonnes per annum (Mtpa). Coal is delivered to the shipping terminal from 40 mines using 27 coal load points spread across the Hunter Valley region. This paper describes an...

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

Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges

Cerulli, R.; De Donato, R.; Raiconi, A. - In: European Journal of Operational Research 220 (2012) 1, pp. 58-66

Wireless sensor networks involve many different real-world contexts, such as monitoring and control tasks for traffic, surveillance, military and environmental applications, among others. Usually, these applications consider the use of a large number of low-cost sensing devices to monitor the...

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

A linear programming approach for linear programs with probabilistic constraints

Reich, Daniel - In: European Journal of Operational Research 230 (2013) 3, pp. 487-494

heuristics, we also prove that the theoretical worst-case solution quality for these algorithms is arbitrarily far from optimal …. Our computational study compares our heuristics against both the extended mixed-integer programming formulation and the … cutting plane method of Luedtke et al. (2010) [13]. Our heuristics efficiently and consistently produce solutions with small …

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

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