An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
From MaRDI portal
Publication:943841
DOI10.1016/j.dam.2007.04.022zbMath1153.90446OpenAlexW2020270411MaRDI QIDQ943841
Koji Nonobe, Toshihide Ibaraki, Takeaki Uno, Mutsunori Yagiura, Kensuke Sobue, Shinji Imahori
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.022
Search theory (90B40) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Related Items
Branch-and-price and constraint programming for solving a real-life technician dispatching problem, An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, The time-dependent capacitated profitable tour problem with time windows and precedence constraints, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, Designing granular solution methods for routing problems with time windows, The Vehicle Routing Problem with Release and Due Dates, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A personal perspective on problem solving by general purpose solvers, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, A metaheuristic for the delivery man problem with time windows, A powerful route minimization heuristic for the vehicle routing problem with time windows, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- The vehicle routing problem with flexible time windows and traveling times
- The vehicle routing problem with backhauls
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A multi-start local search algorithm for the vehicle routing problem 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 Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Minimizing a Convex Cost Closure Set
- Single-machine scheduling with early and tardy completion costs
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
