Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions

Ostermeier, Manuel; Henke, Tino; Hübner, Alexander; Wäscher, Gerhard

doi:10.1016/j.ejor.2020.11.009

Cited by 55 publications

(24 citation statements)

References 82 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem was solved using LNS. Ostermeier et al (2021) introduced a typology for MC-VRPs and extensively reviewed the existing literature. They also made suggestions for future research.…”

Section: Related Workmentioning

confidence: 99%

A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers

Davila-Pena

Penas

Casas-Méndez

2021

Int Trans Operational Res

View full text Add to dashboard Cite

This paper presents a new formulation for the routing problem in which the available fleet consists of trucks and trailers divided into compartments. Solving the model for large instances is computationally expensive. Therefore, we introduce and implemented a two-phase heuristic algorithm. In the first phase, an initial solution is generated through a constructive heuristic algorithm based on concepts from the classic Clarke-Wright algorithm. In the second phase, the initial solution is improved by an iterated tabu search metaheuristic. Our algorithm was tested on 21 instances that were converted from the classic truck and trailer routing problem. The results of our computational study prove the effectiveness of our proposal; the algorithm always finds a feasible solution, which in small-sized problems it is proven to be of good quality. In addition, the algorithm outperforms previous approaches for some truck and trailer routing problem instances. Furthermore, an application of the proposed model and heuristic is demonstrated in the field of agricultural logistics by comparing the obtained results.

show abstract

Section: Related Workmentioning

confidence: 99%

A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers

Davila-Pena

Penas

Casas-Méndez

2021

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…There are interesting and relevant vehicle routing applications that can be modeled only by explicitly considering multiple commodities. This happens, for example, when the vehicles have multiple compartments, each with limited capacity, to keep multiple com-modities separated (see Ostermeier et al [2020] for a recent review of the literature on multi-compartment routing problems). Multiple commodities have to be explicitly modeled also when the vehicles start from multiple locations where each commodity is available in limited, possibly location dependent, quantities.…”

Section: Classes Of Vehicle Routing Problemsmentioning

confidence: 99%

“…In this paper we review the literature on this class of problems. Surveys have appeared on the VRPs with profits (see Archetti et al [2014b]), on the VRPs with split deliveries (see Archetti and Speranza [2012]), and on routing problems with multicompartment vehicles (see Ostermeier et al [2020]). The latter has appeared after the publication of the original version of this survey ).…”

Section: Introductionmentioning

confidence: 99%

Vehicle routing problems over time: a survey

Mor

Speranza

2020

4OR-Q J Oper Res

View full text Add to dashboard Cite

In Vehicle Routing Problems (VRPs) the decisions to be taken concern the assignment of customers to vehicles and the sequencing of the customers assigned to each vehicle. Additional decisions may need to be jointly taken, depending on the specific problem setting. In this paper, after discussing the different kinds of decisions taken in different classes of VRPs, the class where the decision about when the routes start from the depot has to be taken is considered and the related literature is reviewed. This class of problems, that we call VRPs over time, includes the periodic routing problems, the inventory routing problems, the vehicle routing problems with release dates, and the multi-trip vehicle routing problems.

show abstract

“…In the arc routing problems in the case of waste collection, the reduction of total distance and cost using multi-compartment vehicles (MCVs) is a considerable subject (Mofid-Nakhaee and Barzinpour, 2019). The usage of MCVs results in significant cost reductions (Frank et al, 2021), so MCVs are frequently considered in waste collection (Ostermeier et al, 2021), which typically has four separate compartments, so that different types of non-mixable waste types can be stored separately (Reed et al, 2014).…”

Section: Introductionmentioning

confidence: 99%

Dynamic routing for waste collection and transportation with multi-compartment electric vehicle using smart waste bins

Yang

Tao

Zhong³

2022

Waste Manag Res

View full text Add to dashboard Cite

The municipal solid waste (MSW) collection and transportation issue has been studied by numerous researchers; however, a few studies consider the chance-constrained programming for co-collection of sorted waste with electric vehicles (EVs). Therefore, this article attempts to study on the chance-constrained collection and transportation problem for sorted waste with multiple separated compartments EVs. Considering the uncertainty of the waste generation rate under the scenario of application of smart waste bins, chance-constrained programming is applied to transform the uncertain model into a certain one. A Chance-Constrained Multi-Compartment Electric Vehicle Routing Problem (CCMCEVRP) is introduced and the corresponding mathematical formulation is established. A diversity-enhanced particle swarm optimisation with neighbourhood search and simulated annealing (DNSPSOSA) is proposed to solve this problem, and effectiveness of the proposed algorithms is verified by extensive numerical experiments on the newly generated instances. In addition, the application of the model is tested by comparing different compartment and different type vehicles. It is found that, compared with fuel vehicles, 32.66% of the average cost could be saved with EVs. Furthermore, the rate of cost-saving of EVs increases with the increase in the number of compartments: the improvement rate of cost-saving of two-compartment EVs and three-compartment EVs is 52.77% and 68.13%, respectively.

show abstract

Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions

Cited by 55 publications

References 82 publications

A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers

A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers

Vehicle routing problems over time: a survey

Dynamic routing for waste collection and transportation with multi-compartment electric vehicle using smart waste bins

Contact Info

Product

Resources

About