A unified tabu search algorithm for vehicle routing problems with soft time windows
From MaRDI portal
Publication:5387405
DOI10.1057/palgrave.jors.2602371zbMath1153.90357OpenAlexW2139613025MaRDI QIDQ5387405
Leon Li, Zhuo Fu, Richard W. Eglese
Publication date: 9 May 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45023/1/10.pdf
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (10)
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ A vehicle routing problem with flexible time windows ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ Vehicle routing with arrival time diversification ⋮ The Vehicle Routing Problem with Release and Due Dates ⋮ 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 ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows
This page was built for publication: A unified tabu search algorithm for vehicle routing problems with soft time windows
