Vehicle routing problem with time windows and a limited number of vehicles.

DOI10.1016/S0377-2217(02)00363-6zbMath1035.90014MaRDI QIDQ1812003

Hoong Chuin Lau, Melvyn Sim, Kwong Meng Teo

Publication date: 18 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

HeuristicsRoutingTabu searchCombinatorial optimizationVehicle routingproblem with time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items

Satisficing measure approach for vehicle routing problem with time windows under uncertainty ⋮ Thirty years of heterogeneous vehicle routing ⋮ Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints ⋮ A note on the time travel approach for handling time windows in vehicle routing problems ⋮ An adaptive large neighborhood search for a vehicle routing problem with multiple routes ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows ⋮ Solving the tractor and semi-trailer routing problem based on a heuristic approach ⋮ A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ Flexible lease contracts in the fleet replacement problem with alternative fuel vehicles: a real-options approach ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ A risk management system for sustainable fleet replacement ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Strong Coalitional Structure in an Open Vehicle Routing Game ⋮ Exact and hybrid methods for the multiperiod field service routing problem ⋮ An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations ⋮ Heuristic algorithms for a complex parallel machine scheduling problem ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows

Cites Work

• A parallel algorithm for the vehicle routing problem with time window constraints
• A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
• Lifting valid inequalities for the precedence constrained knapsack problem
• Parallelization of a two-phase metaheuristic for routing problems with time windows
• A constraint programming framework for local search methods
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Solving vehicle routing problems using constraint programming and metaheuristics
• Using constraint-based operators to solve the vehicle routing problem with time windows