Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem

被引：19
|
作者：
Pop, P. C. [1 ]
Sitar, C. Pop [2 ]
Zelina, I. [1 ]
Lupse, V. [1 ]
Chira, C. [3 ]
机构：
[1] N Univ Baia Mare, Dept Math & Informat, V Babes 430083, Baia Mare, Romania
[2] N Univ Baia Mare, Dept Econ, V Babes 430083, Baia Mare, Romania
[3] Univ Babes Bolyai, Cluj Napoca 400084, Romania
来源：
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL | 2011年 / 6卷 / 01期
关键词：
network design; combinatorial optimization; generalized vehicle routing problem; heuristic algorithms;
D O I：
10.15837/ijccc.2011.1.2210
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to the many practical applications in the field of distribution, collection, logistics, etc. We study a generalization of the VRP called the generalized vehicle routing problem (GVRP) where given a partition of the nodes of the graph into node sets we want to find the optimal routes from the given depot to the number of predefined clusters which include exactly one node from each cluster. The purpose of this paper is to present heuristic algorithms to solve this problem approximately. We present constructive algorithms and local search algorithms for solving the generalized vehicle routing problem.
引用
收藏
页码：158 / 165
页数：8
相关论文
共 50 条
  • [21] Exact and heuristic algorithms for solving the generalized minimum filter placement problem
    E. Chisonge Mofya
    J. Cole Smith
    [J]. Journal of Combinatorial Optimization, 2006, 12 : 231 - 256
  • [22] New construction heuristic algorithm for solving the vehicle routing problem with time windows
    Liu, Jun
    Feng, Shuo
    Niu, Qun
    Ji, Lijuan
    [J]. IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2019, 1 (03) : 90 - 96
  • [23] A simple and efficient tabu search heuristic for solving the open vehicle routing problem
    Derigs, U.
    Reuter, K.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (12) : 1658 - 1669
  • [24] Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic
    Hvattum, Lars M.
    Lokketangen, Arne
    Laporte, Gilbert
    [J]. TRANSPORTATION SCIENCE, 2006, 40 (04) : 421 - 438
  • [25] A Heuristic Comparison Framework for Solving the Two-Echelon Vehicle Routing Problem
    Butty, Xavier
    Stuber, Thomas
    Hanne, Thomas
    Dornberger, Rolf
    [J]. 2016 4TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL AND BUSINESS INTELLIGENCE (ISCBI), 2016, : 59 - 65
  • [26] A survey of genetic algorithms for solving multi depot vehicle routing problem
    Karakatic, Saso
    Podgorelec, Vili
    [J]. APPLIED SOFT COMPUTING, 2015, 27 : 519 - 532
  • [27] Modified Clarke Wright Algorithms for Solving the Realistic Vehicle Routing Problem
    Shour, Amina
    Danash, Kassem
    Tarhini, Abbas
    [J]. 2015 THIRD INTERNATIONAL CONFERENCE ON TECHNOLOGICAL ADVANCES IN ELECTRICAL, ELECTRONICS AND COMPUTER ENGINEERING (TAEECE), 2015, : 89 - 93
  • [28] New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
    Borowski, Michal
    Gora, Pawel
    Karnas, Katarzyna
    Blajda, Mateusz
    Krol, Krystian
    Matyjasek, Artur
    Burczyk, Damian
    Szewczyk, Miron
    Kutwin, Michal
    [J]. COMPUTATIONAL SCIENCE - ICCS 2020, PT VI, 2020, 12142 : 546 - 561
  • [29] SOLVING GENERALIZED VEHICLE ROUTING PROBLEM BY PARALLEL UNIVERSES AND TABU SEARCH
    Navidadham, Mohammadhossein
    Arbabsadeghi, Mostafa
    Bayat, Alireza Akbari
    Didehvar, Farzad
    [J]. 2015 6TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT), 2015, : 118 - 124
  • [30] Heuristic and exact algorithms for a min-max selective vehicle routing problem
    Valle, Cristiano Arbex
    Martinez, Leonardo Conegundes
    da Cunha, Alexandre Salles
    Mateus, Geraldo R.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (07) : 1054 - 1065
12345