Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition
暂无分享,去创建一个
[1] Günther R. Raidl,et al. Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case , 2014, EvoCOP.
[2] Gilbert Laporte,et al. Shared mobility systems , 2015, 4OR.
[3] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[4] Erlendur S. Thorsteinsson. Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.
[5] John N. Hooker,et al. Planning and Scheduling by Logic-Based Benders Decomposition , 2007, Oper. Res..
[6] Christine Fricker,et al. Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity , 2012, EURO J. Transp. Logist..
[7] Dennis L. Bricker,et al. A Hybrid Benders/genetic algorithm for vehicle routing and scheduling problem , 2012 .
[8] Yufei Han,et al. Towards Bicycle Demand Prediction of Large-Scale Bicycle Sharing System , 2014 .
[9] Luca Di Gaspero,et al. Constraint-Based Approaches for Balancing Bike Sharing Systems , 2013, CP.
[10] Günther R. Raidl,et al. A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems , 2013, EUROCAST.
[11] C. Morency,et al. Balancing a Dynamic Public Bike-Sharing System , 2012 .
[12] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[13] W. Y. Szeto,et al. Solving a static repositioning problem in bike-sharing systems using iterated tabu search , 2014 .
[14] Cees Duin,et al. Looking Ahead with the Pilot Method , 2005, Ann. Oper. Res..
[15] Mauro Dell'Amico,et al. The bike sharing rebalancing problem: Mathematical formulations and benchmark instances , 2014 .
[16] Michel Gendreau,et al. Mathematical formulations for a 1-full-truckload pickup-and-delivery problem , 2015, Eur. J. Oper. Res..
[17] Beatriz Santos Hernández. The split-demand one-commodity pickup-and-delivery travelling salesman problem , 2016 .
[18] Günther R. Raidl,et al. Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach , 2013, EvoCOP.
[19] William J. Cook,et al. TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.
[20] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[21] Manfred Morari,et al. Dynamic Vehicle Redistribution and Online Price Incentives in Shared Mobility Systems , 2013, IEEE Transactions on Intelligent Transportation Systems.
[22] Günther R. Raidl,et al. Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations , 2013, Hybrid Metaheuristics.
[23] Tal Raviv,et al. Static repositioning in a bike-sharing system: models and solution approaches , 2013, EURO J. Transp. Logist..
[24] Günther R. Raidl,et al. PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems , 2014, Journal of Global Optimization.
[25] Robert C. Hampshire,et al. Inventory rebalancing and vehicle routing in bike sharing systems , 2017, Eur. J. Oper. Res..
[26] Gilbert Laporte,et al. The static bicycle relocation problem with demand intervals , 2014, Eur. J. Oper. Res..
[27] Hiroshi Nagamochi,et al. Approximating the Bipartite TSP and Its Biased Generalization , 2014, WALCOM.
[28] Juan-José Salazar-González,et al. The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .
[29] Luca Di Gaspero,et al. A Hybrid ACO+CP for Balancing Bicycle Sharing Systems , 2013, Hybrid Metaheuristics.
[30] Ignacio E. Grossmann,et al. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .
[31] Andreas Baltz,et al. Approximation algorithms for the Euclidean bipartite TSP , 2005, Oper. Res. Lett..
[32] R. Jonker,et al. Transforming asymmetric into symmetric traveling salesman problems , 1983 .
[33] Anand Srivastav,et al. Approximation Algorithms for Pick-and-Place Robots , 2001, Ann. Oper. Res..
[34] Iris A. Forma,et al. A 3-step math heuristic for the static repositioning problem in bike-sharing systems , 2015 .
[35] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[36] Christian Rudloff,et al. Modeling Demand for Bikesharing Systems , 2014 .
[37] Ta-Hui Yang,et al. Strategic design of public bicycle sharing systems with service level constraints , 2011 .
[38] Frédéric Meunier,et al. Bike sharing systems: Solving the static rebalancing problem , 2013, Discret. Optim..
[39] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.
[40] Roberto Aringhieri,et al. Metaheuristics for a vehicle routing problem on bipartite graphs with distance constraints , 2005 .
[41] Dirk C. Mattfeld,et al. A Hybrid Metaheuristic to Solve the Resource Allocation Problem in Bike Sharing Systems , 2014, Hybrid Metaheuristics.
[42] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[43] Roy Jonker,et al. Transforming asymmetric into symmetric traveling salesman problems: erratum , 1986 .
[44] Inmaculada Rodríguez Martín,et al. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..
[45] J. Hooker,et al. Logic-based Benders decomposition , 2003 .
[46] Chuan-Kang Ting,et al. The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .
[47] Günther R. Raidl,et al. Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid , 2014, PPSN.
[48] Juan José Salazar González,et al. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..
[49] Juan José Salazar González,et al. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..