Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

From MaRDI portal
Publication:4661048


DOI10.1057/palgrave.jors.2601707zbMath1060.90019MaRDI QIDQ4661048

Jean-François Cordeau, Gilbert Laporte, Anne Mercier

Publication date: 4 April 2005

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

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


90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming


Related Items

Multi-depot vehicle routing problem with time windows under shared depot resources, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, On service consistency in multi-period vehicle routing, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, The linehaul-feeder vehicle routing problem with virtual depots and time windows, Cargo scheduling decision support for offshore oil and gas production: a case study, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, Resource constrained routing and scheduling: review and research prospects, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows, Models and algorithms for the delivery and installation routing problem, A vehicle routing problem with distribution uncertainty in deadlines, A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction, Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers, A unified solution framework for multi-attribute vehicle routing problems, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Routing and scheduling field service operation by P-graph