MODELING, ANALYSIS, AND EXACT ALGORITHMS FOR SOME BIOMASS LOGISTICS SUPPLY CHAIN DESIGN AND ROUTING PROBLEMS.

[2]  Chang Sup Sung,et al.  A single-product parallel-facilities production-planning model , 1986 .

[3]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

[4]  Nikolaos Papadakos,et al.  Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..

[5]  Sandra Duni Eksioglu,et al.  Analyzing the design and management of biomass-to-biorefinery supply chain , 2009, Comput. Ind. Eng..

[6]  Michel Gendreau,et al.  A branch‐and‐cut algorithm for the preemptive swapping problem , 2012, Networks.

[7]  Hanif D. Sherali,et al.  On generating maximal nondominated Benders cuts , 2013, Ann. Oper. Res..

[8]  Xiaoyan Zhu,et al.  Logistics system design for biomass-to-bioenergy industry with multiple types of feedstocks. , 2011, Bioresource technology.

[9]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[10]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

[11]  Hanif D. Sherali,et al.  New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem , 2011, Optim. Lett..

[12]  Fabien Lehuédé,et al.  The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..

[13]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

[14]  Christos H. Papadimitriou,et al.  The Traveling Salesman Problem with Many Visits to Few Cities , 1984, SIAM J. Comput..

[15]  Bryce J. Stokes,et al.  Biomass as Feedstock for A Bioenergy and Bioproducts Industry: The Technical Feasibility of a Billion-Ton Annual Supply , 2005 .

[16]  Robert D. Grisso,et al.  Harvest schedule to fill storage for year-round delivery of grasses to biorefinery , 2013 .

[17]  A. Schrijver,et al.  The Traveling Salesman Problem , 2011 .

[18]  M. Dror,et al.  Split delivery routing , 1990 .

[19]  Si Chen,et al.  The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results , 2007, Networks.

[20]  Mikhail J. Atallah,et al.  Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel , 1988, SIAM J. Comput..

[21]  Robert D. Grisso,et al.  Harvest Systems and Analysis for Herbaceous Biomass , 2013 .

[22]  Claudia Archetti,et al.  Branch-and-cut algorithms for the split delivery vehicle routing problem , 2014, Eur. J. Oper. Res..

[23]  Alexander Grigoriev,et al.  On the high multiplicity traveling salesman problem , 2006, Discret. Optim..

[24]  Jen S. Shang,et al.  Multicriteria pickup and delivery problem with transfer opportunity , 1996 .

[25]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[26]  Roberto Wolfler Calvo,et al.  A New Heuristic for the Traveling Salesman Problem with Time Windows , 2000, Transp. Sci..

[27]  Jonathan F. Bard,et al.  A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment , 2012, Comput. Oper. Res..

[28]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[29]  Matteo Fischetti,et al.  Exact Methods for the Asymmetric Traveling Salesman Problem , 2007 .

[30]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[31]  W. Zangwill.  A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .

[32]  Yueyue Fan,et al.  Multistage Optimization of the Supply Chains of Biofuels , 2010 .

[33]  R. Huhnke,et al.  Integrative Investment Appraisal of a Lignocellulosic Biomass-to-Ethanol Industry , 2003 .

[34]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[35]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[36]  Stephen C. Graves,et al.  The Travelling Salesman Problem and Related Problems , 1978 .

[37]  Gilbert Laporte,et al.  The Pickup And Delivery Problem With Time Windows And Transshipment , 2006 .

[38]  Luis F. Rodriguez,et al.  Integrated strategic and tactical biomass-biofuel supply chain optimization. , 2014, Bioresource technology.

[39]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[40]  Beatriz Santos Hernández.  The split-demand one-commodity pickup-and-delivery travelling salesman problem , 2016 .

[41]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[42]  Jun Zhang,et al.  An integrated optimization model for switchgrass-based bioethanol supply chain , 2013 .

[43]  Paolo Toth,et al.  Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[44]  C. D. Heatwole,et al.  Spatial Analysis to Site Satellite Storage Locations for Herbaceous Biomass in the Piedmont of the Southeast , 2011 .

[45]  Murali Sambasivan,et al.  A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers , 2005, Comput. Oper. Res..

[46]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[47]  Andrea Lodi,et al.  Combinatorial Traveling Salesman Problem Algorithms , 2011 .

[48]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[49]  Martín Matamala,et al.  The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..

[50]  Guy Desaulniers,et al.  The traveling salesman problem with time windows in postal services , 2018, J. Oper. Res. Soc..

[51]  Anthony F Turhollow,et al.  BASELINE COST FOR CORN STOVER COLLECTION , 2002 .

[52]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[53]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[54]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[55]  Ali Ridha Mahjoub,et al.  Models for the single-vehicle preemptive pickup and delivery problem , 2010, Journal of Combinatorial Optimization.

[56]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[57]  Hanif D. Sherali,et al.  A linear programming approach for designing a herbaceous biomass delivery system , 1997 .

[58]  Gilbert Laporte,et al.  One-to-Many-to-One Single Vehicle Pickup and Delivery Problems , 2008 .

[59]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[60]  Mernout Burger,et al.  Exact and Compact Formulation of the Fixed-Destination Travelling Salesman Problem by Cycle Imposement Through Node Currents , 2013, OR.

[61]  Fei Xie,et al.  Integrating multimodal transport into cellulosic biofuel supply chain design under feedstock seasonality with a case study based on California. , 2014, Bioresource technology.

[62]  Jason D. Judd,et al.  Design, modeling, and analysis of a feedstock logistics system. , 2012, Bioresource technology.

[63]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[64]  Heungjo An,et al.  A mathematical model to design a lignocellulosic biofuel supply chain system with a case study based on a region in Central Texas. , 2011, Bioresource technology.

[65]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[66]  José-Manuel Belenguer,et al.  A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..

[67]  M. Lübbecke.  Column Generation , 2010 .

[68]  Hanif D. Sherali,et al.  Primary pharmaceutical manufacturing scheduling problem , 2014 .

[69]  Maria Sameiro Carvalho,et al.  New mixed integer-programming model for the pickup-and-delivery problem with transshipment , 2014, Eur. J. Oper. Res..

[70]  Hanif D. Sherali,et al.  Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations , 2014, Comput. Oper. Res..

[71]  Güneş Erdoğan,et al.  Discrete Optimization An exact algorithm for the static rebalancing problem arising in bicycle sharing systems , 2015 .

[72]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[73]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[74]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[75]  Robert D. Grisso,et al.  Management System for Biomass Delivery at a Plant Conversion , 2004 .

[76]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[77]  Tolga Bektas,et al.  Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing , 2012, Eur. J. Oper. Res..

[78]  Paolo Toth,et al.  Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison , 2012, EURO J. Transp. Logist..

[79]  Michael Jünger,et al.  Combinatorial Optimization -- Eureka, You Shrink!: Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers , 2003 .

[80]  Xuding Zhu,et al.  Multiple Capacity Vehicle Routing on Paths , 1998, SIAM J. Discret. Math..

[81]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

[82]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[83]  Xiaoyan Zhu,et al.  Challenges and models in supporting logistics system design for dedicated-biomass-based bioenergy industry. , 2011, Bioresource technology.

[84]  Ulrich Pferschy,et al.  Generating subtour elimination constraints for the TSP from pure integer solutions , 2015, Central European Journal of Operations Research.

[85]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[86]  Samir Khuller,et al.  Algorithms for Capacitated Vehicle Routing , 2001, SIAM J. Comput..

[87]  A. Mahjoub,et al.  The splittable pickup and delivery problem with reloads , 2008 .

[88]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[89]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[90]  Martin W. P. Savelsbergh,et al.  Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..

[91]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.