Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking

Ali Baniamerian, Mahdi Bashiri, Reza Tavakkoli-Moghaddam

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper considers a profitable heterogeneous vehicle routing problem with cross-docking (PHVRPCD). In the real world, it is not possible to serve all customers and suppliers. Based on the purchasing cost and selling price of the products as well as the resource limitation, they will be in the plan only if it is profitable to serve them, so satisfying all demands is not necessary. Cost reduction has been considered in the previous studies as a main objective while neglecting the total profit. In this study, increasing the total profit of a cross-docking system is the main concern. For this purpose, a mixed-integer linear programming (MILP) model is used to formulate the problem mathematically. A new hybrid meta-heuristic algorithm based on modified variable neighborhood search (MVNS) with four shaking and two neighborhood structures and a genetic algorithm (GA) is presented to solve large-sized problems. The results are compared with those obtained with an artificial bee colony (ABC) and a simulated annealing (SA) algorithm. In order to evaluate the performance of the proposed algorithms, various examples of a real data set are solved and analyzed. The computational results reveal that in the small-size test problems, the hybrid algorithm is able to find optimal solutions in an acceptable computational time. Also, the hybrid algorithm needs less computational time than others and could achieve better solutions in large-size instances.

Original languageEnglish
Pages (from-to)441-460
Number of pages20
JournalApplied Soft Computing Journal
Volume75
Early online date22 Nov 2018
DOIs
Publication statusPublished - 1 Feb 2019
Externally publishedYes

Fingerprint

Vehicle routing
Genetic algorithms
Profitability
Purchasing
Heuristic algorithms
Cost reduction
Simulated annealing
Linear programming
Sales
Costs

Keywords

  • Cross-docking
  • Hybrid algorithm
  • Profitable vehicle routing
  • Purchasing cost
  • Selling price

ASJC Scopus subject areas

  • Software

Cite this

Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. / Baniamerian, Ali; Bashiri, Mahdi; Tavakkoli-Moghaddam, Reza.

In: Applied Soft Computing Journal, Vol. 75, 01.02.2019, p. 441-460.

Research output: Contribution to journalArticle

@article{1680f7bc4dc54d2baa7a69936c3e1b13,
title = "Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking",
abstract = "This paper considers a profitable heterogeneous vehicle routing problem with cross-docking (PHVRPCD). In the real world, it is not possible to serve all customers and suppliers. Based on the purchasing cost and selling price of the products as well as the resource limitation, they will be in the plan only if it is profitable to serve them, so satisfying all demands is not necessary. Cost reduction has been considered in the previous studies as a main objective while neglecting the total profit. In this study, increasing the total profit of a cross-docking system is the main concern. For this purpose, a mixed-integer linear programming (MILP) model is used to formulate the problem mathematically. A new hybrid meta-heuristic algorithm based on modified variable neighborhood search (MVNS) with four shaking and two neighborhood structures and a genetic algorithm (GA) is presented to solve large-sized problems. The results are compared with those obtained with an artificial bee colony (ABC) and a simulated annealing (SA) algorithm. In order to evaluate the performance of the proposed algorithms, various examples of a real data set are solved and analyzed. The computational results reveal that in the small-size test problems, the hybrid algorithm is able to find optimal solutions in an acceptable computational time. Also, the hybrid algorithm needs less computational time than others and could achieve better solutions in large-size instances.",
keywords = "Cross-docking, Hybrid algorithm, Profitable vehicle routing, Purchasing cost, Selling price",
author = "Ali Baniamerian and Mahdi Bashiri and Reza Tavakkoli-Moghaddam",
year = "2019",
month = "2",
day = "1",
doi = "10.1016/j.asoc.2018.11.029",
language = "English",
volume = "75",
pages = "441--460",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier",

}

TY - JOUR

T1 - Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking

AU - Baniamerian, Ali

AU - Bashiri, Mahdi

AU - Tavakkoli-Moghaddam, Reza

PY - 2019/2/1

Y1 - 2019/2/1

N2 - This paper considers a profitable heterogeneous vehicle routing problem with cross-docking (PHVRPCD). In the real world, it is not possible to serve all customers and suppliers. Based on the purchasing cost and selling price of the products as well as the resource limitation, they will be in the plan only if it is profitable to serve them, so satisfying all demands is not necessary. Cost reduction has been considered in the previous studies as a main objective while neglecting the total profit. In this study, increasing the total profit of a cross-docking system is the main concern. For this purpose, a mixed-integer linear programming (MILP) model is used to formulate the problem mathematically. A new hybrid meta-heuristic algorithm based on modified variable neighborhood search (MVNS) with four shaking and two neighborhood structures and a genetic algorithm (GA) is presented to solve large-sized problems. The results are compared with those obtained with an artificial bee colony (ABC) and a simulated annealing (SA) algorithm. In order to evaluate the performance of the proposed algorithms, various examples of a real data set are solved and analyzed. The computational results reveal that in the small-size test problems, the hybrid algorithm is able to find optimal solutions in an acceptable computational time. Also, the hybrid algorithm needs less computational time than others and could achieve better solutions in large-size instances.

AB - This paper considers a profitable heterogeneous vehicle routing problem with cross-docking (PHVRPCD). In the real world, it is not possible to serve all customers and suppliers. Based on the purchasing cost and selling price of the products as well as the resource limitation, they will be in the plan only if it is profitable to serve them, so satisfying all demands is not necessary. Cost reduction has been considered in the previous studies as a main objective while neglecting the total profit. In this study, increasing the total profit of a cross-docking system is the main concern. For this purpose, a mixed-integer linear programming (MILP) model is used to formulate the problem mathematically. A new hybrid meta-heuristic algorithm based on modified variable neighborhood search (MVNS) with four shaking and two neighborhood structures and a genetic algorithm (GA) is presented to solve large-sized problems. The results are compared with those obtained with an artificial bee colony (ABC) and a simulated annealing (SA) algorithm. In order to evaluate the performance of the proposed algorithms, various examples of a real data set are solved and analyzed. The computational results reveal that in the small-size test problems, the hybrid algorithm is able to find optimal solutions in an acceptable computational time. Also, the hybrid algorithm needs less computational time than others and could achieve better solutions in large-size instances.

KW - Cross-docking

KW - Hybrid algorithm

KW - Profitable vehicle routing

KW - Purchasing cost

KW - Selling price

UR - http://www.scopus.com/inward/record.url?scp=85057530959&partnerID=8YFLogxK

U2 - 10.1016/j.asoc.2018.11.029

DO - 10.1016/j.asoc.2018.11.029

M3 - Article

VL - 75

SP - 441

EP - 460

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -