A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem

DOI10.1007/s10100-015-0419-2zbMath1364.90367OpenAlexW2188737891MaRDI QIDQ2358180

Zoltán Imre Fajfrik, Zoltán L. Blázsik

Publication date: 21 June 2017

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-015-0419-2

zbMATH Keywords

TSPcombinatorial optimizationlocal searchHPPITLOPstochastic Hill climbing and simulated annealing algorithmsVRP problemsVRPIT

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Uses Software

• VRP

Cites Work

• VRP
• A survey of very large-scale neighborhood search techniques
• Heuristic algorithms for a complex parallel machine scheduling problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• The traveling salesman problem and its variations
• The linear ordering problem: instances, search space analysis and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item