Research on multi-objective emergency resource scheduling optimization in chemical industrial parks. [PDF]
Wang Y, Zhang M, Lu J, Gui Y.
europepmc +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
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
Large-area OLED substrate printing path planning method based on multi-head GAT imitation learning to solve partitioned integer programming. [PDF]
Xiong J +5 more
europepmc +1 more source
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
A mixed-integer linear programming method for time-dependent line planning in passenger railway systems. [PDF]
Shi X, Zhou W, Li X.
europepmc +1 more source
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
Research on the optimization of cold chain logistics distribution routes considering time-dependent networks and simultaneous pick-up and delivery from the perspective of sustainability. [PDF]
Liu Y, Hou J, Cai C.
europepmc +1 more source
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
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
Corrigendum to "Design and analysis of UPQC in a microgrid using model reference adaptive control ensemble with back-stepping controller" [Heliyon Volume 10, Issue 14, July 2024, Article e34140]. [PDF]
Das SK +8 more
europepmc +1 more source
Integer programming as a powerful tool for polyclonal selection in ancient grapevine varieties. [PDF]
Surgy S, Cadima J, Gonçalves E.
europepmc +1 more source

