A customer selection and vehicle scheduling model for moving companies

References

• Archetti, C., D. Feillet, A. Hertz, and M. G. Speranza. 2009. “The Capacitated Team Orienteering and Profitable Tour Problems.” Journal of the Operational Research Society 60 (6): 831–842. doi:10.1057/palgrave.jors.2602603.
   Web of Science ®Google Scholar
• Archetti, C., M. G. Speranza, and D. Vigo. 2014. Vehicle Routing Problems with Profits, In: Vehicle Routing: Problems, Methods, and Applications. 2nd ed. Edited by P. Toth and D. Vigo. PA, USA: SIAM.
   Google Scholar
• Azadeh, A., and H. Farrokhi-Asl. 2019. “The Close–Open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 11 (2): 78–92. doi:10.1080/19427867.2016.1274468.
   Web of Science ®Google Scholar
• Bondy, J. A., and U. S. R. Murty. 1976. Graph Theory with Applications. Vol. 290. London: Macmillan.
   Google Scholar
• Cherkesly, M., G. Desaulniers, and G. Laporte. 2014. “Branch-price-And-cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-first-out Loading.” Transportation Science 49 (4): 752–766. doi:10.1287/trsc.2014.0535.
   Web of Science ®Google Scholar
• Clarke, L. W., C. A. Hane, E. L. Johnson, and G. L. Nemhauser. 1996. “Maintenance and Crew Considerations in Fleet Assignment.” Transportation Science 30: 249–260. doi:10.1287/trsc.30.3.249.
   Web of Science ®Google Scholar
• Desrosiers, J., and Y. Dumas. 1988. “The Shortest Path for the Construction of Vehicle Routes with Pick-up, Delivery and Time Constraints.” In Advances in Optimization and Control, edited by H. Eiselt and G. Pederzoli, 144–157. Lecture Notes in Economics and Mathematical Systems. Heidelberg Berlin: Springer.
   Google Scholar
• Dumas, Y., J. Desrosiers, and F. Soumis. 1991. “The Pickup and Delivery Problem with Time Windows.” European Journal of Operational Research 54: 7–22. doi:10.1016/0377-2217(91)90319-Q.
   Web of Science ®Google Scholar
• Freight Transport Information Exchange Network. 2015. Retrieved from http://www.tolacu.com.tw/board_list.asp
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, USA, ISBN 0-7167-1045-5.
   Google Scholar
• Hane, C. A., C. Barnhart, E. L. Johnson, R. Marsten, G. L. Nemhauser, and G. Sigismondi. 1995. “The Fleet Assignment Problem: Solving a Large-scale Integer Program.” Mathematical Programming Study 70: 211–232. doi:10.1007/BF01585938.
   Web of Science ®Google Scholar
• Kalina, P., J. Vokřínek, and V. Mařík. 2015. “Agents Toward Vehicle Routing Problem With Time Windows.” Journal of Intelligent Transportation Systems 19 (1): 3–17. doi:10.1080/15472450.2014.889953.
   Web of Science ®Google Scholar
• Labadie, N., R. Mansini, J. Melechovský, and R. W. Calvo. 2012. “The Team Orienteering Problem with Time Windows: An Lp-based Granular Variable Neighborhood Search.” European Journal of Operational Research 220 (1): 15–27. doi:10.1016/j.ejor.2012.01.030.
   Web of Science ®Google Scholar
• Lee, H. K., F. N. Ferdinan, T. Kim, and C. S. Ko. 2010. “A Genetic Algorithm Based Approach to the Profitable Tour Problem with Pick-up and Delivery.” Industrial Engineering & Management Systems 9 (2): 80–87. doi:10.7232/iems.2010.9.2.080.
   Google Scholar
• Li, Y., H. Chen, and C. Prins. 2016. “Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Profits, and Reserved Requests.” European Journal of Operational Research 252 (1): 27–38. doi:10.1016/j.ejor.2015.12.032.
   Web of Science ®Google Scholar
• Lim, H., A. Lim, and B. Rodrigues. 2002. “Solving the Pickup and Delivery Problem with Time Windows Using Squeaky Wheel Optimization with Local Search.” In: American Conference on Information Systems 2002, Dallas, Texas, USA.
   Google Scholar
• Lu, Q., and M. M. Dessouky. 2004. “An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem.” Transportation Science 38: 503–514. doi:10.1287/trsc.1030.0040.
   Web of Science ®Google Scholar
• Lu, Q., and M. M. Dessouky. 2006. “A New Insertion-based Construction Heuristic for Solving the Pickup and Delivery Problem with Time Windows.” European Journal of Operational Research 175: 672–687. doi:10.1016/j.ejor.2005.05.012.
   Web of Science ®Google Scholar
• Masson, R., S. Ropke, F. Lehuédé, and O. Péton. 2014. “A Branch-And-cut-And-price Approach for the Pickup and Delivery Problem with Shuttle Routes.” European Journal of Operational Research 236: 849–862. doi:10.1016/j.ejor.2013.08.042.
   Web of Science ®Google Scholar
• Mitrović-Minić, S., and G. Laporte. 2006. “The Pickup and Delivery Problem with Time Windows and Transshipment.” INFOR 44: 217–227.
   Web of Science ®Google Scholar
• Montemanni, R., and L. M. Gambardella. 2009. “An Ant Colony System for Team Orienteering Problems with Time Windows.” Foundations of Computing and Decision Sciences 34: 287–306.
   Google Scholar
• Musolino, G., A. Polimeni, and A. Vitetta. 2018. “Freight Vehicle Routing with Reliable Link Travel Times: A Method Based on Network Fundamental Diagram.” Transportation Letters 10 (3): 159–171. doi:10.1080/19427867.2016.1241040.
   Web of Science ®Google Scholar
• Ng, K. K. H., C. K. M. Lee, S. Z. Zhang, K. Wu, and W. Ho. 2017. “A Multiple Colonies Artificial Bee Colony Algorithm for A Capacitated Vehicle Routing Problem and Re-routing Strategies under Time-dependent Traffic Congestion.” Computers & Industrial Engineering 109: 151–168. doi:10.1016/j.cie.2017.05.004.
   Web of Science ®Google Scholar
• Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2008a. “A Survey on Pickup and Delivery Problems Part I: Transportation between Customers and Depot.” Journal Für Betriebswirtschaft 58: 21–51. doi:10.1007/s11301-008-0033-7.
   Google Scholar
• Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2008b. “A Survey on Pickup and Delivery Problems Part II: Transportation between Pickup and Delivery Locations.” Journal Für Betriebswirtschaf 58: 81–117. doi:10.1007/s11301-008-0036-4.
   Google Scholar
• Quirion-Blais, O., M. Trépanier, and A. Langevin. 2015. “A Case Study of Snow Plow Routing Using an Adaptive Large Hood Search Metaheuristic.” Transportation Letters 7 (4): 201–209. doi:10.1179/1942787514Y.0000000042.
   Web of Science ®Google Scholar
• Rabbani, M., A. Sabbaghnia, M. Mobini, and J. Razmi. 2018. “A Graph Theory-based Algorithm for A Multi-echelon Multi-period Responsive Supply Chain Network Design with Lateral-transshipments.” In Operational Research, 1–21.
   Google Scholar
• Ropke, S., and J. F. Cordeau. 2006. “Branch-And-cut-And-price for the Pickup and Delivery Problem with Time Windows.” Technical Report CRT-2006-21, CRT, Universit´e Montr´eal, Canada.
   Google Scholar
• Ropke, S., J. F. Cordeau, and G. Laporte. 2007. “Models and Branch-And-cut Algorithms for Pickup and Delivery Problems with Time Windows.” Networks 49: 258–272. doi:10.1002/net.20177.
   Web of Science ®Google Scholar
• Shang, J. S., and C. K. Cuff. 1996. “Multicriteria Pickup and Delivery Problem with Transfer Opportunity.” Computer & Industrial Engineering 30: 631–645. doi:10.1016/0360-8352(95)00181-6.
   Web of Science ®Google Scholar
• Sigurd, M., D. Pisinger, and M. Sig. 2004. “Scheduling Transportation of Live Animals to Avoid the Spread of Diseases.” Transportation Science 38: 197–209. doi:10.1287/trsc.1030.0053.
   Web of Science ®Google Scholar
• Sun, P., L. P. Veelenturf, M. Hewitt, and T. Van Woensel. 2018. “The Time-dependent Pickup and Delivery Problem with Time Windows.” Transportation Research Part B: Methodological 116: 1–24. doi:10.1016/j.trb.2018.07.002.
   Web of Science ®Google Scholar
• Thangiah, S. R., and A. Awan. 2006. “Real-Time Split-Delivery Pickup and Delivery Time Window Problems with Transfer.” Technical Report SRT90-2006, Artificial Intelligence Robotics Lab, Slippery Rock University: Philadelphia, PA.
   Google Scholar
• Toth, P., and D. Vigo. 2001. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics,  Philadelphia, PA, USA.
   Google Scholar
• Vansteenwegen, P., W. Souffriau, G. V. Berghe, and D. Van Oudheusden. 2009. “Iterated Local Search for the Team Orienteering Problem with Time Windows.” Computers & Operations Research 36 (12): 3281–3290. doi:10.1016/j.cor.2009.03.008.
   Web of Science ®Google Scholar
• Wang, J., A. K. R. Jagannathan, X. Zuo, and C. C. Murray. 2017. “Two-layer Simulated Annealing and Tabu Search Heuristics for a Vehicle Routing Problem with Cross Docks and Split Deliveries.” Computers & Industrial Engineering 112: 84–98. doi:10.1016/j.cie.2017.07.031.
   Web of Science ®Google Scholar
• Wang, Z., Y. Li, and X. Hu. 2015. “A Heuristic Approach and A Tabu Search for the Heterogeneous Multi-type Fleet Vehicle Routing Problem with Time Windows and an Incompatible Loading Constraint.” Computers & Industrial Engineering 89: 162–176. doi:10.1016/j.cie.2014.11.004.
   Web of Science ®Google Scholar
• Xu, H., Z. L. Chen, S. Rajagopal, and S. Arunapuram. 2003. “Solving a Practical Pickup and Delivery Problem.” Transportation Science 37: 347–364. doi:10.1287/trsc.37.3.347.16044.
   Web of Science ®Google Scholar
• Yan, S., and C.-H. Chen. 2008. “Optimal Flight Scheduling Models for Cargo Airlines under Alliances.” Journal of Scheduling 11: 3. doi:10.1007/s10951-007-0020-1.
   Web of Science ®Google Scholar
• Yan, S., C.-K. Lin, and S.-Y. Chen. 2012. “Optimal Scheduling of Logistical Support for an Emergency Roadway Repair Work Schedule.” Engineering Optimization 44 (9): 1035–1055. doi:10.1080/0305215X.2011.628389.
   Web of Science ®Google Scholar
• Yan, S., -S.-S. Wang, and Y.-H. Chang. 2014. “Cash Transportation Vehicle Routing and Scheduling under Stochastic Travel Times.” Engineering Optimization 46 (3): 289–307. doi:10.1080/0305215X.2013.768240.
   Web of Science ®Google Scholar
• Yan, S., W. C. Wang, G. W. Chang, and H. C. Lin. 2016. “Effective Ready Mixed Concrete Supply Adjustments with Inoperative Mixers under Stochastic Travel Times.” Transportation Letters 8 (5): 286–300. doi:10.1080/19427867.2016.1188522.
   Web of Science ®Google Scholar
• Yao, B., Q. Cao, Z. Wang, P. Hu, M. Zhang, and B. Yu. 2016. “A Two-stage Heuristic Algorithm for the School Bus Routing Problem with Mixed Load Plan.” Transportation Letters 8 (4): 205–219. doi:10.1080/19427867.2015.1110953.
   Web of Science ®Google Scholar
• Zhang, J., W. Li, and F. Qiu. 2015. “Optimizing Single-Depot Vehicle Scheduling Problem: Fixed-Interval Model and Algorithm.” Journal of Intelligent Transportation Systems 19 (3): 215–224. doi:10.1080/15472450.2013.836930.
   Web of Science ®Google Scholar