Online 2D irregular bin packing problem (2D-OIBPP) with uncertain demands is a critical challenge in the manufacturing and assembly industry, where a robot is required to place incoming objects within a limited time to maximize overall packing density. The high demands on real-time and...

This study addresses the electric vehicle routing problem with time windows and simultaneous pickup and deliveries in the context of sustainable city logistics. Time windows and simultaneous pickup and delivery constraints are two important real-life constraints to effectively organize freight...

Despite the various industrial applications integrating inbound transportation, production, and inventory, only single-product studies have been conducted addressing the related production and inventory routing problems simultaneously. To meet the optimization requirements of many-to-one...

The K-nearest neighbour (KNN) algorithm is one of the well-known classifiers applied in various research areas. The input requirement includes a set of variables, the choice of the neighbourhood size (K) and the distance metric which are usually selected based on data characteristics. The first...

The flexible job-shop scheduling problem (FJSP) is a typical mixed-integer linear programming problem, which plays an important role in operation research. A variable neighborhood search (VNS) enhance genetic algorithm (VNSeGA) is presented to minimize makespan of FJSP in this paper. In VNSeGA,...

With the continuous upgrading of industrial technology and information technology, consumers can deeply participate in the whole life cycle of products and realize customized production. These unprecedented changes have brought consumers and manufacturers closer together, resulting in the...

Heuristics for Vector Bin Packing (VBP) play an important role in modern distributed computing systems and other applications aimed at optimizing the usage of multidimensional resources. In this paper we perform a systematic classification of heuristics for VBP. We bring together existing VBP...

This paper proposes several algorithms for calculating fixed-length round trips on directed street networks. Unlike previous approaches, these algorithms do not need to download, process, or store large map databases; instead, the relevant information is collected using a small number of calls...

Over recent years, a fairly large number of project scheduling problems have been focused on maximizing the Net Present Value (NPV) of cash flows during the project. From the contractor's point of view, cash inflows generally represent their revenues, and cash outflows are expenditures. In most...