Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network

DOI10.1007/s10479-017-2730-xzbMath1390.90368OpenAlexW2774042751MaRDI QIDQ1639274

Sungsoo Park, Chungmok Lee, Ji Young Choi

Publication date: 12 June 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2730-x

zbMATH Keywords

column generationdemand uncertaintyhybrid hub-and-spokevehicle assignment problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Related Items (3)

Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Stochastic uncapacitated hub location
• Hierarchical facility network planning model for global logistics network configurations
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A metaheuristic for stochastic service network design
• Stochastic air freight hub location and flight routes planning
• The stochastic \(p\)-hub center problem with service-level constraints
• The tree of hubs location problem
• A quadratic integer program for the location of interacting hub facilities
• Integer programming formulations of discrete hub location problems
• An application of genetic and tabu searches to the freight railroad operating plan problem
• The hub location and routing problem
• Location models for airline hubs behaving as \(M/D/c\) queues.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• Service network design for freight transportation: a review
• Network hub location problems: The state of the art
• A stochastic programming approach for supply chain network design under uncertainty
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Introduction to Stochastic Programming
• Decomposition Principle for Linear Programs
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• Column Generation
• Selected Topics in Column Generation
• Direct shipping logistic planning for a hub‐and‐spoke network with given discrete intershipment times
• Implementing Mixed Integer Column Generation

This page was built for publication: Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network