相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
Michiel A. J. Uit Het Broek et al.
OPERATIONS RESEARCH (2021)
A generic exact solver for vehicle routing and related problems
Artur Pessoa et al.
MATHEMATICAL PROGRAMMING (2020)
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons
Tolga Bektas et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
Nicola Bianchessi et al.
TRANSPORTATION SCIENCE (2019)
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time windows
Nicola Bianchessi et al.
TRANSPORTATION SCIENCE (2019)
The Shared Customer Collaboration Vehicle Routing Problem
Elena Fernandez et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
New exact solution approaches for the split delivery vehicle routing problem
Gizem Ozbaygin et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2018)
A novel approach to solve the split delivery vehicle routing problem
Ping Chen et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2017)
New path elimination constraints for multi-depot routing problems
Tolga Bektas et al.
NETWORKS (2017)
An iterated local search heuristic for the split delivery vehicle routing problem
Marcos Melo Silva et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
Branch-and-cut algorithms for the split delivery vehicle routing problem
Claudia Archetti et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
The multi-depot split-delivery vehicle routing problem: Model and solution algorithm
Sujoy Ray et al.
KNOWLEDGE-BASED SYSTEMS (2014)
Multi-depot Multiple TSP: a polyhedral study and computational results
Enrique Benavent et al.
ANNALS OF OPERATIONS RESEARCH (2013)
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Claudia Bode et al.
OPERATIONS RESEARCH (2012)
The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results
Damon Gulczynski et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2011)
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Jose-Manuel Belenguer et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
A Column Generation Approach for the Split Delivery Vehicle Routing Problem
C. Archetti et al.
NETWORKS (2011)
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics
Guido Perboli et al.
TRANSPORTATION SCIENCE (2011)
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Guy Desaulniers
OPERATIONS RESEARCH (2010)
Improved lower bounds for the Split Delivery Vehicle Routing Problem
Lorenza Moreno et al.
OPERATIONS RESEARCH LETTERS (2010)
A unified exact method for solving different classes of vehicle routing problems
Roberto Baldacci et al.
MATHEMATICAL PROGRAMMING (2009)
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
Stefan Ropke et al.
TRANSPORTATION SCIENCE (2006)
Worst-case analysis for split delivery vehicle routing problems
C Archetti et al.
TRANSPORTATION SCIENCE (2006)
A tabu search algorithm for the split delivery vehicle routing problem
C Archetti et al.
TRANSPORTATION SCIENCE (2006)
A new branch-and-cut algorithm for the capacitated vehicle routing problem
J Lysgaard et al.
MATHEMATICAL PROGRAMMING (2004)
A cutting plane algorithm for the capacitated arc routing problem
JM Belenguer et al.
COMPUTERS & OPERATIONS RESEARCH (2003)
A lower bound for the split delivery vehicle routing problem
JM Belenguer et al.
OPERATIONS RESEARCH (2000)
分享论文
