Management Policies in a Dynamic Multi Period Routing Problem

DOI10.1007/978-3-540-92944-4_1zbMath1178.90031OpenAlexW2149120241MaRDI QIDQ5850922

No author found.

Publication date: 20 January 2010

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92944-4_1

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework

Cites Work

• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Dynamic vehicle routing: Status and prospects
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Drive: Dynamic Routing of Independent Vehicles
• Diversion Issues in Real-Time Vehicle Dispatching
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Competitive analysis for dynamic multiperiod uncapacitated routing problems

This page was built for publication: Management Policies in a Dynamic Multi Period Routing Problem