We review the most important mathematical models and algorithms developed for the exact
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …

Grouping problems are combinatorial optimization problems, most of them NP-hard, related
to the partition of a set of items into different groups or clusters. Given their numerous real …

Vehicle routing problem with time windows (VRPTW) is a pivotal problem in logistics domain
as it possesses multiobjective characteristics in real-world applications. Literature contains a …

In this study, the one-dimensional Bin Packing Problem (BPP) is approached. The BPP is a
classical optimization problem that is known for its applicability and complexity. We propose …

The multiple traveling salesperson problem (MTSP) is an extension of the well known
traveling salesperson problem (TSP). Given m> 1 salespersons and n> m cities to visit, the …

In this paper, we consider the multiple traveling salesman problem (MTSP) with the minmax
objective, which includes more than one salesman to serve a set of cities while minimizing …

This paper addresses a variant of the vehicle routing problem with time windows where the
goal is to maximize the quality of service delivered to the customer. In the literature, this …

Bin-oriented heuristics for one-dimensional bin-packing problem construct solutions by
packing one bin at a time. Several such heuristics consider two or more subsets for each bin …

The well-known one-dimensional Bin Packing Problem (BPP) of whose variants arise in
many real life situations is a challenging NP-Hard combinatorial optimization problem …

This paper addresses the rescue unit allocation and scheduling problem (RUASP) with
fuzzy processing times through an evolutionary approach. The goal of RUASP is to …