A variable neighbourhood search algorithm for the open vehicle routing problem
From MaRDI portal
Publication:2378421
DOI10.1016/j.ejor.2007.06.064zbMath1155.90323OpenAlexW1997768424MaRDI QIDQ2378421
Krzysztof Fleszar, Khalil S. Hindi, Ibrahim. H Osman
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.064
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)
Related Items
A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Dynamic vehicle routing using an improved variable neighborhood search algorithm, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, A hybrid algorithm for a class of vehicle routing problems, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, A simulated annealing heuristic for the open location-routing problem, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, The close-open mixed vehicle routing problem, The open vehicle routing problem with decoupling points, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, The probabilistic uncapacitated open vehicle routing location problem, A post-improvement procedure for the mixed load school bus routing problem, An Investigation on Compound Neighborhoods for VRPTW, Securing home health care in times of natural disasters, A hybrid genetic algorithm for the multi-depot open vehicle routing problem, Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems, Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics, Variable neighbourhood search: methods and applications, An ILP improvement procedure for the open vehicle routing problem, Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning, Single-commodity vehicle routing problem with pickup and delivery service, A hybrid evolution strategy for the open vehicle routing problem, A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows, The school bus routing problem: a review, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods, A multi-objective combinatorial model of casualty processing in major incident response, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A tabu search algorithm for the open vehicle routing problem
- A general heuristic for vehicle routing problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- An effective VNS for the capacitated \(p\)-median problem
- Variable neighborhood search
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- A heuristic method for the open vehicle routing problem
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A new tabu search heuristic for the open vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- Adaptive search for solving hard project scheduling problems
- New heuristics for one-dimensional bin-packing
