Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a...

This work proposes a variation of the location-routing problem (LRP), a problem that interconnects two well-known N P-hard optimisation problems: the vehicle routing problem (VRP) and facility location problem (FLP). There are many mathematical formulations and solution methods for a number of...

The Facility Layout Problem (FLP) is a classic problem for industrial engineers and work area designers, taking relevance because of its direct impact on productivity and efficiency in the productive systems. On the other hand, we face the Unequal Area Facility Layout Problem (UA-FLP) when the...

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...

With the rapid development of e-commerce, enterprises need to improve their distribution networks to accommodate the increasing requirements regarding the quality of customer service and the rising costs of the logistics. We investigate a distribution network design problem involving various...

We study an extension of the cardinality-constrained knapsack problem where each item has a concave piecewise-linear utility structure. Our main contributions are approximation algorithms for the problem and the investigation of an online version in the random order model. For the offline...

We investigate the problem of $k$-submodular maximization under a knapsack constraint over the ground set of size $n$. This problem finds many applications in various fields such as multi-topic propagation, multi-sensor placement, cooperative games, etc. However, existing algorithms for the...

The transit network design problem (TNDP) takes the form of bi-level programming and falls into the category of nondeterministic polynomial time-hard (NP-hard) problems that cannot be solved in a practical amount of computing time as the problem size increases. The upper-level objective is to...