A greedy based algorithm for a bi-objective Pickup and Delivery Problem with Transfers
暂无分享,去创建一个
[1] Fabien Lehuédé,et al. The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..
[2] Fabien Lehuédé,et al. An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..
[3] Marie-Ange Manier,et al. Hybrid metaheuristic for the Pickup and Delivery Problem designed for passengers and goods transportation , 2019, IFAC-PapersOnLine.
[4] Yahia Zare Mehrjerdi,et al. Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands , 2013, Eur. J. Oper. Res..
[5] Heiko A. von der Gracht,et al. Heading towards a multimodal city of the future , 2014 .
[6] Alain Quilliot,et al. Dial-A-Ride Problem with Time Windows, Transshipments, and Dynamic Transfer Points , 2013, MIM.
[7] F. Altiparmak,et al. The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .
[8] Gilbert Laporte,et al. The Pickup And Delivery Problem With Time Windows And Transshipment , 2006 .
[9] Manuela M. Veloso,et al. Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search , 2014, AAAI.
[10] Jiujun Cheng,et al. Ant colony optimization with clustering for solving the dynamic location routing problem , 2016, Appl. Math. Comput..
[11] Saïd Salhi,et al. Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..
[12] Marie-Ange Manier,et al. MILP for a Variant of Pickup & Delivery Problem for both Passengers and Goods Transportation , 2018, 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC).