A hybrid genetic algorithm for the multi-depot open vehicle routing problem
From MaRDI portal
Publication:2454370
DOI10.1007/s00291-012-0289-0zbMath1290.90040OpenAlexW2008717124MaRDI QIDQ2454370
Na Geng, Zhibin Jiang, Ran Liu
Publication date: 13 June 2014
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-012-0289-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (8)
Genetic algorithms in supply chain management: a critical analysis of the literature ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ Mathematical formulations and improvements for the multi-depot open vehicle routing problem ⋮ An improved formulation for the multi-depot open vehicle routing problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform
Uses Software
Cites Work
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A tabu search algorithm for the open vehicle routing problem
- Applying the model driven generative domain engineering method to develop self-organizing architectural solutions for mobile robot
- A general heuristic for vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- An ILP improvement procedure for the open vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- A tabu search heuristic for the multi-depot vehicle routing problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- Integrating multi-product production and distribution in newspaper logistics
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- The Truck Dispatching Problem
- A heuristic method for the open vehicle routing problem
- Integer Programming Formulation of Traveling Salesman Problems
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Genetic Algorithms
- A new tabu search heuristic for the open vehicle routing problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The open vehicle routing problem with time windows
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
This page was built for publication: A hybrid genetic algorithm for the multi-depot open vehicle routing problem
