Vehicle routing with compartments: applications, modelling and heuristics

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

“…Choosing a vehicle configuration can be compared to determining compartment sizes in the flexible multi-compartment VRP described in Derigs et al (2011). In this paper, compartment sizes are determined together with a set of routes for vehicles with flexible compartments.…”

“…The goal is to deliver various types of goods, given that some goods cannot be transported in the same compartment. Compartments can be continuously flexible as presented in Koch et al (2016); Derigs et al (2011), or discretely flexible if compartment options are defined beforehand as in Henke et al (2015). The difference with our problem is twofold: first, in the FSM-DARP-RC, the total capacity changes from one configuration to another, in a non-linear way, whereas in multi-compartment problems, the sum of compartment sizes is assumed to remain constant.…”

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

“…Varian MRK ini telah dibahas oleh Christofides et al [17]. Penelitian lainnya, antara lain, adalah Chajakis and Guignard [18], Avella et al [19], El Fallahi et al [20], Derigs et al [21], dan Reed et al [22].…”

A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping

“…In road transport, compartments can be fixed in size or flexible. In (Derigs et al, 2011) a survey and computational comparison of current literature within road transport is presented. Interestingly, road transport always assumes integrated optimization of routing and cargo allocation, and, in addition, the majority of developed approaches are based on heuristics or metaheuristics.…”