A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
From MaRDI portal
(Redirected from Publication:1806612)
Recommendations
- A parallel algorithm for the vehicle routing problem with time window constraints
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
Cites work
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A GRASP for the Vehicle Routing Problem with Time Windows
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exchange Heuristic for Routeing Problems with Time Windows
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Vehicle Routing with Time Windows
- Vehicle Routing with Time Windows: Two Optimization Algorithms
Cited in
(18)- Routing relatively few customers per route
- A hybrid evolution strategy for the open vehicle routing problem
- A mixed constrained (identical) vehicle routing problem for time minimisation
- Towards a decision support system for the ready concrete distribution system: a case of a Greek company.
- A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows
- A multi-start local search algorithm for the vehicle routing problem with time windows
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- An adaptive evolutionary approach for real-time vehicle routing and dispatching
- An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics
- An evolutionary approach for the target search problem in uncertain environment
- A TABU search heuristic for the team orienteering problem
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- Optimal routing of multimodal mobility systems with ride‐sharing
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
This page was built for publication: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806612)
