Narrow search
Showing 1 - 10 of 519
Cover Image
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, Thibaut; Crainic, Teodor Gabriel; Gendreau, Michel; … - In: European Journal of Operational Research 231 (2013) 1, pp. 1-21
, including a large variety of heuristics. This article first reviews the main classes of attributes, providing a survey of … heuristics and meta-heuristics for Multi-Attribute Vehicle Routing Problems (MAVRP). It then takes a closer look at the concepts … of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with …
Persistent link: https://www.econbiz.de/10011052458
Cover Image
IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
TATSUMI, KEIJI; TANINO, TETSUZO - In: International Journal of Information Technology & … 07 (2008) 01, pp. 53-70
The continuous-valued Hopfield neural network (CHN) is a popular and powerful metaheuristic method for combinatorial optimization. However, it is difficult to select appropriate penalty parameters for constraints so as to obtain a feasible and desirable solution by CHN. Thus, various improved...
Persistent link: https://www.econbiz.de/10005033344
Cover Image
A multiple-drawer medication layout problem in automated dispensing cabinets
Pazour, Jennifer; Meller, Russell - In: Health Care Management Science 15 (2012) 4, pp. 339-354
data to conduct a computational experiment to test the performance of our developed heuristics, to demonstrate how our …
Persistent link: https://www.econbiz.de/10010865055
Cover Image
A hierarchical facility layout planning approach for large and complex hospitals
Helber, Stefan; Böhme, Daniel; Oucherif, Farid; … - Wirtschaftswissenschaftliche Fakultät, Leibniz … - 2014
The transportation processes for patients, personnel, and material in large and complex maximum-care hospitals with many departments can consume significant resources and thus induce substantial logistics costs. These costs are largely determined by the allocation of the different departments...
Persistent link: https://www.econbiz.de/10010784202
Cover Image
On the unboundedness of facility layout problems
Drezner, Zvi - In: Computational Statistics 72 (2010) 2, pp. 205-216
Facility layout problems involve the location of facilities in a planar arrangement such that facilities that are strongly connected to one another are close to each other and facilities that are not connected may be far from one another. Pairs of facilities that have a negative connection...
Persistent link: https://www.econbiz.de/10010759579
Cover Image
On the unboundedness of facility layout problems
Drezner, Zvi - In: Mathematical Methods of Operations Research 72 (2010) 2, pp. 205-216
Facility layout problems involve the location of facilities in a planar arrangement such that facilities that are strongly connected to one another are close to each other and facilities that are not connected may be far from one another. Pairs of facilities that have a negative connection...
Persistent link: https://www.econbiz.de/10010950365
Cover Image
Modeling and Analysis of Congestion in the Design of Facility Layouts
Benjaafar, Saifallah - In: Management Science 48 (2002) 5, pp. 679-704
Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories are the cornerstones of popular manufacturing strategies such as Lean, Quick Response, and Just-in-Time Manufacturing. In this paper, we present a model that captures the relationshipbetween facility layout and...
Persistent link: https://www.econbiz.de/10009191873
Cover Image
Anytime Pareto local search
Dubois-Lacoste, Jérémie; López-Ibáñez, Manuel; … - In: European Journal of Operational Research 243 (2015) 2, pp. 369-385
Pareto Local Search (PLS) is a simple and effective local search method for tackling multi-objective combinatorial optimization problems. It is also a crucial component of many state-of-the-art algorithms for such problems. However, PLS may be not very effective when terminated before...
Persistent link: https://www.econbiz.de/10011209410
Cover Image
A new exact discrete linear reformulation of the quadratic assignment problem
Nyberg, Axel; Westerlund, Tapio - In: European Journal of Operational Research 220 (2012) 2, pp. 314-319
The quadratic assignment problem (QAP) is a challenging combinatorial problem. The problem is NP-hard and in addition, it is considered practically intractable to solve large QAP instances, to proven optimality, within reasonable time limits. In this paper we present an attractive mixed integer...
Persistent link: https://www.econbiz.de/10010597714
Cover Image
The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
Liggett, Robin Segerblom - In: Management Science 27 (1981) 4, pp. 442-458
Since procedures for producing optimal solutions to a quadratic assignment problem are computationally infeasible for any but small problems, heuristic techniques for producing approximate solutions must be employed for the solution of real practical problems. This paper presents the results of...
Persistent link: https://www.econbiz.de/10009204284