Results 41 to 50 of about 1,992 (151)

Straddle carrier routing optimization at container terminals utilizing telemetry‐based prediction

International Transactions in Operational Research, EarlyView.
Abstract Efficient vehicle routing and scheduling for horizontal transport means on container terminals can reduce lead times and travel distances, resulting in fuel savings and productivity gains. We apply machine learning to emulate operational processes, bridging the gap between theoretical optimization models and real‐world practices at container ...
Julian Neugebauer, Ahmet Cürebal, Leonard Heilig, Stefan Voß   +3 more
wiley   +1 more source

Assessing second‐price auctions for parcel exchanges in last‐mile logistics

International Transactions in Operational Research, EarlyView.
Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley   +1 more source

A new Hyphessobrycon (Characiformes: Acestrorhamphidae) of the Hyphessobrycon agulha lineage of Hyphessobryconinae from the lower Aripuanã basin, Brazil, with comments about the lineage

Journal of Fish Biology, EarlyView.
Abstract A new species of Hyphessobrycon is described from a tributary of Rio Jatuarana, lower Rio Aripuanã basin, Rio Madeira basin, Apuí, Amazonas. The new species is part of the Hyphessobrycon agulha lineage, with the typical midlateral narrow black stripe immediately followed dorsally by an iridescent stripe.
Tiago C. Faria, Willian M. Ohara, Iann Leonardo Pinheiro Monteiro, Claudio Oliveira   +3 more
wiley   +1 more source

A genetic algorithm simheuristic for solving the stochastic project portfolio selection problem with portfolio reliability constraints

International Transactions in Operational Research, Volume 33, Issue 6, Page 4039-4071, November 2026.
Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz, David Lopez‐Lopez, Laura Calvet, Angel A. Juan   +3 more
wiley   +1 more source

MILP models of a patient transportation problem

Central European Journal of Operations Research
AbstractWith ageing societies and increasing number of patients, there is a growing need for quality services that help transporting non-urgent patients to hospitals. In logistics, patient transportation problems are usually modeled as a dial-a-ride problem.
Martin Tóth, Tamás Hajba, Adrián Horváth   +2 more
openaire   +1 more source

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

Scheduling optimization of optical lens polishing

International Transactions in Operational Research, Volume 33, Issue 6, Page 3744-3768, November 2026.
Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley   +1 more source

To MILP or not to MILP? On AI techniques for the design and optimization of real-time systems

Real-Time Systems
Abstract Artificial intelligence (AI) is becoming increasingly relevant in many contexts. In embedded real-time systems, most of the previous research has focused on real-time guarantees for AI workloads (RT-for-AI). Instead, this position paper discusses the potential benefits and application cases of the complementary direction of using AI ...
openaire   +2 more sources

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete   +3 more
wiley   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

International Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source