Heuristic Procedures for the Capacitated Vehicle Routing Problem

被引：0
|
作者：
V. Campos
E. Mota
机构：
[1] Universitat de València,Departament d'Estadística i Investigació Operativa
来源：
Computational Optimization and Applications | 2000年 / 16卷
关键词：
vehicle routing; heuristics; tabu search; combinatorial optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.
引用
收藏
页码：265 / 277
页数：12
相关论文
共 50 条
  • [41] Heuristic procedure for bi-capacitated multiple-trip vehicle routing problem
    Rattanamanee, Tarit
    Nanthavanij, Suebsak
    [J]. EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2022, 16 (03) : 294 - 316
  • [42] Capacitated Vehicle Routing Problem Depending on Vehicle Load
    Cickova, Zuzana
    Brezina, Ivan
    Pekar, Juraj
    [J]. MATHEMATICAL METHODS IN ECONOMICS (MME 2017), 2017, : 108 - 112
  • [43] A simulated annealing heuristic for the capacitated location routing problem
    Yu, Vincent F.
    Lin, Shih-Wei
    Lee, Wenyih
    Ting, Ching-Jung
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (02) : 288 - 299
  • [44] A tabu search heuristic for the capacitated arc routing problem
    Hertz, A
    Laporte, G
    Mittaz, M
    [J]. OPERATIONS RESEARCH, 2000, 48 (01) : 129 - 135
  • [45] A Hybrid Heuristic for the Probabilistic Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints
    Mahfoudh, Soumaya Sassi
    Bellalouna, Monia
    [J]. COMPUTATIONAL SCIENCE - ICCS 2018, PT III, 2018, 10862 : 241 - 253
  • [46] A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
    Hongtao Lei
    Gilbert Laporte
    Bo Guo
    [J]. TOP, 2012, 20 : 99 - 118
  • [47] A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
    Lei, Hongtao
    Laporte, Gilbert
    Guo, Bo
    [J]. TOP, 2012, 20 (01) : 99 - 118
  • [48] A Two-stage Selection Hyper-heuristic Algorithm for the Capacitated Vehicle Routing Problem
    Hou, Yan-e
    He, Wenwen
    Wang, Congran
    Ren, Xinhui
    [J]. IAENG International Journal of Applied Mathematics, 2022, 52 (04)
  • [49] A POPMUSIC matheuristic for the capacitated vehicle routing problem
    Queiroga, Eduardo
    Sadykov, Ruslan
    Uchoa, Eduardo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 136
  • [50] Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements
    Filipec, M.
    Škrlec, D.
    Krajcar, S.
    [J]. International Journal of Modelling and Simulation, 2000, 20 (04): : 320 - 328
12345