An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics
DOI10.1016/j.cam.2015.03.050zbMath1319.90015OpenAlexW2014700678MaRDI QIDQ491075
Beatriz Royo, Carlos Quemada, David Escuín, Juan Antonio Sicilia
Publication date: 24 August 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.03.050
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- On the convergence of a damped secant method with modified right-hand side vector
- Rich vehicle routing problems: from a taxonomy to a definition
- General variable neighborhood search for the continuous optimization
- A hybrid evolution strategy for the open vehicle routing problem
- A multi-start local search algorithm for the vehicle routing problem with time windows
- Real qualitative behavior of a fourth-order family of iterative methods by using the convergence plane
- A new fourth-order family for solving nonlinear problems and its dynamics
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- An evolutionary algorithm for the vehicle routing problem with route balancing
- A column generation approach for a multi-attribute vehicle routing problem
- Solving a rich vehicle routing and inventory problem using column generation
- An Exchange Heuristic for Routeing Problems with Time Windows
- Variable neighborhood search: Principles and applications
This page was built for publication: An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics