Abstract
We consider a special case of the vehicle routing problem where not only each customer has specified delivery time window, but each route has limited time duration. We propose a solution algorithm using network reduction techniques and simulated annealing meta-heuristic. The objective is twofold: minimising the travel time and minimising the total number of vehicles required. The time-window constraint ensures delivery without delay, thus, a potentially higher level of customer satisfaction. The algorithm has helped the transportation planning team at General Electric Appliances & Lighting to significantly reduce the number of required trucks in two real cases, while its performance on randomly generated cases is also efficient when compared to properly selected benchmarking algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
