A Hybrid Algorithm for Collaborative Transportation Planning among Carriers
In this paper, there is concentration on collaborative transportation planning (CTP) among multiple carriers with pickup and delivery requests and time windows. This problem is a vehicle routing problem with constraints from standard vehicle routing problems and new constraints from a real-world application. In the problem, each carrier has a finite number of vehicles, and each request is a pickup and delivery request with time window. Moreover, each carrier has reserved requests, which must be served by itself, whereas its exchangeable requests can be outsourced to and served by other carriers. This collaboration among carriers can help them to reduce total transportation costs. A mixed integer programming model is proposed to the problem. To solve the model, a hybrid algorithm that combines Genetic Algorithm and Simulated Annealing (GASA) is proposed. This algorithm takes advantages of GASA at the same time. After tuning the parameters of the algorithm with the Taguchi method, the experiments are conducted and experimental results are provided for the hybrid algorithm. The results are compared with those obtained by a commercial solver. The comparison indicates that the GASA significantly outperforms the commercial solver.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1316760Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF
 M. Zhang. S. Pratap. G. Q. Huang. and Z. Zhao. “Optimal collaborative transportation service trading in B2B e-commerce logistics.” International Journal of Production Research. vol. 55. pp. 5485–5501. 2017.
 H. Chen. “Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation.” Transportation Research Part E. vol. 91. pp. 152-172.
 S. D’Amours. and M. Rönnqvist. “Issues in collaborative logistics.” Energy. Natural Resources and Environmental Economics. Part 3. Springer.
 L. Houghtalen. “Designing allocation mechanisms for carrier alliances.” PhD Thesis. Georgia Institute of Technology. USA. 2007.
 E. Markakis. and A. Saberi. “On the core of the multi-commodity flow game .” EC 03: Proceedings of the 4thACM Conference on Electronic Commerce. ACM Press. New York. USA. PP. 93-97. 2003.
 S. Hernandez. and S. Peeta. “A centralized time dependent multiple less-than-truckload carrier collaboration problem.” Transportation Research Board. 2007. Accepted. available at the website: http://amonline.trb.org/12juh5/12juh5/1
 Y. Li. H. Chen. and C. Prins. “Adaptive large neighborhood search for the pickup and delivery problem with time windows. profits. and reserved requests.” European Journal of Operational Research. vol. 252. PP. 27–38. 2016.
 J. H. Holland. “Adaptation in natural and artificial systems:An introductory analysis with applications to biology.” control and artificial intelligence. Michigan: University of Michigan Press. 1975.
 S. H. Karna. and R. Sahi. “An Overview on Taguchi Method.” International Journal of Engineering and Mathematical Sciences. vol.1. pp.11-18. 2012.
 R. Rao. Sreenivas; R. S. Prakasham. K. Krishna Prasad. S. Rajesham. P. N. Sarma. and L. VenkateswarRao. "Xylitol production by Candida sp.: parameter optimization using Taguchi approach." Process Biochemistry. vol. 39. pp. 951-956. 2004.
 G. Taguchi. “introduction to Quality Engineering-Designing Quality into Products and Processes.” Asian Productivity Organization. Tokyo. 1986.