Similar Search Results

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

Jahromi, Meghdad HMA; Tavakkoli-Moghaddam, Reza; Makui, … - In: Journal of Industrial Engineering International 8 (2012), pp. 1-8

-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and …

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

Probabilistic Transitivity in Sports

Tiwisina, Johannes; Külpmann, Philipp - 2014

teams a heuristic method for quickly finding a "good" solution. Finally we apply the described methods to panel data from …

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

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

Pourrahimian, Parinaz - In: Journal of Industrial Engineering International 14 (2018) 4, pp. 845-855

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and...

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

A novel heuristic algorithm for capacitated vehicle routing problem

Kır, Sena; Tüncel, Emre - In: Journal of Industrial Engineering International 13 (2017) 3, pp. 323-330

-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we … constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several …

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

Metaheuristic algorithm for ship routing and scheduling problems with time window

Alhamad, Khaled; Alrashidi, Azizah; Alkharashi, Sameh - In: Cogent Business & Management 6 (2019), pp. 1-16

This paper describes a Tabu Search (TS) heuristic for a Ship Routing and Scheduling Problem (SRSP). The method was …

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

Robust quadratic assignment problem with budgeted uncertain flows

Feizollahi, Mohammad Javad; Feyzollahi, Hadi - In: Operations Research Perspectives 2 (2015), pp. 114-123

We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact...

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

Tabu search and memetic algorithms for a real scheduling and routing problem

El-Yaakoubi, Anass; El-Fallahi, Abdellah; Cherkaoui, … - In: Logistics Research 10 (2017) 7, pp. 1-18

operations. The problem is modeled as a mixed integer linear program. Three meta-heuristic algorithms based on tabu search …

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

Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets

Kimms, Alf - 1994

This contribution presents two heuristic approaches for multi-level, single-machine lot sizing and scheduling. The … first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method … shows that these two methods are complementary, i.e. the randomized regret based heuristic performs good in those cases in …

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

A petrol station replenishment problem: new variant and formulation

Benantar, Abdelaziz; Ouafi, Rachid; Boukachour, Jaouad - In: Logistics Research 9 (2016) 1, pp. 1-18

One of the most important problems in the petroleum industry is the well-known petrol station replenishment problem with time windows, which calls for the determination of optimal routes by using a fleet of tank trucks to serve a set of petrol stations over a given planning horizon. In this...

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

An advanced tabu search approach to the dynamic airlift loading problem

Roesener, August G.; Barnes, J. Wesley - In: Logistics Research 9 (2016) 1, pp. 1-18

This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift...

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