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.050zbMATH Open1319.90015OpenAlexW2014700678MaRDI QIDQ491075FDOQ491075
Authors: Juan Antonio Sicilia, Carlos Quemada, Beatriz Royo, David Escuín 
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
Recommendations
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A hybrid evolution strategy for the open vehicle routing problem
- A multi-start local search algorithm for the vehicle routing problem with time windows
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- An evolutionary algorithm for the vehicle routing problem with route balancing
- An Exchange Heuristic for Routeing Problems with Time Windows
- Variable neighborhood search: Principles and applications
- Solving a rich vehicle routing and inventory problem using column generation
- On the convergence of a damped secant method with modified right-hand side vector
- Rich vehicle routing problems: from a taxonomy to a definition
- Real qualitative behavior of a fourth-order family of iterative methods by using the convergence plane
- A column generation approach for a multi-attribute vehicle routing problem
- General variable neighborhood search for the continuous optimization
- Title not available (Why is that?)
- A new fourth-order family for solving nonlinear problems and its dynamics
Cited In (7)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Extending the applicability of the local and semilocal convergence of Newton's method
- Mixed-model assembly line balancing problem considering learning effect and uncertain demand
- Local convergence and the dynamics of a two-point four parameter Jarratt-like method under weak conditions
- A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems
- Editorial: Mathematical modeling and computational methods
- A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491075)
