In this paper, we investigate an extension of the R-DARP recently proposed by [Liu M, Luo Z, Lim A (2015) A branch-and-cut algorithm for a realistic dial-a-ride problem. Transporation Res. Part B: ...

This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible ...

Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling. The fundamental task is to ...