An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
From MaRDI portal
Publication:951117
DOI10.1016/j.disopt.2007.05.004zbMath1169.90326OpenAlexW2167218946MaRDI QIDQ951117
Mutsunori Yagiura, Toshihide Ibaraki, Hideki Hashimoto
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2007.05.004
dynamic programmingmetaheuristicslocal searchvehicle routing problemgeneral time windowstime-dependent traveling time and cost
Related Items
A priority-based genetic algorithm for a flexible job shop scheduling problem, The time-dependent shortest path and vehicle routing problem, Iterated local search for the team orienteering problem with time windows, Scheduling activities with time-dependent durations and resource consumptions, The vehicle-routing problem with time windows and driver-specific times, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Time-dependent routing problems: a review, The time-dependent orienteering problem with time windows: a fast ant colony system, Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Designing granular solution methods for routing problems with time windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Electric vehicle routing problem with time-dependent waiting times at recharging stations, A personal perspective on problem solving by general purpose solvers, Solving the stochastic time-dependent orienteering problem with time windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Vehicle routing under time-dependent travel times: the impact of congestion avoidance, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, A hybrid algorithm for time-dependent vehicle routing problem with time windows, A unified solution framework for multi-attribute vehicle routing problems, A simheuristic algorithm for time-dependent waste collection management with stochastic travel times, An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem, The time-dependent rural postman problem: polyhedral results, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Fleet routing position-based model for inventory pickup under production shutdown, Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- Local search with annealing-like restarts to solve the VRPTW
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- Vehicle dispatching with time-dependent travel times
- 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
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- 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
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- 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
- Solution of a Large-Scale Traveling-Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Discrete Optimizing
- 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
