A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems

Swarm and Evolutionary Computation, Год журнала: 2021, Номер 64, С. 100888 - 100888

Опубликована: Апрель 28, 2021

Язык: Английский

---

A generic exact solver for vehicle routing and related problems

Mathematical Programming, Год журнала: 2020, Номер 183(1-2), С. 483 - 523

Опубликована: Июнь 25, 2020

Язык: Английский

---

Online 3D Bin Packing with Constrained Deep Reinforcement Learning

Proceedings of the AAAI Conference on Artificial Intelligence, Год журнала: 2021, Номер 35(1), С. 741 - 749

Опубликована: Май 18, 2021

We solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP). In our problem, the agent has limited information about items to be packed into single bin, and an item must immediately after its arrival without buffering or readjusting. The item's placement also subjects constraints order dependence physical stability. formulate this online 3D-BPP as constrained Markov decision process (CMDP). To we propose effective easy-to-implement deep reinforcement learning (DRL) method under actor-critic framework. particular, introduce prediction-and-projection scheme: first predicts feasibility mask for actions auxiliary task then uses modulate action probabilities output by actor during training. Such supervision projection facilitate learn feasible policies very efficiently. Our can easily extended handle lookahead items, multi-bin packing, re-orienting. have conducted extensive evaluation showing that learned policy significantly outperforms state-of-the-art methods. A preliminary user study even suggests might attain human-level performance.

Язык: Английский

---

A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem

Information Sciences, Год журнала: 2018, Номер 478, С. 40 - 61

Опубликована: Ноя. 8, 2018

Язык: Английский

---

Exact solution techniques for two-dimensional cutting and packing

European Journal of Operational Research, Год журнала: 2020, Номер 289(2), С. 399 - 415

Опубликована: Июль 4, 2020

Язык: Английский

---

Modelling and optimisation in European Kidney Exchange Programmes

European Journal of Operational Research, Год журнала: 2019, Номер 291(2), С. 447 - 456

Опубликована: Сен. 7, 2019

We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) its many-to-one generalisation, Hospitals / Residents (HRT). These can be used to efficiently solve these when applied (i) derived from real-world applications, (ii) larger that are randomly-generated. In case SMTI, we consider arising pairing children adoptive families, where preferences obtained a quality measure each possible child family. this seek maximum weight stable matching. algorithms preprocessing SMTI ties on both sides, as well ILP models. Algorithms based existing state-of-the-art only 6 our 22 within an hour per instance, all mean runtime 60 seconds. For HRT, assigning junior doctors foundation posts Scottish hospitals. Here size show how extend HRT case. real instances, reduce average 144 seconds using methods, 3 ILP-based algorithms. also outperform considerably randomly-generated HRT.

Язык: Английский

---

Cost-Effective App User Allocation in an Edge Computing Environment

IEEE Transactions on Cloud Computing, Год журнала: 2020, Номер 10(3), С. 1701 - 1713

Опубликована: Июнь 11, 2020

Edge computing is a new distributed paradigm extending the cloud paradigm, offering much lower end-to-end latency, as real-time, latency-sensitive applications can now be deployed on edge servers that are closer to end-users than distant servers. In computing, user allocation (EUA) critical problem for any app vendors, who need determine which will serve users. This satisfy application-specific optimization objectives, e.g., maximizing users’ overall quality of experience, minimizing system costs, and so on. this article, we focus cost-effectiveness solutions with two objectives. The primary one maximize number users allocated secondary minimize required servers, subsequently reduces operating costs vendors. We first model bin packing introduce an approach finding optimal solutions. However, $\mathcal {NP}$ -hard EUA in large-scale scenarios intractable. Thus, propose heuristic efficiently find sub-optimal problems. Extensive experiments conducted real-world data demonstrate our solve effectively efficiently, outperforming state-of-the-art baseline approaches.

Язык: Английский

---

Knapsack problems — An overview of recent advances. Part I: Single knapsack problems

Computers & Operations Research, Год журнала: 2022, Номер 143, С. 105692 - 105692

Опубликована: Фев. 7, 2022

Язык: Английский

---

Sustainable and cost-effective optimal design of steel structures by minimizing cutting trim losses

Automation in Construction, Год журнала: 2024, Номер 167, С. 105724 - 105724

Опубликована: Авг. 27, 2024

Язык: Английский

---

Mathematical models and exact algorithms for the Colored Bin Packing Problem

Computers & Operations Research, Год журнала: 2024, Номер 164, С. 106527 - 106527

Опубликована: Янв. 2, 2024

Язык: Английский

---