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.010zbMath1348.90069OpenAlexW2155293443MaRDI QIDQ337225
Pierre Hansen, Slim Belhaiza, Gilbert 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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem, A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint, Bi-objective orienteering for personal activity scheduling, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, Delivery route optimization with automated vehicle in smart urban environment, Variable neighborhood search: the power of change and simplicity, Variable neighborhood search: basics and variants, Vehicle routing with arrival time diversification, Competition and Cooperation in Pickup and Multiple Delivery Problems, The incremental cooperative design of preventive healthcare networks, Product-oriented time window assignment for a multi-compartment vehicle routing problem, A heuristic approach to solve the preventive health care problem with budget and congestion constraints, Dynamic pricing of flexible time slots for attended home delivery, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, Branch-price-and-cut for the mixed capacitated general routing problem with time windows, Variable neighborhood search for vehicle routing problem with multiple time windows, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints, Synchronous routing for personal rapid transit pods, Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
Cites Work
- Unnamed Item
- Variable neighborhood search for location routing
- Packing unit spheres into the smallest sphere using VNS and NLP
- Heuristics for the multi-period orienteering problem with multiple time windows
- Variable neighborhood search
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- A tabu search heuristic and adaptive memory procedure for political districting
- Probabilistic diversification and intensification in local search for vehicle routing
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Ant colony system for a VRP with multiple time windows and multiple visits
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Fast Local Searches For The Vehicle Routing Problem With Time Windows
