Results 161 to 170 of about 8,018,297 (258)

Efficient heuristics for the Steiner forest problem

International Transactions in Operational Research, EarlyView.
Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger, Isabel Rosseti, Simone Martins, Luidi Simonetti, Alexandre Plastino   +4 more
wiley   +1 more source

Balancing efficiency and robustness in project team formation: a hybrid evolutionary‐MCDM approach

International Transactions in Operational Research, EarlyView.
Abstract Effective team formation requires balancing technical skills, personality compatibility, and project constraints when selecting small teams from large candidate pools. Traditional multi‐criteria decision‐making (MCDM) methods provide rigorous evaluation but face scalability limitations.
Georgios Stavrou, Panagiotis Adamidis, Jason Papathanasiou   +2 more
wiley   +1 more source

Metaheuristics for The Solution of Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) With Travel Time Variable

JAREE (Journal on Advanced Research in Electrical Engineering), 2017
This research is focusing on the development of metaheuristic algorithm to solve Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) for the service provider of Inter-city Courier. The algorithm is divided into two stages which is static stage and
Nurlita Gamayanti
doaj  

A genetic algorithm for scheduling an automated machine cell with tool and pallet–fixture setups

International Transactions in Operational Research, EarlyView.
Abstract This paper solves the scheduling problem of identical parallel machines with tooling and pallet–fixture constraints in a high‐mix, low‐volume, high‐complexity manufacturing environment. The machines are connected through an automated material handling device and in‐between buffer places that allow for autonomous production.
Koen Herps, Quang‐Vinh Dang, Tugce Martagan, Ivo Adan   +3 more
wiley   +1 more source

Efficient exact formulations for the flexible job shop scheduling with flexible maintenance

International Transactions in Operational Research, EarlyView.
Abstract In modern manufacturing systems, integrating preventive maintenance into production scheduling is essential to ensure operational efficiency and equipment reliability. This paper addresses the flexible job shop scheduling problem under machine unavailability constraints caused by non‐fixed maintenance tasks.
Tom Perroux, Taha Arbaoui, Leila Merghem Boulahia, Khaled Hadj‐Hamou, Jean‐Dominique Regazzoni   +4 more
wiley   +1 more source

The one‐dimensional cutting stock problem with sequence‐dependent setups

International Transactions in Operational Research, EarlyView.
Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva, Antônio A. Chaves, Mauricio G. C. Resende, Silvio A. de Araujo   +3 more
wiley   +1 more source

Two‐dimensional guillotine cutting problem for large objects with non‐rectangular shapes

International Transactions in Operational Research, EarlyView.
Abstract In this paper, we address the two‐dimensional single large object placement problem with guillotine cutting constraints, focusing on non‐rectangular shapes. We consider objects with circular or convex polygonal geometries and study a variant that includes defective regions from which no items can be extracted. Rectangular items are cut using a
Carise E. Schmidt, Arinei C. L. Silva, Leandro C. Coelho, Maryam Darvish   +3 more
wiley   +1 more source

Heart rate optimizer: a novel bio-inspired metaheuristic algorithm. [PDF]

Sci Rep
Hosney ME, Emam MM, Saad MR, Samee NA, Houssein EH.   +4 more
europepmc   +1 more source

Optimizing cutting sequences through parallel tempering: the minimization of the open stacks problem

International Transactions in Operational Research, EarlyView.
Abstract This paper addresses the minimization of open stacks problem (MOSP), a pattern sequencing problem arising in cutting operations when the goal is to minimize the maximum number of simultaneously open stacks. We propose PT‐MOSP, a parallel tempering approach tailored to the MOSP.
Mauro Lúcio A. P. Santos Filho, Marco Antonio M. Carvalho   +1 more
wiley   +1 more source

Felis Catus Optimization (FCO): A novel nature‑inspired metaheuristic algorithm. [PDF]

PLoS One
Salehi M, Khayami R, Mirmozaffari M.
europepmc   +1 more source