Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows

DOI10.1057/JORS.1993.53zbMath0771.90033OpenAlexW2017413817MaRDI QIDQ5287232

Nagraj Balakrishnan

Publication date: 16 August 1993

Published in: 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

heuristicslogisticsvehicle routeingtransporationcustomer time windows

Mathematics Subject Classification ID

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

Related Items (27)

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

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