Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows

DOI10.1057/JORS.1993.53MaRDI QIDQ5287232zbMATH OpenOpenAlexFDO

Authors Nagraj Balakrishnan

Publication date 16 August 1993

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1993.53

zbMATH Keywords

customer time windowsheuristicslogisticstransporationvehicle routeing

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• A heuristic for the vehicle routing problem with time windows

Cited in

(30)

• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• Vehicle routing problem with fuzzy time windows
• Simultaneously scheduling multiple turns for steel color-coating production
• Shipping problems with body clock constraints.
• Finding the first \(K\) shortest paths in a time-window network.
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
• Finding the \(K\) shortest paths in a schedule-based transit network
• Minimization of travel time and weighted number of stops in a traffic-light network
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
• A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• A heuristic algorithm for the multi-depot periodic vehicle routing problem
• Exact algorithms for the vehicle routing problem with soft time windows
• Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
• COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
• A vehicle routing problem with flexible time windows
• Vehicle routing with soft time windows and Erlang travel times
• A column generation algorithm for the vehicle routing problem with soft time windows
• A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Ship scheduling with soft time windows: An optimisation based approach
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
• The service-centric vehicle routing problem with crowdshipping
• A goal programming approach to vehicle routing problems with soft time windows
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows

This page was built for publication: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287232)