Planning models for long-haul operations of postal and express shipment companies
From MaRDI portal
Publication:1582188
DOI10.1016/S0377-2217(99)00234-9zbMath0961.90007MaRDI QIDQ1582188
Hans-Jürgen Sebastian, Tore Grünert
Publication date: 3 October 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (21)
Hub location problems with price sensitive demands ⋮ Zone pricing for time-definite LTL freight transportation with elastic demand ⋮ Optimal quoting of delivery time by a third party logistics provider: the impact of shipment consolidation and temporal pricing schemes ⋮ Multi-period single-allocation hub location-routing: models and heuristic solutions ⋮ Parcel Distribution Timetabling Problem with Incomplete Hub Network ⋮ Models for the single-vehicle preemptive pickup and delivery problem ⋮ Optimization of logistics services in hospitals ⋮ Operational planning of a large-scale multi-modal transportation system. ⋮ Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions ⋮ Steiner diagrams and \(k\)-star hubs ⋮ Service network design for freight transportation: a review ⋮ New mixed integer-programming model for the pickup-and-delivery problem with transshipment ⋮ A metaheuristic for stochastic service network design ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ An integrated and dynamic optimisation model for the multi-level emergency logistics network in anti-bioterrorism system ⋮ Service network design in freight transportation ⋮ Solution techniques for the inter-modal pickup and delivery problem in two regions ⋮ The single-node dynamic service scheduling and dispatching problem ⋮ Multiobjective multiproduct parcel distribution timetabling: a real-world application ⋮ CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of heuristics and relaxations for the capacitated plant location problem
- An algorithm for solving large capacitated warehouse location problems
- The pickup and delivery problem with time windows
- The vehicle routing problem: An overview of exact and approximate algorithms
- Planning models for freight transportation
- Service network design in freight transportation
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Drive: Dynamic Routing of Independent Vehicles
- Decomposition Principle for Linear Programs
- Optimal Routing under Capacity and Distance Restrictions
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Subgradient Methods for the Service Network Design Problem
- Air Network Design for Express Shipment Service
- The General Pickup and Delivery Problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: Planning models for long-haul operations of postal and express shipment companies
