This research article aims to solve the special case of the location routing problem (SLRP) when the objective function is the fuel consumption. The fuel consumption depends on the distance of travel and the condition of the road. The condition of the road causes the vehicle to use a different speed, which affects fuel usage. This turns the original LRP into a more difficult problem. Moreover, the volume of the goods that are produced in each node could be more or less than the capacity of the vehicle, and as the case study requires the transportation of latex, which is a sensitive good and needs to be carried within a reasonable time so that it does not form solid before being used in the latex process, the maximum time that the latex can be in the truck is limited. All of these attributes are added into the LRP and make it a special case of LRP: a so-called SLRP (a special case of location routing problem). The differential evolution algorithms (DE) are proposed to solve the SLRP. We modified two points in the original DE, which are that (1) the mutation formula is introduced and (2) the new rule of a local search is presented. We call this the modified differential evolution algorithm (MDE). From the computational result, we can see that MDE generates a 13.82% better solution than that of the original version of DE in solving the test instances.
This article aims to minimize cycle time for a simple assembly line balancing problem type 2 by presenting a variable neighborhood strategy adaptive search method (VaNSAS) in a case study of the garment industry considering the number and types of machines used in each workstation in a simple assembly line balancing problem type 2 (SALBP-2M). The variable neighborhood strategy adaptive search method (VaNSAS) is a new method that includes five main steps, which are (1) generate a set of tracks, (2) make all tracks operate in a specified black box, (3)operate the black box, (4) update the track, and (5) repeat the second to fourth steps until the termination condition is met. The proposed methods have been tested with two groups of test instances, which are datasets of (1) SALBP-2 and (2) SALBP-2M. The computational results show that the proposed methods outperform the best existing solution found by the LINGO modeling program. Therefore, the VaNSAS method provides a better solution and features a much lower computational time.objective of this research is to develop an appropriate method for solving a simple assembly line balancing problem type 2, presenting a case study of the garment industry.Chesbrough [1] said that large organizations work together to drive innovation and create sustainable growth by using the concept of open innovation, which is considered to be related to industry that has adopted "technology, tools, or methods" for the industry in production systems, as well as making products according to the various needs of consumers. However, the industry still has to maintain production efficiency in order to meet the required quality. In addition, new technology, tools, and methods must be also studied and selected to be suitable for the production system and the current knowledge. Many industries still rely on human labor for production, especially the garment industry. When a problem occurs, it will be solved immediately without applying technology or any new methods to resolve it, which causes production efficiency to be at a low level. Therefore, to increase the capacity of the production system, in order to compete with other industries, it is necessary to use the concept of open innovation to help in production planning, reduce the time required for industry operations, and increase production efficiency.The assembly line balancing problem is a form of production planning used for task assignments [2] or to assign work to each station to let each work station operate with the same average production time and allow the process flow system to be flexible and eliminate delay or bottlenecks in order to be able to produce products correctly and eliminate mistakes during production. The precedence diagram or table of relationships determines the operation according to the workflow that is clearly specified in the production process. There are different objectives for problem solving, such as reducing production time, reducing the number of workstations, determining the efficiency of assembly line bal...
This study aims to solve the real-world multistage assignment problem. The proposed problem is composed of two stages of assignment: (1) different types of trucks are assigned to chicken farms to transport young chickens to egg farms, and (2) chicken farms are assigned to egg farms. Assigning different trucks to the egg farms and different egg farms to the chicken farms generates different costs and consumes different resources. The distance and the idle space in the truck have to be minimized, while constraints such as the minimum number of chickens needed for all egg farms and the longest time that chickens can be in the truck remain. This makes the problem a special case of the multistage assignment (S-MSA) problem. A mathematical model representing the problem was developed and solved to optimality using Lingo v.11 optimization software. Lingo v.11 can solve to optimality only small- and medium-sized test instances. To solve large-sized test instances, the differential evolution (DE) algorithm was designed. An excellent decoding method was developed to increase the search performance of DE. The proposed algorithm was tested with three randomly generated datasets (small, medium, and large test instances) and one real case study. Each dataset is composed of 12 problems, therefore we tested with 37 instances, including the case study. The results show that for small- and medium-sized test instances, DE has 0.03% and 0.05% higher cost than Lingo v.11. For large test instances, DE has 3.52% lower cost than Lingo v.11. Lingo v.11 uses an average computation time of 5.8, 103, and 4320 s for small, medium and large test instances, while DE uses 0.86, 1.68, and 8.79 s, which is, at most, 491 times less than Lingo v.11. Therefore, the proposed heuristics are an effective algorithm that can find a good solution while using less computation time.
This study presents the Location Routing Problem (LRP) for which we have created a model for the integration of locating facilities and vehicle routing decisions to solve the problem. The case study is the Palm Oil Collection Center, which is also important for the supply chain system. A mathematical model was made to minimize the total cost of a facility-opening cost, fixed cost of vehicle uses and fuel consumption cost. The fuel consumption cost relies on the distance and road conditions, in case of poor physical condition of a road, and its width, which can be affected the speed of the vehicle as well as the used fuel. Thus, we propose an Adaptive Large Neighborhood Search (ALNS) based on heuristic for solving the LRP. The ALNS method was tested with three datasets of samples divided into small, medium and large problems. Then, the results were compared with the results from the exact method by the Lingo program. The computational study indicated that the ALNS algorithm was competitive to the results of the Lingo for all instance sizes. Moreover, the ALNS was more effective than the exact method; approximately 99% in terms of processing time. We extended this approach to solve the case study, which was considered to be the largest problem, and the ALNS algorithm was efficient with acceptable solutions and short processing time. Therefore, the proposed method provided an effective solution to manage location routing decision of the palm oil collection center.
This paper aims to solve the location and routing problem (LRP) in the agricultural sector with the objective function of fuel cost minimization. Many farmers may have problems when transporting and selling products because of high costs and unfair prices. The proper location of standardized procurement centers and suitable routes will relieve farmers’ problems. This paper includes a realistic constraint that a farm can be visited to collect product more than once. A mathematical model was formulated to be solved by Lingo software, but when the problem size was larger, Lingo was unable to solve the problem within a reasonable processing time. The variable neighborhood strategy adaptive search (VaNSAS) is proposed to solve this LRP. The main contributions of this paper are a real case study problem and the first introduction of VaNSAS. Furthermore, the different combinations of the solution approach are proposed to prove which combination is the best algorithm. The computational results show that VaNSAS can find the solutions for all problem sizes in much less processing time compared to Lingo. In medium and large-sized instances, the VaNSAS can reduce processing times by 99.91% and 99.86%, respectively, from solutions obtained by Lingo. Finally, the proposed VaNSAS has been deployed in a case study problem to decide the best locations and transportation routes with the lowest fuel cost.
This paper presents a methodology to solve a special case of the vehicle routing problem (VRP) called the heterogeneous fleets VRP with excessive demand of the vehicle at the pickup points, and the longest time constraint (HFVRP-EXDE-LTC). We developed two metaheuristics-a differential evolution (DE) algorithm and an adaptive large neighborhood search (ALNS)-to solve the problem. These two proposed methods have been designed to effectively solve a special case of VRP. From the computational results, we can see that the proposed heuristics outperformed the best practices that are currently in use. The DE yielded a 9.78% lower cost than that of the current practice (757,250 baht per year), while ALNS generated a 10.89% (906,750 baht per year) lower cost than that of current practice. Comparing the proposed heuristics, ALNS achieved a 1.01% lower cost than that of DE, as ALNS had a better mechanism that was designed to escape from the local optimal.
This article aims to resolve a particular production planning and workforce assignment problem. Many production lines may have different production capacities while producing the same product. Each production line is composed of three production stages, and each stage requires different periods of times and numbers of workers. Moreover, the workers will have different skill levels which can affect the number of workers required for production line. The number of workers required in each farm also depends on the amount of pigs that it is producing. Production planning must fulfill all the demands and can only make use of the workers available. A production plan aims to generate maximal profit for the company. A mathematical model has been developed to solve the proposed problem, when the size of problem increases, the model is unable to resolve large issues within a reasonable timeframe. A metaheuristic method called adaptive large-scale neighborhood search (ALNS) has been developed to solve the case study. Eight destroy and four repair operators (including ant colony optimization based destroy and repair methods) have been presented. Moreover, three formulas which are used to make decisions for acceptance of the newly generated solution have been proposed. The present study tested 16 data sets, including the case study. From the computational results of the small size of test instances, ALNS should be able to find optimal solutions for all the random data sets in much less computational time compared to commercial optimization software. For medium and larger test instance sizes, the findings of the heuristics were 0.48% to 0.92% away from the upper bound and generated within 480–620 h, in comparison to the 1 h required for the proposed method. The Ant Colony Optimization-based destroy and repair method found solutions that were 0.98 to 1.03% better than the original ALNS.
This research aimed to present a solution to the problem of production scheduling and assignment in broiler farms, which thus enabled the farms to achieve maximum profit. In the operation of farms, there are many factors that affect profits, such as the number of broilers being consistent with the demand of production plants, including profits from the sales and transportation costs. Therefore, we formulated a mathematical model and tested it while using three problem groups through the Lingo v.11 program. The results indicated that this mathematical model could find a suitable solution. However, finding the best solution had time constraints, which resulted in various other problems that prevented a search for an optimal solution due to time consumption exceeding 72 h. We developed an algorithm using the Adaptive Large Neighborhood Search (ALNS) method in order to find another possible solution using a shorter time period, which consisted of ALNS1, ALNS2, and ALNS3. These algorithms are based on a combination of the method of destruction solutions and methods accepting different solutions. We aimed to effectively solve the problems and ensure that they are appropriate for the case study, a broiler farm in Buriram. When comparing the algorithm efficiency with the Lingo v.11 program, it was found that the ALNS1 algorithm was the most suitable for finding the optimal solution in the shortest time, which resulted in a 5.74% increase in operating profits.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.