PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 12, 2010Journal of King Saud University - Science257 citationsOpen Access

Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods

View Full Paper
NENasser A. El-Sherbeny

Key Points

Key points are not available for this paper at this time.

Abstract

In this paper, we present a review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW). Over the past 20 years vehicle routing problem with time windows has been an area of research that has attracted many researchers. In this period a number of papers have been published on the exact, heuristics and metaheursitics methods of the routing problem with time windows. This problem has model character in many branches of mathematics, computer science, and operations research. Metaheuristics support managers in decision-making with robust that provide high-quality solutions to important applications in business, engineering, economic and science in reasonable time horizons.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Nasser A. El-Sherbeny (2010) studied this question.

synapsesocial.com/papers/69d9a69ca1d151c65f684bf9https://doi.org/10.1016/j.jksus.2010.03.002
Ask AI
Helpful
Bookmark
Share
View Full Paper