Active guided evolution strategies for large-scale vehicle routing problems with time windows
From MaRDI portal
Publication:1764768
DOI10.1016/j.cor.2003.11.017zbMath1122.90403OpenAlexW2024061864WikidataQ110037574 ScholiaQ110037574MaRDI QIDQ1764768
Publication date: 22 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.017
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (max. 100)
Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm ⋮ Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ Large-scale vehicle routing problems: quantum annealing, tunings and results ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows ⋮ A general heuristic for vehicle routing problems ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ The close-open mixed vehicle routing problem ⋮ Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem ⋮ Designing granular solution methods for routing problems with time windows ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results ⋮ Fast and high precision algorithms for optimization in large-scale genomic problems ⋮ Path relinking for the vehicle routing problem ⋮ A library of local search heuristics for the vehicle routing problem ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ A vehicle routing problem with distribution uncertainty in deadlines ⋮ Transport clustering and routing as a visual meshing process ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A parallel algorithm for the vehicle routing problem with time window constraints
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Variable neighborhood search
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- Guided local search and its application to the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Heuristics for large constrained vehicle routing problems
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Record breaking optimization results using the ruin and recreate principle
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A greedy look-ahead heuristic for the vehicle routing problem with time windows
- A unified tabu search heuristic for vehicle routing problems with time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- A heuristic for the vehicle routing problem with time windows
- Using constraint-based operators to solve the vehicle routing problem with time windows
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
This page was built for publication: Active guided evolution strategies for large-scale vehicle routing problems with time windows
