GRASP with a new local search scheme for vehicle routing problems with time windows

DOI10.1023/A:1024427114516zbMath1035.90005OpenAlexW128012411MaRDI QIDQ1402538

Dukwon Kim, Panos M. Pardalos, Wanpracha Art Chaovalitwongse

Publication date: 28 August 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024427114516

zbMATH Keywords

local searchgreedy randomized adaptive search procedurevehicle routing with time windows

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items (9)

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ Shortest path problems with left-side time windows ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Best routes selection in multimodal networks using multi-objective genetic algorithm ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Simulation on vehicle routing problems in logistics distribution ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows

This page was built for publication: GRASP with a new local search scheme for vehicle routing problems with time windows