A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

DOI10.1007/S10951-013-0317-1MaRDI QIDQ490359zbMATH OpenOpenAlexFDO

Authors Lavanya Marla, Cynthia Barnhart, Varun Biyani

Publication date 22 January 2015

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

Full work available at URL http://hdl.handle.net/1721.1/89058

zbMATH Keywords

uncertaintydecompositionmulti-commodity routing and schedulingrobust routing and scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• A probabilistic approach to pickup and delivery problems with time window uncertainty
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
• The multi-pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and handling operations
• The Pickup And Delivery Problem With Time Windows And Transshipment
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• A study on the pickup and delivery problem with time windows: matheuristics and new instances
• Pickup and delivery problem with time windows: a new compact two-index formulation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• An algorithm for finding a maximum clique in a graph
• Branch-and-price: Column generation for solving huge integer programs
• Chance-constrained programming
• Depth-First Search and Linear Graph Algorithms
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Introduction to Stochastic Programming
• Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
• Network flows. Theory, algorithms, and applications.
• On finding the strongly connected components in a directed graph
• Robust Capacity Planning Under Uncertainty
• Robust capacity expansion of network flows
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust solutions of uncertain linear programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Price of Robustness
• The pickup and delivery problem with time windows
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks

This page was built for publication: A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490359)