USING A GENETIC ALGORITHM TO SOLVE A VEHICLE ROUTING PROBLEM INVOLVING SIMULTANEOUS DELIVERIES AND PICKUPS WITH SPLIT LOADS AND TIME WINDOWS (A CASE STUDY FOR A SHIPPING COMPANY)

被引:0
|
作者
Ferdianti, Shea Amanda [1 ]
Widyadana, I. Gede Agus [1 ]
机构
[1] Petra Christian Univ, Dept Ind Engn, Fac Ind Technol, Surabaya, East Java, Indonesia
关键词
vehicle routing problem; simultaneous deliveries and pickups; split loads; time windows; optimization; genetic algorithm;
D O I
10.17270/J.LOG.2023.904
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Background: This research addresses a Vehicle Routing Problem with Simultaneous Delivery and Pickup, Split Loads, and Time Windows (VRPSDPSLTW). In this research, the VRPSDPSLTW problem is adapted for Company X, a shipping company based in Surabaya. The main goal is to enhance the optimal utilization of vessel capacity in the field of shipping transportation and logistics. Little previous research has been done on VRPSDPSLTW at a shipping company. Methods: The optimization approach employed was the Genetic Algorithm (GA), which serves as a metaheuristic to effectively optimize vessel capacity utilization. The algorithm uses One Point Crossover and Swap Mutation operators and analyzes various mutation parameters to determine the best configuration. The GA was coded in R, and experiments were conducted to obtain the best parameter for the GA. Results: The research yielded several outcomes, including route plans, loaded and unloaded Twenty-Foot Equivalent Units (TEUs), travel times, and trip utility from the point of loading (POL) to the point of delivery (POD). In total, there were 85 port visits, surpassing the initial count of 35 ports. Some ports were visited multiple times, with the exception of Surabaya, which served as the home base for a fleet of 15 vessels. The average trip duration was approximately 35 days. Through experimentation, it was determined that employing 1,000 generations along with a mutation probability of 0.2 produces improved solutions. The Genetic Algorithm solution enhanced the average vessel capacity utilization, increasing it to 80.93%. This represents a significant 21.23% increase compared to the global average of 59.7% observed for similar vessel usage scenarios. Conclusions: Furthermore, through the introduction of novel route opportunities, the contributions of each vessel were effectively enhanced. This achievement resulted in an optimal average vessel capacity utilization that met the demand. The findings strongly advocate for the employment of the Genetic Algorithm, highlighting its potential to substantially improve vessel capacity utilization. Consequently, this approach has played a pivotal role in elevating the efficiency of transportation and logistics operations for Company X.
引用
收藏
页码:577 / 593
页数:17
相关论文
共 50 条
  • [1] Vehicle Routing Problem Simultaneous Deliveries and Pickups with Split Loads and Time Windows
    Wang, Yong
    Ma, Xiaolei
    Lao, Yunteng
    Wang, Yinhai
    Mao, Haijun
    TRANSPORTATION RESEARCH RECORD, 2013, (2378) : 120 - 128
  • [2] An Improved Genetic Algorithm for Vehicle Routing Problem with Simultaneous Pickups and Deliveries and Time Windows
    Huang Wulan
    Zhang Tao
    PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE 2016, 2016, : 9639 - 9643
  • [3] Heuristic algorithm to solve vehicle routing problem with split pickups and deliveries
    Yang Y.-Z.
    Jin W.-Z.
    Hao X.-N.
    Tian S.
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2010, 38 (03): : 58 - 63
  • [4] Vehicle Routing Problem with Time Windows and Simultaneous Pickups and Deliveries
    Liang Chun-Hua
    Zhou Hong
    Zhao Jian
    2009 IEEE 16TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2009, : 685 - 689
  • [5] An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows
    Lai Mingyong
    Cao Erbao
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) : 188 - 195
  • [6] Achieving Better Solutions for Vehicle Routing Problem Involving Split Deliveries and Pickups Using a Competitive Decision Algorithm
    Wang Kefeng
    Ye Chunming
    Ning Aibing
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
  • [7] Tabu search algorithm for vehicle routing problem with simultaneous deliveries and pickups
    College of Economics and Management, Southeast University, Nanjing 210096, China
    不详
    不详
    Xitong Gongcheng Lilum yu Shijian, 2007, 6 (117-123):
  • [8] A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
    Gutierrez-Jarpa, Gabriel
    Desaulniers, Guy
    Laporte, Gilbert
    Marianov, Vladimir
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 341 - 349
  • [9] A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups
    Qiu, Meng
    Fu, Zhuo
    Eglese, Richard
    Tang, Qiong
    COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 102 - 116
  • [10] Vehicle Routing Problem with Simultaneous Pickups and Deliveries and Time Windows Considering Fuel Consumption and Carbon Emissions
    Hao Gang
    Gou Zhijing
    Yang Peng
    Sun Junqing
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 3000 - 3005