A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Fallahi, Abdellah El; Prins, Christian; Calvo, Roberto Wolfler

doi:10.1016/j.cor.2006.10.006

Cited by 174 publications

(91 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…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].…”

Section: * Penulis Korespondensiunclassified

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

Suprayogi

Paillin

2018

jti

View full text Add to dashboard Cite

This paper discusses a variant of the basic vehicle routing problem (VRP) by including the following characteristics: fleet size and mix, multiple trips, split delivery, multiple products, and multiple compartments. One of real cases of this problem is related to determining tanker's routes in delivering fuel products from a supply port to a number of destination ports. Each tanker has several compartments where each compartment is dedicated to a certain fuel product. In this paper, a solution approach based on genetic algorithm (GA) is proposed and tested using nine hypothetical instances. Experiment results show that the proposed GA gives consistent results measured by coefficient variations.

show abstract

Section: * Penulis Korespondensiunclassified

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

Suprayogi

Paillin

2018

jti

View full text Add to dashboard Cite

show abstract

“…Hence, it is concluded that TS performs better than SA and TA in terms of solution quality and computation time for the single VRP with stochastic demands. Fallahi et al (2008) introduced a multi-compartment vehicle routing problem (MC-VRP), a problem not yet studied in literature in spite of its important practical applications. Three algorithms were proposed to solve it: a constructed heuristic, a memetic algorithm (MA) combined with a path relinking method used as post optimization, and TS.…”

Section: Tabu Search Applicationsmentioning

confidence: 99%

Tabu Search: A Comparative Study

Pirim¹,

Bayraktar²,

Ekşioğlu³

2008

Tabu Search

View full text Add to dashboard Cite

“…Muyldermans and Pang (2010) proposed a guided local search for the MCVRP and demonstrate the benefits of co-collection of sorted waste from different locations to central location by multi-compartment vehicles over separate collection by vehicles. They compared the results with Fallahi et al (2008). They assumed that more than one vehicle can visit the customer to fulfill demands of different products.…”

Section: Introductionmentioning

confidence: 99%

“…Chajakis and Guignard (2003) targeted the delivery of groceries problem where refrigerated and non-refrigerated grocery items are stored in separate compartments in the same truck. 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).…”

Section: Introductionmentioning

confidence: 99%

“…The different modeling features, optimization models and solution approaches developed for this variant of the MCVRP have been described below. Fallahi et al (2008) applied the MCVRP in which the different animal foods is supplied to the farms separately. They proposed three algorithms a constructed heuristic, a memetic algorithm combined with a path relinking method used as post optimization, and a tabu search to solve this problem.…”

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

A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Cited by 174 publications

References 17 publications

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

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

Tabu Search: A Comparative Study

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

Contact Info

Product

Resources

About