Results 241 to 250 of about 363,713 (312)

Exact solution algorithms for biobjective mixed integer programming problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley   +1 more source

Bridging the implementation gap in MCABC inventory management: from a taxonomy to practical archetypes

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Despite increasing demands for resilient and sustainable supply chains, inventory management often relies on outdated single‐criterion analyses. While multi‐criteria ABC (MCABC) analyses provide a theoretically mature assessment of resilience‐sustainability‐benefit trade‐offs in inventory, their adoption remains limited due to fragmented ...
Lukas Grützner, Michael H. Breitner
wiley   +1 more source

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri   +3 more
wiley   +1 more source

An iterated greedy‐based metaheuristic with local search for the rank pricing problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy