The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows
The containers drayage problem studied here arise in International Standards Organization (ISO) container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but m
- PDF / 562,555 Bytes
- 14 Pages / 439.37 x 666.142 pts Page_size
- 85 Downloads / 215 Views
bstract The containers drayage problem studied here arise in International Standards Organization (ISO) container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but mostly 20 ft, and 40 ft empty and loaded should be delivered to, or collected from the customers. Therefore, the problem studied here is closely related to the vehicle routing problem with the time windows where an optimal set of routes is obtained. Both delivery and pickup demands can be satisfied in a single route. The specificity of the containers drayage problem analyzed here lies in the fact that a truck may simultaneously carry one 40 ft, or two 20 ft containers, using an appropriate trailer type. This means that in one route there can be one, two, three or four nodes, which is equivalent to the problem of matching nodes in single routes. This paper presents the Variable Neighborhood Search (VNS) heuristic for solving the Containers Drayage Problem with Time Windows (CDPTW). The results from the VNS heuristic are compared with the two optimal MIP mathematical formulations that were introduced in our previous research papers.
D. Popovic´ (&) M. Vidovic´ Faculty of Transport and Traffic Engineering, Department of Logistics, University of Belgrade, Belgrade, Serbia e-mail: [email protected] M. Vidovic´ e-mail: [email protected] M. Nikolic´ Faculty of Transport and Traffic Engineering, Department of Operations Research in Traffic, University of Belgrade, Belgrade, Serbia e-mail: [email protected]
V. Snášel et al. (eds.), Soft Computing in Industrial Applications, Advances in Intelligent Systems and Computing 223, DOI: 10.1007/978-3-319-00930-8_31, Springer International Publishing Switzerland 2014
351
352
D. Popovic´ et al.
1 Introduction The routing problem studied here is a typical for the intermodal transportation systems where containers are delivered by trucks to customers oriented to a container sea port or an inland container terminal. In the intermodal transportation the major part of the cargo’s journey is performed by rail, inland waterway or sea, while the initial and/or final legs, distribution and collection of containers, are typically carried out by road (for more details about intermodal transportation systems see [1]). Truck should deliver a loaded container that has arrived at a terminal (import i.e. inbound container) to a consignee, and to pickup and haul back the loaded container from consignor to the terminal (export i.e. outbound container). In the case when a part of a container terminal serves as an empty containers’ depot, in addition to pickup/delivery operations with loaded containers, the empty containers also needs to be delivered to a shipper for loading and hauled back empty to the terminal after unloading goods at the consignee site. Container transportation within a local region oriented to an intermodal terminal with a few possible types of container moves is also known as drayage operations [2]. Dray
Data Loading...
