Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
From MaRDI portal
Publication:5287232
DOI10.1057/JORS.1993.53zbMATH Open0771.90033OpenAlexW2017413817MaRDI QIDQ5287232FDOQ5287232
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
Recommendations
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)
Cited In (29)
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
- A column generation algorithm for the vehicle routing problem with soft time windows
- Minimization of travel time and weighted number of stops in a traffic-light network
- 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
- Shipping problems with body clock constraints.
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Finding the \(K\) shortest paths in a schedule-based transit network
- Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
- Ship scheduling with soft time windows: An optimisation based approach
- A vehicle routing problem with flexible time windows
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- 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
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Simultaneously scheduling multiple turns for steel color-coating production
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Vehicle routing problem with fuzzy time windows
- Vehicle routing with soft time windows and Erlang travel times
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- Finding the first \(K\) shortest paths in a time-window network.
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
- Exact algorithms for the vehicle routing problem with soft time windows
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- A heuristic algorithm for the multi-depot periodic vehicle routing problem
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)
