Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search

Alinaghian, Mahdi; Shokouhi, Nadia

doi:10.1016/j.omega.2017.05.002

Cited by 118 publications

(47 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The algorithm performance show that the ALNS remarkably outperforms the competitor, both in solution quality and processing time. Alinaghian and Shokouhi [30] combined ALNS and Variable Neighborhood Search (VNS) to solve the model for multi-depot multi-compartment vehicle routing problem. The computational results show good performance of the proposed hybrid algorithm.…”

Section: Literature Reviewmentioning

confidence: 99%

Location Decision Making and Transportation Route Planning Considering Fuel Consumption

Theeraviriya

Pitakaso

Sillapasa

et al. 2019

Journal of Open Innovation: Technology, Market, and Complexity

View full text Add to dashboard Cite

This study presents the Location Routing Problem (LRP) for which we have created a model for the integration of locating facilities and vehicle routing decisions to solve the problem. The case study is the Palm Oil Collection Center, which is also important for the supply chain system. A mathematical model was made to minimize the total cost of a facility-opening cost, fixed cost of vehicle uses and fuel consumption cost. The fuel consumption cost relies on the distance and road conditions, in case of poor physical condition of a road, and its width, which can be affected the speed of the vehicle as well as the used fuel. Thus, we propose an Adaptive Large Neighborhood Search (ALNS) based on heuristic for solving the LRP. The ALNS method was tested with three datasets of samples divided into small, medium and large problems. Then, the results were compared with the results from the exact method by the Lingo program. The computational study indicated that the ALNS algorithm was competitive to the results of the Lingo for all instance sizes. Moreover, the ALNS was more effective than the exact method; approximately 99% in terms of processing time. We extended this approach to solve the case study, which was considered to be the largest problem, and the ALNS algorithm was efficient with acceptable solutions and short processing time. Therefore, the proposed method provided an effective solution to manage location routing decision of the palm oil collection center.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Location Decision Making and Transportation Route Planning Considering Fuel Consumption

Theeraviriya

Pitakaso

Sillapasa

et al. 2019

Journal of Open Innovation: Technology, Market, and Complexity

View full text Add to dashboard Cite

show abstract

“…Genetic algorithms were used for initial solutions and the iterative swap procedure [44] was used for the improvement phase. Alinaghian and Shokouhi [40] introduced the MCVRP under multiple depot and split delivery assumptions. The authors developed a mathematical model and a hybrid algorithm, composed of an adaptive large neighborhood search and a variable neighborhood search for large scale instances.…”

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

“…Sample problems, including 5-40 customers, were tested to investigate the performance of the algorithms. Alinaghian and Shokouhi (2018) proposed a hybrid algorithm based on an adaptive large neighbourhood search, and a VNS was developed to solve large-scale instances. The objective function of the proposed problem included the minimization of the number of vehicles and subsequent minimization of the total traversed distance.…”

Section: Literature Reviewmentioning

confidence: 99%

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

et al. 2019

View full text Add to dashboard Cite

The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.

show abstract

Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search

Cited by 118 publications

References 31 publications

Location Decision Making and Transportation Route Planning Considering Fuel Consumption

Location Decision Making and Transportation Route Planning Considering Fuel Consumption

Vehicle Routing with Compartments Under Product Incompatibility Constraints

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

Contact Info

Product

Resources

About