Competitive analysis for dynamic multiperiod uncapacitated routing problems

DOI10.1002/NET.20180MaRDI QIDQ5295487zbMATH OpenOpenAlexFDO

Authors Enrico Angelelli, Martin W. P. Savelsbergh, 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

zbMATH Keywords

competitive analysisdispatch policiesdynamic vehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• The dynamic multi-period vehicle routing problem
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Management policies in a dynamic multi period routing problem
• Robust multiperiod vehicle routing under customer order uncertainty

Cited in

(21)

• Algorithms for on-line order batching in an order picking warehouse
• The dynamic multi-period vehicle routing problem
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
• Online traveling salesman problems with service flexibility
• The post-disaster debris clearance problem under incomplete information
• The dynamic multiperiod vehicle routing problem with probabilistic information
• A branch-and-price approach for a multi-period vehicle routing problem
• Recent developments in dynamic vehicle routing systems
• Online Vehicle Routing Problems: A Survey
• 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
• Essential particle swarm optimization queen with tabu search for MKP resolution
• Robust multiperiod vehicle routing under customer order uncertainty
• Management policies in a dynamic multi period routing problem
• Dynamic multi-period vehicle routing with touting
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
• Picking operations in warehouses with dynamically arriving orders: how good is reoptimization?
• Last mile delivery routing problem with some-day option
• The dynamic dispatch waves problem for same-day delivery
• Clever or smart: strategies for the online target date assignment problem

This page was built for publication: Competitive analysis for dynamic multiperiod uncapacitated routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295487)