Layer: An Alternative Approach To Solve Large Capacitated Vehicle Routing Problem with Time Window Using AI and Exact Method
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- JANSSENS, Jochen & DE CORTE, Annelies & SÖRENSEN, Kenneth, 2016. "Water distribution network design optimisation with respect to reliability," Working Papers 2016007, University of Antwerp, Faculty of Business and Economics.
- Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
- Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
- Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
- Wang, Entai & Yuan, Yin & Mo, Pengli & D’Ariano, Andrea & Yang, Lixing & Gao, Ziyou, 2025. "Real-time train rescheduling optimization with combined cross-line strategies for urban rail network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
- Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
- Dessouky, Maged M & Shao, Yihuan E, 2017. "Routing Strategies for Efficient Deployment of Alternative Fuel Vehicles for Freight Delivery," Institute of Transportation Studies, Working Paper Series qt0nj024qn, Institute of Transportation Studies, UC Davis.
- Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
- Wu, Yuehui & Fang, Hui & Qureshi, Ali Gul & Yamada, Tadashi, 2025. "Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems," European Journal of Operational Research, Elsevier, vol. 326(2), pages 255-269.
- SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
- repec:dar:wpaper:62383 is not listed on IDEAS
- Parvez Farazi, Nahid & Zou, Bo & Tulabandhula, Theja, 2022. "Dynamic On-Demand Crowdshipping Using Constrained and Heuristics-Embedded Double Dueling Deep Q-Network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
- He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
- Li Chen & Gang Duan & Jie Cao & Jinhua Wang, 2025. "Two-Stage Optimization on Vessel Routing and Hybrid Energy Output for Marine Debris Collection," Sustainability, MDPI, vol. 17(8), pages 1-34, April.
- Du, Yuchen & Yang, Hai & Chow, Joseph Y.J. & Le, Tho V., 2025. "Two-stage stochastic fleet and battery sizing with routing optimization for sidewalk delivery robots," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
- Eder, Peter J. & Ramoser, Simon & Braun, Sarah & Weltge, Stefan, 2025. "Efficient active–passive vehicle coordination in multimodal transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(C).
- Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke, 2020. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships," Journal of Heuristics, Springer, vol. 26(6), pages 885-912, December.
- Su, Yue & Dupin, Nicolas & Parragh, Sophie N. & Puchinger, Jakob, 2024. "A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
- Arda, Yasemin & Cattaruzza, Diego & François, Véronique & Ogier, Maxime, 2024. "Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 317(2), pages 468-486.
- Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
- J. Álvaro Gómez-Pantoja & M. Angélica Salazar-Aguilar & José Luis González-Velarde, 2021. "The food bank resource allocation problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 266-286, April.
More about this item
Keywords
; ; ; ;JEL classification:
- C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
NEP fields
This paper has been announced in the following NEP Reports:- NEP-BIG-2023-07-17 (Big Data)
- NEP-CMP-2023-07-17 (Computational Economics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:117513. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/p/pra/mprapa/117513.html