Parcel Distribution Timetabling Problem with Incomplete Hub Network

DOI10.3138/infor.52.4.174OpenAlexW2268007735MaRDI QIDQ6160431

Salem Hamzaoui, Unnamed Author, Belaïd Aouni, Omar Ben-Ayed

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.52.4.174

zbMATH Keywords

transportationtimetablingperiodic schedulingservice network designincomplete hub networktransit hub

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Automated or manual storage systems: do throughput and storage capacity matter?

Cites Work

• An experimental comparison of periodic timetabling models
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Planning models for freight transportation
• Service network design in freight transportation
• Planning models for long-haul operations of postal and express shipment companies
• Nominal and robust train timetabling problems
• Service network design for freight transportation: a review
• Multiobjective multiproduct parcel distribution timetabling: a real-world application
• The Latest Arrival Hub Location Problem
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• A hub covering model for cargo delivery systems
• A Mathematical Model for Periodic Scheduling Problems

This page was built for publication: Parcel Distribution Timetabling Problem with Incomplete Hub Network