Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm

Yousefikhoshbakht, Majid; Didehvar, Farzad; Rahmati, Farhad

doi:10.1080/00207543.2013.855337

Cited by 33 publications

(19 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors proposed a multistart adaptive memory programming algorithm with a modified tabu search heuristic which was applied to randomly generated instances with between 50 and 200 nodes and with six vehicle types. The second paper on this problem is by Yousefikhoshbakht et al (2014), in which an adaptive memory algorithm combined with tabu search is proposed. The algorithm generates initial diversified solutions which are later intensified.…”

Section: The Hvrp With Split Deliveriesmentioning

confidence: 99%

Thirty years of heterogeneous vehicle routing

Koç

Bektaş

Jabali

et al. 2016

European Journal of Operational Research

206

View full text Add to dashboard Cite

It has been around thirty years since the heterogeneous vehicle routing problem was introduced, and significant progress has since been made on this problem and its variants. The aim of this survey paper is to classify and review the literature on heterogeneous vehicle routing problems. The paper also presents a comparative analysis of the metaheuristic algorithms that have been proposed for these problems.

show abstract

Section: The Hvrp With Split Deliveriesmentioning

confidence: 99%

Thirty years of heterogeneous vehicle routing

Koç

Bektaş

Jabali

et al. 2016

European Journal of Operational Research

206

View full text Add to dashboard Cite

show abstract

“…The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is an important extension of the OVRP which was first considered by Li et al [24]. The HFFOVRP has numerous applications in industrial and logistics problems and the OVRP can be obtained from HFFOVRP by removing the constraint of vehicle heterogeneity [34].…”

mentioning

confidence: 99%

“…For the heterogeneous fixed fleet open vehicle routing problems, a multi start adaptive memory-based tabu search algorithm is applied by Li et al [24]. Yousefikhoshbakht et al [34] presented a combined metaheuristic algorithm for the heterogeneous fixed fleet open vehicle routing problems.…”

mentioning

confidence: 99%

Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems

Takan¹,

Kasımbeyli²

2021

JIMO

View full text Add to dashboard Cite

In this paper, we study three types of heterogeneous fixed fleet vehicle routing problems, which are capacitated vehicle routing problem, open vehicle routing problem and split delivery vehicle routing problem. We propose new multiobjective linear binary and mixed integer programming models for these problems, where the first objective is the minimization of a total routing and usage costs for vehicles, and the second one is the vehicle type minimization, respectively. The proposed mathematical models are all illustrated on test problems, which are investigated in two groups: small-sized problems and the large-sized ones. The small-sized test problems are first scalarized by using the weighted sum scalarization method, and then GAMS software is used to compute efficient solutions. The large-sized test problems are solved by utilizing the tabu search algorithm.2010 Mathematics Subject Classification. Primary: 90C08, 90C11; Secondary: 90C29.

show abstract

“…To make VRP models more realistic and applicable, there are various forms of the VRP obtained by adding constraints to the basic model. Examples of such extensions are VRP with pickup and delivery (if the vehicles need to pick up and delivery) [2], VRP with time windows (if the services have time constraint) [3], heterogeneous fleet OVRP (if the capacity of vehicles in OVRP are different) [4], VRP with backhauls (if the customers with delivery demand have to be visited before by the customers with a pickup demand) [5] and generalized VRP (if the customers are partitioned into clusters with given demands such that exactly one customer from each cluster should be visited) [6]. The VRP solution methods fall into three main categories: exact methods, heuristic and metaheuristic algorithms.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Solution for the VRP by Using a Hybrid Elite Ant System

Yousefikhoshbakht¹,

Didehvar²,

Rahmati³

2014

INT J COMPUT COMMUN

Self Cite

View full text Add to dashboard Cite

The vehicle routing problem (VRP) is a well-known NP-Hard problem in operation research which has drawn enormous interest from many researchers during the last decades because of its vital role in planning of distribution systems and logistics. This article presents a modified version of the elite ant system (EAS) algorithm called HEAS for solving the VRP. The new version mixed with insert and swap algorithms utilizes an effective criterion for escaping from the local optimum points. In contrast to the classical EAS, the proposed algorithm uses only a global updating which will increase pheromone on the edges of the best (i.e. the shortest) route and will at the same time decrease the amount of pheromone on the edges of the worst (i.e. the longest) route. The proposed algorithm was tested using fourteen instances available from the literature and their results were compared with other well-known meta-heuristic algorithms. Results show that the suggested approach is quite effective as it provides solutions which are competitive with the best known algorithms in the literature.

show abstract

Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm

Cited by 33 publications

References 23 publications

Thirty years of heterogeneous vehicle routing

Thirty years of heterogeneous vehicle routing

Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems

An Efficient Solution for the VRP by Using a Hybrid Elite Ant System

Contact Info

Product

Resources

About