Yang, Xinan and Daham, Hajem (2020) A column generation based decomposition and aggregation approach for combining orders in inland transportation of containers. OR Spectrum, 42 (1). pp. 261-296. DOI https://doi.org/10.1007/s00291-020-00577-x
Yang, Xinan and Daham, Hajem (2020) A column generation based decomposition and aggregation approach for combining orders in inland transportation of containers. OR Spectrum, 42 (1). pp. 261-296. DOI https://doi.org/10.1007/s00291-020-00577-x
Yang, Xinan and Daham, Hajem (2020) A column generation based decomposition and aggregation approach for combining orders in inland transportation of containers. OR Spectrum, 42 (1). pp. 261-296. DOI https://doi.org/10.1007/s00291-020-00577-x
Abstract
A significant portion of the total cost of the intermodal transportation is generated from the inland transportation of containers. In this paper, we design a Mixed Integer Linear Programming (MILP) model for combining orders in the inland, haulage transportation of containers. The pickup and delivery process of both 20 and 40 foot containers from the terminals to the customer locations and vice versa are optimized using heterogeneous fleet consisting of both 20ft and 40ft trucks/chasses. Important operational constraints such as the time window at order receivers, the payload weight of containers and the regulation of the working hours are considered. Based on an assignment problem structure, this MILP solves efficiently to optimality for problems with up to 120 orders. To deal with larger instances, a decomposition and aggregation heuristic is designed. The basic idea of this approach is to decompose order locations geographically into fanshaped sub-areas based on the angle of the order location to the port baseline, and solve the sub problems using the proposed MILP model. To balance the fleet size amongst all subgroups, column generation is used to iteratively adjust the number of allocated trucks according to the shadow-price of each truck type. Based on decomposed solutions, orders that are "fully" combined with others are removed and an aggregation phase follows to enable wider combination choices across subgroups. The decomposition and aggregation solution process is tested to be both efficient and cost-saving.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Combining Orders; Inland Transportation; MILP Model; Heuristic Decomposition; Column generation |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Mathematical Sciences, Department of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 10 Mar 2020 13:48 |
Last Modified: | 06 Jan 2022 14:10 |
URI: | http://repository.essex.ac.uk/id/eprint/26669 |
Available files
Filename: third revision paper 2.pdf