Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem

Abdulkader, M.M.S.; Gajpal, Yuvraj; ElMekkawy, Tarek Y.

doi:10.1016/j.asoc.2015.08.020

Cited by 101 publications

(43 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For instance, El Fallahi et al [32] proposed a memetic algorithm as a genetic algorithm hybridized with a local search procedure for constructive heuristics and a tabu search [45] for path relinking. Abdulkader et al [38] introduced a distance-constrained variant of the problem by applying a hybrid ant colony optimization algorithm and local search procedures. Koch et al [39] worked on the MCVRP with flexible compartment sizes and developed a genetic algorithm where each gene represents a customer location and their supply of a specific product type.…”

Section: The Basic Modelmentioning

confidence: 99%

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Taşar

Eliiyi

Kandiller

2019

PROMET

View full text Add to dashboard Cite

This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in this study. Secondly, new mathematical models are proposed for the basic MCVRP, together with its multiple-trip and split-delivery extensions, for obtaining exact solutions for small-size instances. Finally, heuristic algorithms are developed for larger instances of the three problem variants. To test the performance of our heuristics against optimum solutions for larger instances, a lower bounding scheme is also proposed. The results of the computational experiments are reported, indicating validity and a promising performance of an approach.

show abstract

Section: The Basic Modelmentioning

confidence: 99%

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Taşar

Eliiyi

Kandiller

2019

PROMET

View full text Add to dashboard Cite

show abstract

“…The used MCVRP benchmark instances are proposed by Abdulkader et al (2015). They consist in an enrichment of Christofides ' Christofides and Mingozzi (1979) benchmark using the strategy of Reed et al (2014).…”

Section: Comparison With State Of the Art Approachesmentioning

confidence: 99%

“…The memetic algorithm and a tabu search were applied to transportation of animal foods to farms in Fallahi et al (2008). There have been also various approaches to the waste collection problem in (Reed et al 2014;Abdulkader et al 2015;Elbek and Wøhlk 2016). Lahyani et al (2015) proposed a mathematical formulation and branch-and-cut algorithm to solve the multi-period MCVRP in the olive oil collection process in Tunisia.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

et al. 2018

View full text Add to dashboard Cite

We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to minimize the total driving distance by the used trucks. The problem configuration is described through a prefixed set of trucks with several compartments and a set of customers with demands and prefixed delivery. Given such inputs, the minimization of the total traveled distance is subject to assignment and routing constraints that express the capacity limitations of each truck's compartment in terms of the pathways' restrictions. For the NPhardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality. We compare the ability of the proposed AVNS with the exact solution using CPLEX and a set of benchmark problem instances is used to analyze the performance of the both proposed meta-heuristics.

show abstract

“…This model is part of the Vehicle Routing Problem with Pickup and Delivery with Time Windows (VRPPDTW), which is a generalization of the Vehicle Routing Problem with Time Windows (VRPTW) [22]. The Vehicle Routing Problem (VRP) is defined as a class of problems in which the demands of customers are fulfilled with the products originating from depot and transported using a fleet of vehicles in such a way that the total traveling cost of all vehicles is minimized [23].…”

Section: Vrppdtwmentioning

confidence: 99%

Model based on Hybridized Game Theory to Optimize Logistics: Case of Blood Supply Chain

Mouatassim¹,

Ahlaqqach²,

Benhra³

et al. 2016

IJCA

View full text Add to dashboard Cite

Several researches have been done to optimize different flows in blood supply chain. However, the use of game theory in this sense is rare. The following work focus on the case of Morocco, consisting of 16 Regional Blood Transfusion Centers (RBTC) centralized around a National Blood Transfusion and Hematology Center (NBTHC). An approach based on hybridized game theory is adopted to form core and strongly stable coalitions and optimize as much as possible the transport cost. Firstly, the optimal cost of each coalition of the 33 possible coalitions; that the Director of NBTHC validated; is computed by using a mixed integer linear Programming model (MILP). Then these costs are introduced as data of two other MILP to define which structure minimizes the total cost allocated to each RTBC while maintaining core stability, in the case of the first MILP, and strong equilibrium in the case of the second. The VRPPDTW is also introduced within each coalition in order to optimize the cost of transport more. General TermsMixed integer linear programming, logistics, game theory.

show abstract

Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem

Cited by 101 publications

References 21 publications

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

Model based on Hybridized Game Theory to Optimize Logistics: Case of Blood Supply Chain

Contact Info

Product

Resources

About