Location and Routing Planning Considering Electric Vehicles with Restricted Distance in Agriculture

Abstract

Electric vehicles (EVs) are anticipated to play a critical role in the green transportation of the future. Logistics companies have started several projects operating with EVs in road transportation. However, routing decisions for EVs must take limited driving ranges into account. Previous related research on electric vehicle location routing problems (EVLRP) has investigated intra route facilities that support the energy supply network. Contrarily, this paper studies a new type of EVLRP with a restricted distance, where EVs are used for route planning in reverse flow logistics. The model is formulated from a real case problem in agriculture that combines both locating multiple depots and determining routing paths with a limited distance constraint. An adaptive large neighborhood search (ALNS) algorithm has been extended into four combinations and is proposed here for solving the problem. The computational results indicate that the ALNS algorithm can obtain quality solutions in short processing time when compared with software using exact methods. Furthermore, the proposed ALNS algorithm is applied to a case study problem to provide suitable locations and vehicle routes with a minimized total cost.

Variable Neighborhood Strategy Adaptive Search for Optimal Parameters of SSM-ADC 12 Aluminum Friction Stir Welding

“…In addition, several heuristic methods were used for optimization prediction to improve the speed and success of the tour routing, transportation, agriculture, and manufacturing processes [53][54][55][56][57][58]. Several studies used heuristic methods for optimized problem solving, such as adaptive large neighborhood search (ALNS), genetic algorithm (GA), differential evolution (DE), particle swarm optimization (PSO), variable neighborhood strategy adaptive search (VaNSAS), etc.…”

“…These heuristics are successful in problem solving and lead to better solutions than conventional methods [15,43,44,50,51]. The VaNSAS algorithm was found to give higher accuracy than other algorithms, with an average solution accuracy of 99.92% [44,51,52,54]. Assembly line balancing problems in manufacturing processes and location routing problems in transportation can be solved using the VaNSAS algorithm to reduce transport time and costs.…”

Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

“…Ferdi and Layeb [29] propose a GRASP with a novel technique used to create clusters around the open depots. Traditional applications of the LRP include horizontal cooperation [30], electric vehicle routing problems [31][32][33], city logistics [34], humanitarian logistics [35] or supply chain network design [36]. Moreover, most recent applications are related to environmental issues [37], cold supply chains [38] or waste management [39].…”

Variable Neighborhood Strategy Adaptive Search to Solve Parallel-Machine Scheduling to Minimize Energy Consumption While Considering Job Priority and Control Makespan

“…Parallel machine scheduling is defined as sequencing and assigning jobs into machines when similar types of machines are available and jobs can be scheduled in these machines. A variety of sequencing and/or processing restrictions often exist when decision makers try to minimize some related objective functions [14][15][16][17][18][19][20][21][22][23][24]; however, most enterprises still use advanced machines running alongside outdated ones. In contrast to the old ones, modern machines are usually adjusted to work at a high speed and save energy.…”