Related references
Note: Only part of the references are listed.An improved learnable evolution model for solving multi-objective vehicle routing problem with stochastic demand
Yunyun Niu et al.
KNOWLEDGE-BASED SYSTEMS (2021)
Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows
Yong Wang et al.
KNOWLEDGE-BASED SYSTEMS (2021)
Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows
Senyan Yang et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2020)
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty
Lei Wu et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2020)
Optimizing resource recharging location-routing plans: A resource-space-time network modeling framework for railway locomotive refueling applications
Gongyuan Lu et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2019)
ADMM-based problem decomposition scheme for vehicle routing problem with time windows
Yu Yao et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking
Huimin Niu et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2018)
Lagrangian relaxation for the reliable shortest path problem with correlated link travel times
Yuli Zhang et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)
A new robust criterion for the vehicle routing problem with uncertain travel time
Lei Wu et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2017)
A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
F. Errico et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations
Monirehalsadat Mahmoudi et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2016)
Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines
Yossiri Adulyasak et al.
TRANSPORTATION SCIENCE (2016)
Future Research Directions in Stochastic Vehicle Routing
Michel Gendreau et al.
TRANSPORTATION SCIENCE (2016)
An exact algorithm for the mean-standard deviation shortest path problem
Alireza Khani et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2015)
Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem
Lixing Yang et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2014)
Some extensions to the sweep algorithm
Byungsoo Na et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2011)
Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach
Tao Xing et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2011)
Vehicle routing with stochastic time-dependent travel times
C. Lecluyse et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2009)
A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand
Hu Shao et al.
NETWORKS & SPATIAL ECONOMICS (2006)
Lagrangian duality applied to the vehicle routing problem with time windows
B Kallehauge et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
IK Altinel et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2005)
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
K Holmberg et al.
OPERATIONS RESEARCH (2000)
Share Paper
