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

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

The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, ...