A reduction approach to the two-campus transport problem

DOI10.1007/s10951-013-0348-7zbMath1305.90058MaRDI QIDQ490382

Aviad Belulu, Alex Fainberg, Tal Grinshpoun, Hagai Ilani, Elad Shufan

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0348-7

zbMATH Keywords

optimal partition; DARP; transportation scheduling

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

Graph representation of the fixed route dial-a-ride problem, A reduction approach to the two-campus transport problem, Minimizing the waiting time for a one-way shuttle service

Uses Software

• DARCLASS

Cites Work

• A note on two problems in connexion with graphs
• A new approach to solve open-partition problems
• A reduction approach to the two-campus transport problem
• The vehicle routing problem. Latest advances and new challenges.
• Shortest paths algorithms: Theory and experimental evaluation
• The dial-a-ride problem: Models and algorithms
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• On a routing problem
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment