Competitive analysis for dynamic multiperiod uncapacitated routing problems
From MaRDI portal
Publication:5295487
DOI10.1002/net.20180zbMath1141.90334OpenAlexW4237867379MaRDI QIDQ5295487
Enrico Angelelli, Savelsbergh, Martin W. P., Maria Grazia Speranza
Publication date: 30 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20180
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
The dynamic multiperiod vehicle routing problem with probabilistic information, A branch-and-price approach for a multi-period vehicle routing problem, The Post-Disaster Debris Clearance Problem Under Incomplete Information, A multi-shift vehicle routing problem with windows and cycle times, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, A dynamic multi-period general routing problem arising in postal service and parcel delivery systems, Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs, Dynamic multi-period vehicle routing with touting, Essential particle swarm optimization queen with tabu search for MKP resolution, Competitive analysis of a dispatch policy for a dynamic multi-period routing problem, Recent Developments in Dynamic Vehicle Routing Systems, Online Vehicle Routing Problems: A Survey, Algorithms for on-line order batching in an order picking warehouse, Clever or smart: strategies for the online target date assignment problem, The dynamic multi-period vehicle routing problem, The dynamic dispatch waves problem for same-day delivery, Online traveling salesman problems with service flexibility, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, Management Policies in a Dynamic Multi Period Routing Problem
