A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
From MaRDI portal
Publication:337225
DOI10.1016/J.COR.2013.08.010zbMATH Open1348.90069OpenAlexW2155293443MaRDI QIDQ337225FDOQ337225
Authors: Slim Belhaiza, Pierre Hansen, G. Laporte 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.010
Recommendations
- Variable neighborhood search for vehicle routing problem with multiple time windows
- Tabu search algorithm for the vehicle routing problem with time windows and multiple delivery men
- Publication:4944279
- Modeling and solving for vehicle routing problem with multiple time windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A tabu search heuristic and adaptive memory procedure for political districting
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Variable neighborhood search
- Heuristics for the multi-period orienteering problem with multiple time windows
- Variable neighborhood search for location routing
- Probabilistic diversification and intensification in local search for vehicle routing
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Packing unit spheres into the smallest sphere using VNS and NLP
- Ant colony system for a VRP with multiple time windows and multiple visits
- Title not available (Why is that?)
- Fast Local Searches For The Vehicle Routing Problem With Time Windows
Cited In (28)
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities
- Modeling and solving for vehicle routing problem with multiple time windows
- Variable neighborhood search for vehicle routing problem with multiple time windows
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- The incremental cooperative design of preventive healthcare networks
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints
- Variable neighborhood search: the power of change and simplicity
- A new algorithm for vehicle routing problem with time windows and a limited number of vehicles
- Competition and cooperation in pickup and multiple delivery problems
- Dynamic pricing of flexible time slots for attended home delivery
- A multi-start local search algorithm for the vehicle routing problem with time windows
- Bi-objective orienteering for personal activity scheduling
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- Variable neighborhood search: basics and variants
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint
- Optimization model for a production, inventory, distribution and routing problem in small furniture companies
- Synchronous routing for personal rapid transit pods
- A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows
- An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics
- Tabu search algorithm for the vehicle routing problem with time windows and multiple delivery men
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- Delivery route optimization with automated vehicle in smart urban environment
- A heuristic approach to solve the preventive health care problem with budget and congestion constraints
- Vehicle routing with arrival time diversification
This page was built for publication: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337225)
