Abstract This paper describes an exact solution approach for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW), and presents its application on a realistic logistics instance based on the VICS (Vehicle Information and Communication System) data, an ITS application in Japan. Exact solutions of VRPSTW have been compared with those of the Vehicle Routing and scheduling with Hard Time Windows (VRPHTW). Detailed analysis of environmental issues and idling time along with the traditional comparison of cost and number of vehicles, shows that the exact VRPSTW solutions are not only cost efficient but helpful in reducing congestion, which implies these are more environmentally sustainable.
An Analysis of Exact VRPTW Solutions on ITS Data-based Logistics Instances
International Journal of Intelligent Transportation Systems Research ; 10 , 1 ; 34-46
2011-09-27
13 pages
Article (Journal)
Electronic Resource
English
City logistics , Realistic logistics instances , Soft time windows , Vehicle routing Electrical Engineering , Automotive Engineering , Engineering , Civil Engineering , User Interfaces and Human Computer Interaction , Computer Imaging, Vision, Pattern Recognition and Graphics , Robotics and Automation
Low cost parallel solutions for the VRPTW optimization problem
Tema Archive | 2001
|Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)
BASE | 2021
|British Library Online Contents | 2005
|