Results 81 to 90 of about 1,705 (196)
Models and Matheuristics for Large-Scale Combinatorial Optimization Problems [PDF]
Combinatorial optimization deals with efficiently determining an optimal (or at least a good) decision among a finite set of alternatives. In business administration, such combinatorial optimization problems arise in, e.g., portfolio selection, project ...
Gnägi, Mario
core +1 more source
Networks, Volume 87, Issue 1, Page 62-82, January 2026.ABSTRACT We introduce the nested p$$ p $$‐center problem, a multi‐period variant of the well‐known p$$ p $$‐center problem. Using the nesting concept allows us to obtain solutions consistent over the considered time horizon, that is, facilities that are opened in a given time period stay open for subsequent periods.
Christof Brandstetter, Markus Sinnl
wiley +1 more source
Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem
IEEE AccessThis paper addresses the Two-Stage Capacitated Facility Location Problem (TSCFLP), a challenging optimization problem with significant applications in supply chain network design.
Denis Alicic +3 more
doaj +1 more source
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.The paper introduces a reinforcement learning‐based hyper‐heuristic framework to solve both capacitated and uncapacitated Hub Location Problems (HLP) in dynamic supply chain environments. The method adaptively selects heuristics based on feedback, enabling scalable and flexible decision‐making under changing demands and costs.
Kassem Danach +3 more
wiley +1 more source
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.This article provides a comprehensive review of studies on the 3L‐CVRP (capacitated vehicle routing problem with three‐dimensional loading constraints) published from 2006 to 2026. It systematically classifies problem variants, modelling frameworks, and solution approaches, while also summarising benchmark instances.
Jushang Chi, Rui Song, Shiwei He
wiley +1 more source
Matheuristics for the periodic vehicle routing problem with time windows
, 2010 We investigate two matheuristic strategies using the periodic vehicle routing problem with time windows as a testbed. Two di erent metaheuristics are suitably combined with parts of a developed column generation approach: On the one hand a variable ...
Pirkwieser, Sandro, Raidl, Günther
core
A Parallel Application of Matheuristics in Data Envelopment Analysis [PDF]
, 2019 Data Envelopment Analysis (DEA) is a non-parametric methodology for estimating technical efficiency and benchmarking. In general, it is desirable that DEA generates the efficient closest targets as benchmarks for each assessed unit. This may be achieved through the application of the Principle of Least Action.
Martín González +3 more
openaire +2 more sources
Assigning airport ground handling operations: a data‐driven matheuristic
International Transactions in Operational Research, Volume 33, Issue 1, Page 359-383, January 2026.Abstract In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi‐trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns.
Alexandre Dupaquis +5 more
wiley +1 more source
International Transactions in Operational Research, Volume 33, Issue 1, Page 457-488, January 2026.Abstract For many retailers with an existing consumer base, direct marketing, particularly, one‐to‐one marketing actions, is crucial. However, to decide which consumer should receive which kind of advertising at which point in time is challenging, particularly if the individual consumer's demand is history dependent, that is, influenced by his/her ...
Oliver Nordemann, Rainer Schlosser
wiley +1 more source
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
Computers & Operations Research, 2019 Effective Mixed Integer Programming (MIP) based matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (CLSP-RM) are proposed in this paper.
J. O. Cunha +2 more
semanticscholar +1 more source