An Improved Variable Neighborhood Search Algorithm for Multi Depot Heterogeneous Vehicle Routing Problem based on Hybrid Operators

Xu, Yuanjin; Jiang, Wei

doi:10.14257/ijca.2014.7.3.29

Cited by 14 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Xu et al (2012) considered a multiple depot case with heterogeneous capacity fleet aiming to minimise the travel costs as well as time-window and vehicle working time violations, using Variable Neighbourhood Search (VNS) approach and they later introduced simulated annealing when accepting solutions within VNS (Yang et al, 2013). However, they only tested their method on single depot instances while it was later applied to a case study of two depots (Xu and Jiang, 2014). Adelzadeh et al (2014) considered a multiple depot case with fuzzy time-windows and heterogeneous vehicles where each vehicle has different capacity, speed and operating costs aiming to minimise the travelled distance and maximise the customer service level, using the simulated annealing approach.…”

Section: Literature Reviewmentioning

confidence: 99%

An agent-based optimisation approach for vehicle routing problem with unique vehicle location and depot

Abu-Monshar

Al-Bazi

Palade

2022

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

An agent-based optimisation approach for vehicle routing problem with unique vehicle location and depot

Abu-Monshar

Al-Bazi

Palade

2022

Expert Systems with Applications

View full text Add to dashboard Cite

“…Other researchers, including Sun et al (2015), Miranda et al (2019) and Wang et al (2015), stress the importance of considering and combining transportation decisions into PRP models. Other related problems are associated with VRP, such as the Heterogeneous Fleet Vehicle Routing Problem (HVRP), Xu and Jiang (2014) focused on solving the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW) via an Improved Variable Neighborhood Search (IVNS) metaheuristic. Tarantilis et al (2001) studied an extension of the classical VRP, named (HFFVRP) Heterogeneous Fixed Fleet Vehicle Routing Problem based on threshold accepting based algorithm aiming to find effective delivery schedules for one of the biggest dairy companies in Greece.…”

Section: State Of the Artmentioning

confidence: 99%

“…In contrast, the PRP differs from the classical VRP (Vehicle routing problem). It deals with the mixed fleet or as the heterogeneous fleet of vehicles having different capacities and costs (Xu & Jiang 2014).…”

Section: Introductionmentioning

confidence: 99%

A hybrid methodology based on heuristic algorithms for a production distribution system with routing decisions

Bensakhria¹,

Abdelhamid²

2021

Bizinfo

View full text Add to dashboard Cite

In this paper, we address the integration of a two-level supply chain with multiple items. This two-level production-distribution system features a capacitated production facility supplying several retailers located in the same region. If production does occur, this process incurs a fixed setup cost and unit production costs. Besides, deliveries are made from the plant to the retailers by a limited number of capacitated vehicles, routing costs incurred. This work aims to implement a minimization solution that reduces the total costs in both the production facility and retailers. The methodology adopted based on a hybrid heuristic, greedy and genetic algorithm uses strong formulation to provide a suitable solution of a guaranteed quality that is as good or better than those provided by the MIP optimizer. The results demonstrate that the proposed heuristics are effective and performs impressively in terms of computational efficiency and solution quality.

show abstract

“…Time-related constraints including static and fuzzy time windows for customers and depots have also received increased attention in the last few years, e.g., Bettinelli et al. ( 2011 ), Xu and Jiang ( 2014 ), Adelzadeh et al. ( 2014 ) and Koç et al.…”

Section: Introductionmentioning

confidence: 99%

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem

2017

View full text Add to dashboard Cite

In this paper, we compare different formulations of the multi-depot fleet size and mix vehicle routing problem (MDFSMVRP). This problem extends the multidepot vehicle routing problem and the fleet size and mix vehicle routing problem, two logistics problems that have been extensively studied for many decades. This difficult vehicle routing problem combines complex assignment and routing decisions under the objective of minimizing fixed vehicle costs and variable routing costs. We first propose five distinct formulations to model the MDFSMVRP. We introduce a three-index formulation with an explicit vehicle index and a two-index formulation in which only vehicle types are identified. Other formulations are obtained by defining aggregated and disaggregated loading variables. The last formulation makes use of capacity-indexed variables. For each formulation, we summarize known and propose new valid inequalities, including symmetry breaking, lexicographic ordering, routing, and rounded capacity cuts. We then implement branch-and-cut and branch-and-bound algorithms for these formulations, and we fed them into a general purpose solver. We compare the bounds provided by the formulations on a commonly used set of instances in the MDFSMVRP literature, containing up to nine depots and 360 customers, and on newly generated instances. Our in-depth analysis of the five formulations shows which formulations tend to perform better on each type of instance. Moreover, our results have considerably improved available lower bounds on all instances and significantly improved quality of upper bounds that can be obtained by means of currently available methods.

show abstract

An Improved Variable Neighborhood Search Algorithm for Multi Depot Heterogeneous Vehicle Routing Problem based on Hybrid Operators

Abstract: Abstract

Cited by 14 publications

References 30 publications

An agent-based optimisation approach for vehicle routing problem with unique vehicle location and depot

An agent-based optimisation approach for vehicle routing problem with unique vehicle location and depot

A hybrid methodology based on heuristic algorithms for a production distribution system with routing decisions

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem

Contact Info

Product

Resources

About