254
Views
0
CrossRef citations to date
0
Altmetric
Articles

A multi-trip vehicle routing problem considering time windows and limited duration under a heterogeneous fleet and parking constraints in cold supply chain logistics

, , &
Pages 335-358 | Received 18 May 2022, Accepted 27 Feb 2023, Published online: 16 Mar 2023

References

  • Afshar-Nadjafi, B., and A. Afshar-Nadjafi. 2017. “A Constructive Heuristic for Time-Dependent Multi-Depot Vehicle Routing Problem with Time-Windows and Heterogeneous Fleet.” Journal of King Saud University - Engineering Sciences 29 (1): 29–34. doi:10.1016/j.jksues.2014.04.007
  • Alvarez, P., I. Lerga, A. Serrano-Hernandez, and J. Faulin. 2018. “The Impact of Traffic Congestion When Optimising Delivery Routes in Real Time. A Case Study in Spain.” International Journal of Logistics Research and Applications 21 (5): 529–541. doi:10.1080/13675567.2018.1457634
  • Alvarez, A., and P. Munari. 2017. “An Exact Hybrid Method for the Vehicle Routing Problem with Time Windows and Multiple Deliverymen.” Computers & Operations Research 83: 1–12. doi:10.1016/j.cor.2017.02.001
  • Azi, N., M. Gendreau, and J.-Y. Potvin. 2007. “An Exact Algorithm for a Single-Vehicle Routing Problem with Time Windows and Multiple Routes.” European Journal of Operational Research 178 (3): 755–766. doi:10.1016/j.ejor.2006.02.019
  • Babaee Tirkolaee, E., P. Abbasian, M. Soltani, and S. A. Ghaffarian. 2019. “Developing an Applied Algorithm for Multi-Trip Vehicle Routing Problem with Time Windows in Urban Waste Collection: A Case Study.” Waste Management & Research 37: 4–13. doi:10.1177/0734242X18807001
  • Ben Ticha, H., N. Absi, D. Feillet, and A. Quilliot. 2017. “Empirical Analysis for the VRPTW with a Multigraph Representation for the Road Network.” Computers & Operations Research 88: 103–116. doi:10.1016/j.cor.2017.06.024
  • Ben Ticha, H., N. Absi, D. Feillet, and A. Quilliot. 2019. “Multigraph Modeling and Adaptive Large Neighborhood Search for the Vehicle Routing Problem with Time Windows.” Computers & Operations Research 104: 113–126. doi:10.1016/j.cor.2018.11.001
  • Bicakci, S., D. Akdas, and A. Deniz Karaoglan. 2014. “Optimizing Karnopp Friction 819 Model Parameters of a Pendulum Using RSM.” European Journal of Control 20: 180–187. doi:10.1016/j.ejcon.2014.04.001
  • Box, G. E. P., and K. B. Wilson. 1951. “On the Experimental Attainment of Optimum Conditions.” Journal of the Royal Statistical Society Series B-Statistical Methodology 823 (13): 1–45. doi:10.1111/j.2517-6161.1951.tb00067.x.
  • Buyukozkan, K., I. Kucukkoc, S. I. Satoglu, and D. Z. Zhang. 2016. “Lexicographic Bottleneck Mixed-Model Assembly Line Balancing Problem: Artificial bee Colony and Tabu Search Approaches with Optimised Parameters.” Expert Systems with Applications 50: 151–166. doi:10.1016/j.eswa.2015.12.018
  • Cattaruzza, D., N. Absi, and D. Feillet. 2018. “Vehicle Routing Problems with Multiple Trips.” Annals of Operations Research 271 (1): 127–159. doi:10.1007/s10479-018-2988-7
  • Chang, X., M. Dong, and D. Yang. 2013. “Multi-objective Real-Time Dispatching for Integrated Delivery in a Fab Using GA Based Simulation Optimization.” Journal of Manufacturing System 32: 741–751. doi:10.1016/j.jmsy.2013.07.001
  • Desrochers, M., J. Desrosiers, and M. Solomon. 1992. “A new Optimization Algorithm for the Vehicle Routing Problem with Time Windows.” Operations Research 40 (2): 342–354. doi:10.1287/opre.40.2.342
  • Dominguez, O., A. A. Juan, B. Barrios, J. Faulin, and A. Agustin. 2016. “Using Biased Randomization for Solving the two-Dimensional Loading Vehicle Routing Problem with Heterogeneous Fleet.” Annals of Operations Research 236 (2): 383–404. doi:10.1007/s10479-014-1551-4
  • Fermín Cueto, P., I. Gjeroska, A. Solà Vilalta, and M. F. Anjos. 2021. “A Solution Approach for Multi-Trip Vehicle Routing Problems with Time Windows, Fleet Sizing, and Depot Location.” Networks 78 (4): 503–522. doi:10.1002/net.22028
  • Fleischmann, B. 1990. “The Vehicle Routing Problem with Multiple Use of Vehicles.” In Working Paper, Fachbereich WirtshaftSwissenSchaften. University Hamburg.
  • Hassanat, A. B., K. Almohammadi, E. A. Alkafaween, E. Abunawas, A. M. Hammouri, and V. B. S. Prasath. 2019. “Choosing Mutation and Crossover Ratios for Genetic Algorithms - A Review with a New Dynamic Approach.” Information 10: 390. doi:10.3390/info10120390
  • Hernandez, F., D. Feillet, R. Giroudeau, and O. Naud. 2014. “A new Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration.” 4OR 12 (3): 235–259. doi:10.1007/s10288-013-0238-z
  • Hernandez, F., D. Feillet, R. Giroudeau, and O. Naud. 2016. “Branch-and-price Algorithms for the Solution of the Multi-Trip Vehicle Routing Problem with Time Windows.” European Journal of Operational Research 249 (2): 551–559. doi:10.1016/j.ejor.2015.08.040
  • Khoukhi, S., O. E. Yaakoubi, C. Bojji, and Y. Bensouda. 2019. “A Genetic Algorithm for Solving a Multi-Trip Vehicle Routing Problem with Time Windows and Simultaneous Pick-Up and Delivery in a Hospital Complex.” In Paper presented at the 3rd International Conference on Machine Learning and Soft Computing, Vietnam, January 76–80.
  • Konak, A., D. Coit, and A. Smith. 2006. “Multi-objective Optimization Using Genetic Algorithms: A Tutorial.” Reliability Engineering & System Safety 91 (9): 992–1007. doi:10.1016/j.ress.2005.11.018
  • Kucukkoc, I., and D. Z. Zhang. 2015. “Type-E Parallel two-Sided Assembly Line Balancing Problem: Mathematical Model and ant Colony Optimisation Based Approach with Optimised Parameters.” Computers & Industrial Engineering 84: 56–69. doi:10.1016/j.cie.2014.12.037
  • Li, J.-Q., Y.-Q. Han, P.-Y. Duan, Y.-Y. Han, B. Niu, C.-D. Li, Z.-X. Zheng, and Y.-P. Liu. 2020. “Meta-heuristic Algorithm for Solving Vehicle Routing Problems with Time Windows and Synchronized Visit Constraints in Prefabricated Systems.” Journal of Cleaner Production 250: 119464. doi:10.1016/j.jclepro.2019.119464
  • Mejjaouli, S., and R. F. Babiceanu. 2018. “Cold Supply Chain Logistics: System Optimization for Real-Time Rerouting Transportation Solutions.” Computers in Industry 95: 68–80. doi:10.1016/j.compind.2017.12.006
  • Min, H., and E. Melachrinoudis. 2016. “A Model-Based Decision Support System for Solving Vehicle Routing and Driver Scheduling Problems Under Hours of Service Regulations.” International Journal of Logistics Research and Applications 19 (4): 256–277. doi:10.1080/13675567.2015.1075475
  • Mingyao, Q., D. Guoxiang, Z. M, and You Lixin. 2011. “Vehicle Routing Problem with Time Windows Based on Spatiotemporal Distance.” Journal of Transportation Systems Engineering and Information Technology 11 (1): 85–89. doi:10.1016/S1570-6672(10)60104-3
  • Neira, D. A., M. M. Aguayo, R. De la Fuente, and M. A. Klapp. 2020. “New Compact Integer Programming Formulations for the Multi-Trip Vehicle Routing Problem with Time Windows.” Computers & Industrial Engineering 144: 106399. doi:10.1016/j.cie.2020.106399
  • Pan, B., Z. Zhang, and A. Lim. 2021. “Multi-trip Time-Dependent Vehicle Routing Problem with Time Windows.” European Journal of Operational Research 291 (1): 218–231. doi:10.1016/j.ejor.2020.09.022
  • Pratiwi, A. B., A. Sasmito, Q. S. Istiqomah, M. R. Kurniawan, and H. Suprajitno. 2019. “Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW).” Journal of Physics: Conference Series 1306 (1): 012021. doi:10.1088/1742-6596/1306/1/012021
  • Shi, Y., T. Boudouh, and O. Grunder. 2018. “An Efficient Tabu Search Based Procedure for Simultaneous Delivery and Pick-up Problem with Time Window.” IFAC-PapersOnLine 51 (11): 241–246. doi:10.1016/j.ifacol.2018.08.278
  • Tzeng, G., H. W. C. Huang, and D. Teodorovic. 1997. “A Spatial and Temporal bi-Criteria Parallel-Savings-Based Heuristic Algorithm for Solving Vehicle Routing Problems with Time Windows.” Transportation Planning and Technology 20 (2): 163–181. doi:10.1080/03081069708717586
  • Vidal, T., T. G. Crainic, M. Gendreau, and C. Prins. 2013. “A Hybrid Genetic Algorithm with Adaptive Diversity Management for a Large Class of Vehicle Routing Problems with Time-Windows.” Computers & Operations Research 40 (1): 475–489. doi:10.1016/j.cor.2012.07.018
  • Wang, F., F. Liao, Y. Li, X. Yan, and X. Chen. 2021. “An Ensemble Learning Based Multi-Objective Evolutionary Algorithm for the Dynamic Vehicle Routing Problem with Time Windows.” Computers & Industrial Engineering 154: 107131. doi:10.1016/j.cie.2021.107131
  • Wei, C., W.-W. Gao, Z.-H. Hu, Y.-Q. Yin, and S.-D. Pan. 2019. “Assigning Customer-Dependent Travel Time Limits to Routes in a Cold-Chain Inventory Routing Problem.” Computers & Industrial Engineering 133: 275–291. doi:10.1016/j.cie.2019.05.018
  • Xu, Z., A. Elomri, S. Pokharel, and F. Mutlu. 2019. “A Model for Capacitated Green Vehicle Routing Problem with the Time-Varying Vehicle Speed and Soft Time Windows.” Computers & Industrial Engineering 137: 106011. doi:10.1016/j.cie.2019.106011
  • Zhang, W., D. Yang, G. Zhang, and M. Gen. 2020. “Hybrid Multiobjective Evolutionary Algorithm with Fast Sampling Strategy-Based Global Search and Route Sequence Difference-Based Local Search for VRPTW.” Expert Systems with Applications 145: 113151. doi:10.1016/j.eswa.2019.113151
  • Zhao, Z., X. Li, X. Zhou, and F. Chen. 2020. “Optimization of Transportation Routing Problem for Fresh Food in Time-Varying Road Network: Considering Both Food Safety Reliability and Temperature Control.” PLOS ONE 15 (7): e0235950.
  • Zhen, L., C. Ma, K. Wang, L. Xiao, and W. Zhang. 2020. “Multi-depot Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates.” Transportation Research Part E: Logistics and Transportation Review 135: 101866. doi:10.1016/j.tre.2020.101866

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.