A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
From MaRDI portal
Publication:1014948
DOI10.1016/j.ejor.2008.07.022zbMath1159.90525OpenAlexW2077736738MaRDI QIDQ1014948
Said Salhi, Niaz A. Wassan, Arif Imran
Publication date: 30 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/25482/1/Ejor-Arifetal_final___3__Web_Version.pdf
Related Items
Simple heuristics for the multi-period fleet size and mix vehicle routing problem ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A heuristic approach for a real-world electric vehicle routing problem ⋮ Modified differential evolution algorithms for multi-vehicle allocation and route optimization for employee transportation ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Thirty years of heterogeneous vehicle routing ⋮ An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints ⋮ An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Two level general variable neighborhood search for attractive traveling salesman problem ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem ⋮ A hybrid algorithm for the heterogeneous fleet vehicle routing problem ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Adapting derivative free optimization methods to engineering models with discrete variables ⋮ A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles ⋮ Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ Securing home health care in times of natural disasters ⋮ A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ A hierarchical algorithm for the planar single-facility location routing problem ⋮ Variable neighbourhood search: methods and applications ⋮ Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ Variable neighbourhood search: Methods and applications ⋮ Less is more approach in optimization: a road to artificial intelligence ⋮ A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
Cites Work
- A note on two problems in connexion with graphs
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- A column generation approach to the heterogeneous fleet vehicle routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- The fleet size and mix problem for capacitated arc routing
- The fleet size and mix vehicle routing problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- Variable neighborhood search
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A new heuristic for the fleet size and mix vehicle routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- The fleet size and mix vehicle routing problem with time windows
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Variable Neighborhood Search
- A heuristic column generation method for the heterogeneous fleet VRP
- Tabu search variants for the mix fleet vehicle routing problem
- New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
- A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Extensions of the Petal Method for Vehicle Routeing
- A heuristic for vehicle fleet mix problem using tabu search and set partitioning
- Computer Solutions of the Traveling Salesman Problem
