Recent progress of local search in handling the time window constraints of the vehicle routing problem
From MaRDI portal
Publication:5919996
DOI10.1007/s10479-012-1264-5zbMath1269.90012MaRDI QIDQ5919996
Shinji Imahori, Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura
Publication date: 8 August 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1264-5
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Multi-depot vehicle routing problem with time windows under shared depot resources, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience, Ensuring service levels in routing problems with time windows and stochastic travel times
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A column generation algorithm for the vehicle routing problem with soft time windows
- Active set algorithms for isotonic regression; a unifying framework
- The vehicle routing problem with flexible time windows and traveling times
- A general heuristic for vehicle routing problems
- An improved earliness--tardiness timing algorithm
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- An iterated local search algorithm for the time-dependent vehicle routing 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
- Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
- Optimal timing of a sequence of tasks with general completion costs
- Vehicle dispatching with time-dependent travel times
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Fast local search algorithms for the handicapped persons transportation problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains 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
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Minimizing a Convex Cost Closure Set
- A metaheuristic for the vehicle-routeing problem with soft time windows
- Single-machine scheduling with early and tardy completion costs
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- Computer Solutions of the Traveling Salesman Problem
- Discrete Optimizing
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
