Narrow search
Showing 1 - 10 of 242
Cover Image
A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
GUERRIERO, FRANCESCA; BRUNI, MARIA ELENA; GRECO, FRANCESCA - In: Asia-Pacific Journal of Operational Research (APJOR) 30 (2013) 01, pp. 1250046-1
This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm...
Persistent link: https://www.econbiz.de/10011010825
Cover Image
A comprehensive approach to planning the deployment of transportation assets in distributing forest products
Zazgornik, Jan; Gronalt, Manfred; Hirsch, Patrick - In: International Journal of Revenue Management 6 (2012) 1/2, pp. 45-61
Four different modes for transporting wood in the first three stages of the wood supply chain are introduced and compared for real-life-based test cases under various scenarios. They include log-trucks and (foldable) containers. Freight forwarders are employed by sawmills to perform the...
Persistent link: https://www.econbiz.de/10010669591
Cover Image
NEW OPTIMIZATION MODELS FOR DATA MINING
GLOVER, FRED W.; KOCHENBERGER, GARY - In: International Journal of Information Technology & … 05 (2006) 04, pp. 605-609
In recent years modern methods of optimization have contributed greatly to the advances in data mining and related areas. These contributions continue today and promise to further advance the state of the art both in terms of modeling innovations and new solution methodologies. In this paper, we...
Persistent link: https://www.econbiz.de/10005060129
Cover Image
PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
DAVIDOVIĆ, TATJANA; HANSEN, PIERRE; MLADENOVIĆ, NENAD - In: Asia-Pacific Journal of Operational Research (APJOR) 22 (2005) 03, pp. 297-326
neighborhood search outperforms the other metaheuristics. In addition, a detailed performance analysis of both the proposed …
Persistent link: https://www.econbiz.de/10005047154
Cover Image
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Glover, Fred - In: European Journal of Operational Research 230 (2013) 2, pp. 212-225
algorithms with multi-start and strategic oscillation metaheuristics. Finally, we identify how surrogate constraints can be …
Persistent link: https://www.econbiz.de/10010679110
Cover Image
A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
Lamghari, Amina; Dimitrakopoulos, Roussos - In: European Journal of Operational Research 222 (2012) 3, pp. 642-652
This paper presents a metaheuristic solution approach based on Tabu search for the open-pit mine production scheduling problem with metal uncertainty. To search the feasible domain more extensively, two different diversification strategies are used to generate several initial solutions to be...
Persistent link: https://www.econbiz.de/10010597710
Cover Image
A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon
Melo, M.T.; Nickel, S.; Saldanha-da-Gama, F. - In: International Journal of Production Economics 136 (2012) 1, pp. 218-230
This paper addresses the problem of redesigning a supply chain network with multiple echelons and commodities. The problem belongs to a comprehensive class of network redesign problems previously introduced in the literature. Redesign decisions comprise the relocation of existing facilities to...
Persistent link: https://www.econbiz.de/10010572491
Cover Image
A tabu search for the permutation flow shop problem with sequence dependent setup times
Santos, Nicolau; Rebelo, Rui; Pedroso, João Pedro - In: International Journal of Data Analysis Techniques and … 6 (2014) 3, pp. 275-285
In this work we present a tabu search metaheuristic method for solving the permutation flow shop scheduling problem with sequence dependent setup times and the objective of minimising total weighted tardiness. The problem is well known for its practical applications and for the difficulty in...
Persistent link: https://www.econbiz.de/10010816808
Cover Image
Metaheuristic Algorithms Applied to Bioenergy Supply Chain Problems: Theory, Review, Challenges, and Future
Castillo-Villar, Krystel K. - In: Energies 7 (2014) 11, pp. 7640-7672
) frequently fail to find optimal solutions for non-convex and/or large-scale models whereas metaheuristics are efficient … by studying and analyzing the application of metaheuristics to solve bioenergy supply chain models as well as the … exclusive challenges of the mathematical problems applied in the bioenergy supply chain field. The reviewed metaheuristics …
Persistent link: https://www.econbiz.de/10011075176
Cover Image
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs
Glover, Fred; Ye, Tao; Punnen, Abraham P.; … - In: European Journal of Operational Research 241 (2015) 3, pp. 697-707
The bipartite boolean quadratic programming problem (BBQP) is a generalization of the well studied boolean quadratic programming problem. The model has a variety of real life applications; however, empirical studies of the model are not available in the literature, except in a few isolated...
Persistent link: https://www.econbiz.de/10011117475