Similar Search Results

Heuristic Concentration and Tabu Search: A Nose to Nose Comparison

Rosing, K.E.; ReVelle, C.S. - Tinbergen Institute - 1997

In 1997 two papers applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) to the p-median problem were published in consecutive volumes of the European Journal of Operational Research. Here we apply the method of HC some of the data sets which were used for computational...

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

Multiple machine continuous setup lotsizing with sequence-dependent setups

Almada-Lobo, Bernardo; Klabjan, Diego; Carravilla, Maria; … - In: Computational Optimization and Applications 47 (2010) 3, pp. 529-552

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

Maximizing the effectiveness of a pediatric vaccine formulary while prohibiting extraimmunization

Hall, Shane; Sewell, Edward; Jacobson, Sheldon - In: Health Care Management Science 11 (2008) 4, pp. 339-352

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

Heuristic Concentration and Tabu Search: A Nose to Nose Comparison

Rosing, K.E.; ReVelle, C.S. - Tinbergen Instituut - 1997

In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

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

TWO-PHASE HEURISTIC FOR CAPACITATED DEGREE CONSTRAINED MIN-SUM ARBORESCENCE

Kawatra, Rakesh - International Institute of Social and Economic Sciences - 2014

We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)

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

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

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

Prescribing Tactical Response for Oil Spill Clean Up Operations

Wilhelm, W. E.; Srinivasa, A. V. - In: Management Science 43 (1997) 3, pp. 386-402

the TDP as a general integer program. We devise a method based on graph theory to efficiently generate response system … decision variables to facilitate solution. We then develop two heuristics to obtain approximate solutions to the TDP. The first … heuristic is an LP-based method, while the second uses a combination of LP relaxation and branch and bound. The two heuristics …

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

Adaptive Memory Tabu Search for Binary Quadratic Programs

Glover, Fred; Kochenberger, Gary A.; Alidaee, Bahram - In: Management Science 44 (1998) 3, pp. 336-345

Recent studies have demonstrated the effectiveness of applying adaptive memory tabu search procedures to combinatorial optimization problems. In this paper we describe the development and use of such an approach to solve binary quadratic programs. Computational experience is reported, showing...

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