Modified Differential Evolution Algorithm for a Transportation Software Application

Abstract

This research developed a solution approach that is a combination of a web application and the modified differential evolution (MDE) algorithm, aimed at solving a real-time transportation problem. A case study involving an inbound transportation problem in a company that has to plan the direct shipping of a finished product to be collected at the depot where the vehicles are located is presented. In the newly designed transportation plan, a vehicle will go to pick up the raw material required by a certain production plant from the supplier to deliver to the production plant in a manner that aims to reduce the transportation costs for the whole system. The reoptimized routing is executed when new information is found. The information that is updated is obtained from the web application and the reoptimization process is executed using the MDE algorithm developed to provide the solution to the problem. Generally, the original DE comprises of four steps: (1) randomly building the initial set of the solution, (2) executing the mutation process, (3) executing the recombination process, and (4) executing the selection process. Originally, for the selection process in DE, the algorithm accepted only the better solution, but in this paper, four new selection formulas are presented that can accept a solution that is worse than the current best solution. The formula is used to increase the possibility of escaping from the local optimal solution. The computational results show that the MDE outperformed the original DE in all tested instances. The benefit of using real-time decision-making is that it can increase the company’s profit by 5.90% to 6.42%.

Solving the Two Echelon Vehicle Routing Problem Using Simulated Annealing Algorithm Considering Drop Box Facilities and Emission Cost: A Case Study of Reverse Logistics Application in Indonesia

“…In the third part of the experiment, a convergency analysis of the SA algorithm is similar to that of previous studies [33,34]. We compared the convergency of the SA algorithm with other metaheuristics algorithms, in this case a Genetic Algorithm (GA).…”

Metaheuristics in Business Model Development for Local Tourism Sustainability Enhancement

“…6-12), and large sized problems (instance no. [13][14][15][16][17][18][19][20]. All details of the test instances are shown in Table 7.…”

“…Consequently, the original structure was required to improve its performance. Various studies have investigated the DE approach, and it has been used extensively in multiple problems, such as a workforce scheduling and routing problem in a sugarcane mill [15], a multi-trip vehicle routing problem with backhauls and a heterogeneous fleet in the beverage logistics industry [16], a large-scale global black-box optimization problem [17], a cyclical multiple parallel machine scheduling problem in sugarcane unloading systems [18], and an employee transportation problem [19,20]. The variable neighborhood search algorithm is a metaheuristic that uses the idea of neighborhood change, which has more than one type of neighborhood structure, to systematically explore the solution space [18,21].…”

A Novel Enhanced Differential Evolution Algorithm for Outbound Logistics of the Poultry Industry in Thailand

“…Then, the results were compared between the solution from the MILP by the LINGO program and ALNS. Supattananon and Akararungruangkul [31] presented a combination of a web application and the modified differential evolution (MDE) algorithm for the vehicle dispatching problem (VDP). They modified the DE with the probability of accepting the solution in the four different equations.…”