The vehicle routing problem with flexible time windows and traveling times

DOI10.1016/J.DAM.2006.04.009zbMath1130.90053OpenAlexW2029399988MaRDI QIDQ860386

Mutsunori Yagiura, Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.009

zbMATH Keywords

dynamic programminglocal searchvehicle routing problemflexible traveling timegeneral time windows

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (19)

Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network ⋮ A vehicle routing problem with flexible time windows ⋮ The flexible periodic vehicle routing problem ⋮ Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution ⋮ Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ A personal perspective on problem solving by general purpose solvers ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Home service routing and appointment scheduling with stochastic service times ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ Finding least fuel emission paths in a network with time-varying speeds ⋮ Heuristic algorithms for a complex parallel machine scheduling problem ⋮ Transshipment service through crossdocks with both soft and hard time windows ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-phase hybrid metaheuristic for the vehicle routing problem 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
• Solving the Convex Cost Integer Dual Network Flow Problem
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft 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
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Computer Solutions of the Traveling Salesman Problem
• Discrete Optimizing
• Using constraint-based operators to solve the vehicle routing problem with time windows
• A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows

This page was built for publication: The vehicle routing problem with flexible time windows and traveling times