Execution Time Experiments to Solve Capacitated Vehicle Routing Problem

Lima, José; Pereira, Ana I.; Silva, Adrián M.T.; Gomes, Helder

doi:10.1007/978-3-031-37126-4_19

Lecture Notes in Computer Science

2023

DOI: 10.1007/978-3-031-37126-4_19

|View full text |Cite

Execution Time Experiments to Solve Capacitated Vehicle Routing Problem

José Lima

Ana I. Pereira

Adrián M.T. Silva

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Book3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Time-Dependency of Guided Local Search to Solve the Capacitated Vehicle Routing Problem with Time Windows

Silva,

Lima,

Silva

et al. 2024

Communications in Computer and Information Science

View full text Add to dashboard Cite

Research have been driven by the increased demand for delivery and pick-up services to develop new formulations and algorithms for solving Vehicle Routing Problems (VRP). The main objective is to create algorithms that can identify paths considering execution time in real-world scenarios. This study focused on using the Guided Local Search (GLS) metaheuristic available in OR-Tools to solve the Capacitated Vehicle Routing Problem with Time Windows using the Solomons instances. The execution time was used as a stop criterion, with short runs ranging from 1 to 10 s and a long run of 360 s for comparison. The results showed that the GLS metaheuristic from OR-Tools is applicable for achieving high performance in finding the shortest path and optimizing routes within constrained execution times. It outperformed the best-known solutions from the literature in longer execution times and even provided a close-to-optimal solution within 10 s. These findings suggest the potential application of this tool for dynamic VRP scenarios that require faster algorithms.

show abstract

Time-Dependency of Guided Local Search to Solve the Capacitated Vehicle Routing Problem with Time Windows

Silva,

Lima,

Silva

et al. 2024

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

Unveiling Key Parameters: Time Windows and Travel Times in Capacitated Waste Collection

Silva,

Lima,

Silva

et al. 2024

Computational Science and Its Applications – ICCSA 2024 Workshops

View full text Add to dashboard Cite

Optimizing Waste Collection in Constrained Urban Spaces: A Hybrid Fleet Approach

Silva,

Lima,

Silva

et al. 2024

Communications in Computer and Information Science

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Execution Time Experiments to Solve Capacitated Vehicle Routing Problem

Cited by 3 publications

References 26 publications

Time-Dependency of Guided Local Search to Solve the Capacitated Vehicle Routing Problem with Time Windows

Time-Dependency of Guided Local Search to Solve the Capacitated Vehicle Routing Problem with Time Windows

Unveiling Key Parameters: Time Windows and Travel Times in Capacitated Waste Collection

Optimizing Waste Collection in Constrained Urban Spaces: A Hybrid Fleet Approach

Contact Info

Product

Resources

About